/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:39:48,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:39:48,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:39:48,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:39:48,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:39:48,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:39:48,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:39:48,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:39:48,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:39:48,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:39:48,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:39:48,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:39:48,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:39:48,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:39:48,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:39:48,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:39:48,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:39:48,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:39:48,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:39:48,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:39:48,054 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:39:48,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:39:48,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:39:48,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:39:48,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:39:48,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:39:48,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:39:48,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:39:48,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:39:48,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:39:48,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:39:48,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:39:48,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:39:48,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:39:48,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:39:48,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:39:48,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:39:48,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:39:48,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:39:48,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:39:48,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:39:48,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:39:48,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:39:48,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:39:48,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:39:48,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:39:48,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:39:48,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:39:48,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:39:48,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:39:48,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:39:48,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:39:48,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:39:48,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:39:48,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:39:48,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:39:48,088 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:39:48,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:39:48,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:39:48,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:39:48,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:39:48,318 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:39:48,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-08 09:39:48,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8384754/e17fdac2daa64ecd894276009690dfa0/FLAG151b8d4bf [2022-04-08 09:39:48,759 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:39:48,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-08 09:39:48,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8384754/e17fdac2daa64ecd894276009690dfa0/FLAG151b8d4bf [2022-04-08 09:39:49,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8384754/e17fdac2daa64ecd894276009690dfa0 [2022-04-08 09:39:49,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:39:49,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:39:49,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:39:49,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:39:49,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:39:49,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb8bc2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49, skipping insertion in model container [2022-04-08 09:39:49,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:39:49,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:39:49,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i[895,908] [2022-04-08 09:39:49,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:39:49,377 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:39:49,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i[895,908] [2022-04-08 09:39:49,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:39:49,404 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:39:49,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49 WrapperNode [2022-04-08 09:39:49,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:39:49,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:39:49,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:39:49,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:39:49,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:39:49,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:39:49,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:39:49,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:39:49,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (1/1) ... [2022-04-08 09:39:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:39:49,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:49,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:39:49,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:39:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:39:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:39:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:39:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:39:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:39:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:39:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:39:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:39:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:39:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:39:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:39:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:39:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:39:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:39:49,532 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:39:49,533 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:39:49,674 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:39:49,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:39:49,679 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:39:49,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:49 BoogieIcfgContainer [2022-04-08 09:39:49,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:39:49,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:39:49,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:39:49,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:39:49,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:39:49" (1/3) ... [2022-04-08 09:39:49,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa33fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:49, skipping insertion in model container [2022-04-08 09:39:49,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:49" (2/3) ... [2022-04-08 09:39:49,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa33fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:49, skipping insertion in model container [2022-04-08 09:39:49,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:49" (3/3) ... [2022-04-08 09:39:49,698 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2022-04-08 09:39:49,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:39:49,703 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:39:49,739 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:39:49,746 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:39:49,746 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:39:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:39:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:39:49,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:49,773 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:49,774 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:49,778 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 1 times [2022-04-08 09:39:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:49,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171866468] [2022-04-08 09:39:49,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:39:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 2 times [2022-04-08 09:39:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:49,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748482191] [2022-04-08 09:39:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:49,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-08 09:39:49,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 09:39:49,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-08 09:39:49,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:49,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-08 09:39:49,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 09:39:49,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-08 09:39:49,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-08 09:39:49,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {25#true} is VALID [2022-04-08 09:39:49,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {25#true} is VALID [2022-04-08 09:39:49,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {25#true} is VALID [2022-04-08 09:39:49,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 09:39:49,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume ~i~0 == ~j~0; {26#false} is VALID [2022-04-08 09:39:49,972 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {26#false} is VALID [2022-04-08 09:39:49,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 09:39:49,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 09:39:49,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 09:39:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:49,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748482191] [2022-04-08 09:39:49,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748482191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:49,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:49,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:39:49,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:49,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171866468] [2022-04-08 09:39:49,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171866468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:49,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:49,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:39:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103176529] [2022-04-08 09:39:49,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:49,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:39:49,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:49,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:50,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:39:50,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:39:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:39:50,029 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,111 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 09:39:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:39:50,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:39:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-08 09:39:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-08 09:39:50,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-08 09:39:50,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:50,191 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:39:50,191 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:39:50,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:39:50,195 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:50,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:39:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:39:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:39:50,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:50,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,220 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,221 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,225 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:39:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:39:50,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:50,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:50,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:39:50,226 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:39:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,229 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:39:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:39:50,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:50,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:50,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:50,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 09:39:50,236 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 14 [2022-04-08 09:39:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:50,238 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 09:39:50,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 09:39:50,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:39:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:39:50,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:50,262 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:50,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:39:50,263 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 1 times [2022-04-08 09:39:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:50,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193959] [2022-04-08 09:39:50,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:39:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 2 times [2022-04-08 09:39:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:50,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309704841] [2022-04-08 09:39:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:50,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {163#true} is VALID [2022-04-08 09:39:50,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-08 09:39:50,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #64#return; {163#true} is VALID [2022-04-08 09:39:50,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:50,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {163#true} is VALID [2022-04-08 09:39:50,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-08 09:39:50,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #64#return; {163#true} is VALID [2022-04-08 09:39:50,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret5 := main(); {163#true} is VALID [2022-04-08 09:39:50,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {163#true} is VALID [2022-04-08 09:39:50,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {163#true} is VALID [2022-04-08 09:39:50,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {168#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} is VALID [2022-04-08 09:39:50,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {168#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} assume !(0 != ~x~0); {169#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-08 09:39:50,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} assume ~i~0 == ~j~0; {170#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-08 09:39:50,544 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:50,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:50,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {164#false} is VALID [2022-04-08 09:39:50,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-08 09:39:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:50,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:50,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309704841] [2022-04-08 09:39:50,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309704841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:50,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:50,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:39:50,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:50,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193959] [2022-04-08 09:39:50,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:50,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:50,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:39:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066775699] [2022-04-08 09:39:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:39:50,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:50,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:50,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:39:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:39:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:39:50,566 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,856 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:39:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:39:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:39:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 09:39:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 09:39:50,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-08 09:39:50,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:50,881 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:39:50,881 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 09:39:50,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:39:50,883 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:50,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:39:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 09:39:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 09:39:50,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:50,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,892 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,892 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,893 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:39:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:50,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:50,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:50,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 09:39:50,894 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 09:39:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:50,894 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:39:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:50,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:50,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:50,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:50,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:39:50,932 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 09:39:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:50,932 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:39:50,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:50,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:39:50,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:39:50,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:50,951 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:50,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:39:50,951 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1050868340, now seen corresponding path program 1 times [2022-04-08 09:39:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:50,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [662248113] [2022-04-08 09:39:50,962 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:50,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1050868340, now seen corresponding path program 2 times [2022-04-08 09:39:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:50,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988012407] [2022-04-08 09:39:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:51,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {294#true} is VALID [2022-04-08 09:39:51,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-08 09:39:51,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-08 09:39:51,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:51,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {294#true} is VALID [2022-04-08 09:39:51,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-08 09:39:51,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-08 09:39:51,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret5 := main(); {294#true} is VALID [2022-04-08 09:39:51,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {294#true} is VALID [2022-04-08 09:39:51,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {294#true} is VALID [2022-04-08 09:39:51,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:51,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {300#(and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0 1) main_~j~0)) (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-08 09:39:51,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0 1) main_~j~0)) (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} assume !(0 != ~x~0); {301#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-08 09:39:51,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {301#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-08 09:39:51,153 INFO L272 TraceCheckUtils]: 11: Hoare triple {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {303#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:51,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {304#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:51,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {295#false} is VALID [2022-04-08 09:39:51,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-08 09:39:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:51,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:51,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988012407] [2022-04-08 09:39:51,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988012407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:51,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288458801] [2022-04-08 09:39:51,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:39:51,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:51,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:51,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:39:51,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:39:51,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:39:51,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:51,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 09:39:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:51,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:51,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-08 09:39:51,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {294#true} is VALID [2022-04-08 09:39:51,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-08 09:39:51,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-08 09:39:51,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret5 := main(); {294#true} is VALID [2022-04-08 09:39:51,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {294#true} is VALID [2022-04-08 09:39:51,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {294#true} is VALID [2022-04-08 09:39:51,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:51,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {333#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-08 09:39:51,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (<= (+ main_~y~0 2) main_~j~0))} assume !(0 != ~x~0); {337#(and (<= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= main_~z~0 1) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-08 09:39:51,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(and (<= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= main_~z~0 1) (<= (+ main_~y~0 2) main_~j~0))} assume ~i~0 == ~j~0; {341#(and (= main_~z~0 1) (<= (+ main_~y~0 1) 0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 09:39:51,560 INFO L272 TraceCheckUtils]: 11: Hoare triple {341#(and (= main_~z~0 1) (<= (+ main_~y~0 1) 0) (<= 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:51,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:51,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {295#false} is VALID [2022-04-08 09:39:51,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-08 09:39:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:51,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:51,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-08 09:39:51,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {295#false} is VALID [2022-04-08 09:39:51,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:51,742 INFO L272 TraceCheckUtils]: 11: Hoare triple {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:51,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-08 09:39:51,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {368#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-08 09:39:51,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {372#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-08 09:39:51,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {376#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-08 09:39:51,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {294#true} is VALID [2022-04-08 09:39:51,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {294#true} is VALID [2022-04-08 09:39:51,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret5 := main(); {294#true} is VALID [2022-04-08 09:39:51,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-08 09:39:51,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-08 09:39:51,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {294#true} is VALID [2022-04-08 09:39:51,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-08 09:39:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:51,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288458801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:39:51,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:39:51,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-08 09:39:51,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:51,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [662248113] [2022-04-08 09:39:51,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [662248113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:51,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:51,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:39:51,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735288531] [2022-04-08 09:39:51,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:51,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:39:51,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:51,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:51,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:51,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:39:51,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:51,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:39:51,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:39:51,763 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:52,010 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:39:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:39:52,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:39:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 09:39:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 09:39:52,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-08 09:39:52,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:52,035 INFO L225 Difference]: With dead ends: 23 [2022-04-08 09:39:52,035 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:39:52,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:39:52,037 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:52,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:39:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:39:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:39:52,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:52,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:52,045 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:52,045 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:52,046 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:39:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:39:52,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:52,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:52,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:39:52,046 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:39:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:52,047 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:39:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:39:52,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:52,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:52,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:52,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 09:39:52,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-08 09:39:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:52,049 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 09:39:52,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:52,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 09:39:52,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:39:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:39:52,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:52,064 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:52,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:39:52,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:52,280 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:52,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:52,280 INFO L85 PathProgramCache]: Analyzing trace with hash -987089486, now seen corresponding path program 3 times [2022-04-08 09:39:52,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:52,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167217761] [2022-04-08 09:39:52,281 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:52,281 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash -987089486, now seen corresponding path program 4 times [2022-04-08 09:39:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:52,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035982211] [2022-04-08 09:39:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:52,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:52,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {529#true} is VALID [2022-04-08 09:39:52,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-08 09:39:52,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {529#true} {529#true} #64#return; {529#true} is VALID [2022-04-08 09:39:52,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:52,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {529#true} is VALID [2022-04-08 09:39:52,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-08 09:39:52,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #64#return; {529#true} is VALID [2022-04-08 09:39:52,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret5 := main(); {529#true} is VALID [2022-04-08 09:39:52,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {529#true} is VALID [2022-04-08 09:39:52,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {529#true} is VALID [2022-04-08 09:39:52,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {534#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:52,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {535#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} is VALID [2022-04-08 09:39:52,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {535#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {536#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-08 09:39:52,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {536#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} assume !(0 != ~x~0); {537#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-08 09:39:52,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {537#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {538#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-08 09:39:52,455 INFO L272 TraceCheckUtils]: 12: Hoare triple {538#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {539#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:52,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {540#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:52,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {540#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {530#false} is VALID [2022-04-08 09:39:52,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-08 09:39:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:52,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035982211] [2022-04-08 09:39:52,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035982211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:52,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948456309] [2022-04-08 09:39:52,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:39:52,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:52,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:52,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:39:52,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:39:52,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:39:52,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:52,486 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 09:39:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:52,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:52,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {529#true} is VALID [2022-04-08 09:39:52,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {529#true} is VALID [2022-04-08 09:39:52,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-08 09:39:52,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #64#return; {529#true} is VALID [2022-04-08 09:39:52,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret5 := main(); {529#true} is VALID [2022-04-08 09:39:52,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {529#true} is VALID [2022-04-08 09:39:52,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {529#true} is VALID [2022-04-08 09:39:52,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {534#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:52,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {569#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-08 09:39:52,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {573#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} is VALID [2022-04-08 09:39:52,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} assume !(0 != ~x~0); {577#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ (- 1) main_~i~0) 1) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} is VALID [2022-04-08 09:39:52,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {577#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ (- 1) main_~i~0) 1) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} assume ~i~0 == ~j~0; {581#(and (<= 0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) 0) (= main_~z~0 2))} is VALID [2022-04-08 09:39:52,759 INFO L272 TraceCheckUtils]: 12: Hoare triple {581#(and (<= 0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) 0) (= main_~z~0 2))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:52,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:52,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {530#false} is VALID [2022-04-08 09:39:52,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-08 09:39:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:52,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:52,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-08 09:39:52,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {530#false} is VALID [2022-04-08 09:39:52,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:52,989 INFO L272 TraceCheckUtils]: 12: Hoare triple {538#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:52,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {538#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-08 09:39:52,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {612#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {608#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-08 09:39:52,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {612#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-08 09:39:52,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {616#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-08 09:39:52,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {620#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)))} is VALID [2022-04-08 09:39:52,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {529#true} is VALID [2022-04-08 09:39:52,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {529#true} is VALID [2022-04-08 09:39:52,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret5 := main(); {529#true} is VALID [2022-04-08 09:39:52,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #64#return; {529#true} is VALID [2022-04-08 09:39:52,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-08 09:39:52,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {529#true} is VALID [2022-04-08 09:39:52,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {529#true} is VALID [2022-04-08 09:39:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:52,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948456309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:39:52,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:39:52,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-08 09:39:52,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:52,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167217761] [2022-04-08 09:39:52,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167217761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:52,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:52,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:39:52,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914712883] [2022-04-08 09:39:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:52,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:39:52,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:52,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:53,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:39:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:39:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:39:53,009 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:53,244 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:39:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:39:53,244 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:39:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-08 09:39:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-08 09:39:53,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-08 09:39:53,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:53,266 INFO L225 Difference]: With dead ends: 24 [2022-04-08 09:39:53,266 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 09:39:53,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:39:53,269 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:53,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:39:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 09:39:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 09:39:53,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:53,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,278 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,279 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:53,279 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:39:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:39:53,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:53,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:53,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 09:39:53,280 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 09:39:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:53,284 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:39:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:39:53,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:53,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:53,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:53,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 09:39:53,286 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-08 09:39:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:53,287 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 09:39:53,287 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:53,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 09:39:53,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:39:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:39:53,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:53,300 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:53,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:39:53,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 09:39:53,513 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash 990054988, now seen corresponding path program 5 times [2022-04-08 09:39:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:53,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617413169] [2022-04-08 09:39:53,515 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:53,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash 990054988, now seen corresponding path program 6 times [2022-04-08 09:39:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:53,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677160179] [2022-04-08 09:39:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:53,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {781#true} is VALID [2022-04-08 09:39:53,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-08 09:39:53,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-08 09:39:53,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:53,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {781#true} is VALID [2022-04-08 09:39:53,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-08 09:39:53,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-08 09:39:53,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret5 := main(); {781#true} is VALID [2022-04-08 09:39:53,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {781#true} is VALID [2022-04-08 09:39:53,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {781#true} is VALID [2022-04-08 09:39:53,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {786#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:53,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {787#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} is VALID [2022-04-08 09:39:53,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {787#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {788#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} is VALID [2022-04-08 09:39:53,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {789#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-08 09:39:53,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {789#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} assume !(0 != ~x~0); {790#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-08 09:39:53,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} assume ~i~0 == ~j~0; {791#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-08 09:39:53,684 INFO L272 TraceCheckUtils]: 13: Hoare triple {791#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:53,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {793#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:53,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {793#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {782#false} is VALID [2022-04-08 09:39:53,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-08 09:39:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:53,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:53,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677160179] [2022-04-08 09:39:53,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677160179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:53,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543191676] [2022-04-08 09:39:53,686 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:39:53,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:53,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:53,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:39:53,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 09:39:53,735 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:39:53,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:53,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 09:39:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:53,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:54,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-08 09:39:54,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {781#true} is VALID [2022-04-08 09:39:54,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-08 09:39:54,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-08 09:39:54,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret5 := main(); {781#true} is VALID [2022-04-08 09:39:54,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {781#true} is VALID [2022-04-08 09:39:54,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {781#true} is VALID [2022-04-08 09:39:54,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {786#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-08 09:39:54,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {822#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-08 09:39:54,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {826#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} is VALID [2022-04-08 09:39:54,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {826#(and (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)) (= main_~z~0 2))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {830#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= main_~z~0 3) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} is VALID [2022-04-08 09:39:54,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= main_~z~0 3) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} assume !(0 != ~x~0); {834#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= main_~z~0 3) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:39:54,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {834#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= main_~z~0 3) (= (+ (- 1) main_~i~0) 2))} assume ~i~0 == ~j~0; {838#(and (<= 0 (+ main_~y~0 3)) (<= (+ main_~y~0 3) 0) (= main_~z~0 3))} is VALID [2022-04-08 09:39:54,015 INFO L272 TraceCheckUtils]: 13: Hoare triple {838#(and (<= 0 (+ main_~y~0 3)) (<= (+ main_~y~0 3) 0) (= main_~z~0 3))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:54,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:54,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-08 09:39:54,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-08 09:39:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:54,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:54,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-08 09:39:54,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-08 09:39:54,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:54,248 INFO L272 TraceCheckUtils]: 13: Hoare triple {791#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:54,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {865#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {791#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-08 09:39:54,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {869#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} assume !(0 != ~x~0); {865#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-08 09:39:54,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {869#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-08 09:39:54,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#(or (not (= main_~i~0 main_~j~0)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)) (not (= (+ (- 1) main_~x~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {873#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)))} is VALID [2022-04-08 09:39:54,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 3) (< 2 (+ main_~z~0 main_~y~0))) (not (= (+ (- 2) main_~x~0) 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {877#(or (not (= main_~i~0 main_~j~0)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)) (not (= (+ (- 1) main_~x~0) 1)))} is VALID [2022-04-08 09:39:54,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {881#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 3) (< 2 (+ main_~z~0 main_~y~0))) (not (= (+ (- 2) main_~x~0) 1)))} is VALID [2022-04-08 09:39:54,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {781#true} is VALID [2022-04-08 09:39:54,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {781#true} is VALID [2022-04-08 09:39:54,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret5 := main(); {781#true} is VALID [2022-04-08 09:39:54,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-08 09:39:54,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-08 09:39:54,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {781#true} is VALID [2022-04-08 09:39:54,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-08 09:39:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:54,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543191676] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:39:54,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:39:54,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-08 09:39:54,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:54,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617413169] [2022-04-08 09:39:54,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617413169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:54,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:54,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:39:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949110977] [2022-04-08 09:39:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:39:54,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:54,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:54,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:54,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:39:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:54,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:39:54,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:39:54,267 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:54,491 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:39:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:39:54,491 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:39:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-08 09:39:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-08 09:39:54,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 17 transitions. [2022-04-08 09:39:54,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:54,510 INFO L225 Difference]: With dead ends: 18 [2022-04-08 09:39:54,510 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:39:54,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2022-04-08 09:39:54,512 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:54,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:39:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:39:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:39:54,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:54,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:39:54,514 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:39:54,514 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:39:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:54,514 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:39:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:54,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:54,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:54,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:39:54,515 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:39:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:54,515 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:39:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:54,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:54,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:54,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:54,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:39:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:39:54,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-08 09:39:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:54,515 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:39:54,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:54,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:39:54,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:54,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:54,518 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:39:54,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:39:54,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:54,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:39:54,846 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:39:54,847 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:39:54,847 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:39:54,847 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:39:54,847 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:54,847 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:54,847 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:54,847 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 37) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~z~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-08 09:39:54,847 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 24 42) the Hoare annotation is: (let ((.cse4 (+ main_~z~0 main_~y~0 1))) (or (let ((.cse2 (<= (+ main_~z~0 main_~y~0) 0)) (.cse3 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~z~0 main_~y~0)) (.cse1 (not (<= .cse4 0)))) (and (or (<= main_~j~0 .cse0) .cse1) (or .cse2 (<= .cse0 main_~j~0)) (or (<= .cse0 .cse3) .cse2) (or (<= .cse3 .cse0) .cse1))) (and (= main_~z~0 0) (<= main_~y~0 main_~j~0) (= main_~i~0 0) (< 0 .cse4)))) [2022-04-08 09:39:54,847 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-08 09:39:54,847 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 42) the Hoare annotation is: true [2022-04-08 09:39:54,847 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 42) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point L38(lines 38 40) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 42) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-08 09:39:54,848 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:39:54,848 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:39:54,848 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:39:54,851 INFO L719 BasicCegarLoop]: Path program histogram: [6, 2, 2] [2022-04-08 09:39:54,852 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:39:54,854 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:39:54,854 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:39:54,855 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:39:54,856 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:39:54,856 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:39:54,856 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:39:54,857 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:39:54,862 INFO L163 areAnnotationChecker]: CFG has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:39:54,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:39:54 BoogieIcfgContainer [2022-04-08 09:39:54,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:39:54,869 INFO L158 Benchmark]: Toolchain (without parser) took 5688.90ms. Allocated memory was 188.7MB in the beginning and 238.0MB in the end (delta: 49.3MB). Free memory was 135.7MB in the beginning and 102.7MB in the end (delta: 32.9MB). Peak memory consumption was 82.0MB. Max. memory is 8.0GB. [2022-04-08 09:39:54,869 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:39:54,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.88ms. Allocated memory was 188.7MB in the beginning and 238.0MB in the end (delta: 49.3MB). Free memory was 135.4MB in the beginning and 212.8MB in the end (delta: -77.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-04-08 09:39:54,869 INFO L158 Benchmark]: Boogie Preprocessor took 30.95ms. Allocated memory is still 238.0MB. Free memory was 212.8MB in the beginning and 211.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:39:54,870 INFO L158 Benchmark]: RCFGBuilder took 243.05ms. Allocated memory is still 238.0MB. Free memory was 211.3MB in the beginning and 199.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:39:54,870 INFO L158 Benchmark]: TraceAbstraction took 5187.08ms. Allocated memory is still 238.0MB. Free memory was 198.7MB in the beginning and 102.7MB in the end (delta: 96.0MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. [2022-04-08 09:39:54,870 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.88ms. Allocated memory was 188.7MB in the beginning and 238.0MB in the end (delta: 49.3MB). Free memory was 135.4MB in the beginning and 212.8MB in the end (delta: -77.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.95ms. Allocated memory is still 238.0MB. Free memory was 212.8MB in the beginning and 211.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 243.05ms. Allocated memory is still 238.0MB. Free memory was 211.3MB in the beginning and 199.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5187.08ms. Allocated memory is still 238.0MB. Free memory was 198.7MB in the beginning and 102.7MB in the end (delta: 96.0MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 66 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 70 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 46 PreInvPairs, 70 NumberOfFragments, 139 HoareAnnotationTreeSize, 46 FomulaSimplifications, 89 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 233 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: i + z + y <= j + x && j + x <= i + z + y - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:39:54,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...