/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:24:59,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:59,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:59,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:59,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:59,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:59,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:59,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:59,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:59,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:59,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:59,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:59,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:59,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:59,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:59,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:59,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:59,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:59,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:59,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:59,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:59,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:59,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:59,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:59,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:59,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:59,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:59,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:59,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:59,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:59,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:59,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:59,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:59,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:59,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:59,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:59,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:59,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:59,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:59,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:59,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:59,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:24:59,128 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:59,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:59,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:59,130 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:59,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:59,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:59,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:59,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:59,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:59,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:59,131 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:59,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:59,132 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:59,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:59,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:59,132 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:59,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:59,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:59,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:59,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:59,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:59,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:59,134 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:59,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:59,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:59,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:59,427 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:59,427 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:59,428 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1.i [2020-07-10 20:24:59,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84e16947/114fb1edcaaf4537a8527ff40105eeb3/FLAGfaa868604 [2020-07-10 20:24:59,944 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:59,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1.i [2020-07-10 20:24:59,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84e16947/114fb1edcaaf4537a8527ff40105eeb3/FLAGfaa868604 [2020-07-10 20:25:00,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84e16947/114fb1edcaaf4537a8527ff40105eeb3 [2020-07-10 20:25:00,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:25:00,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:25:00,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:25:00,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:25:00,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:25:00,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d7ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00, skipping insertion in model container [2020-07-10 20:25:00,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:25:00,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:25:00,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:25:00,518 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:25:00,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:25:00,549 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:25:00,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00 WrapperNode [2020-07-10 20:25:00,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:25:00,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:25:00,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:25:00,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:25:00,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:25:00,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:25:00,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:25:00,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:25:00,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:25:00,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:25:00,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:25:00,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:25:00,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:25:00,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:25:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:25:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:25:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:25:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:25:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:25:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:25:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:25:00,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:25:00,927 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:25:00,927 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:25:00,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:00 BoogieIcfgContainer [2020-07-10 20:25:00,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:25:00,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:25:00,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:25:00,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:25:00,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:25:00" (1/3) ... [2020-07-10 20:25:00,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70557175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:00, skipping insertion in model container [2020-07-10 20:25:00,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (2/3) ... [2020-07-10 20:25:00,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70557175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:00, skipping insertion in model container [2020-07-10 20:25:00,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:00" (3/3) ... [2020-07-10 20:25:00,941 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_1.i [2020-07-10 20:25:00,953 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:25:00,962 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:25:00,986 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:25:01,039 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:25:01,040 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:25:01,040 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:25:01,040 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:25:01,040 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:25:01,040 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:25:01,040 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:25:01,041 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:25:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-10 20:25:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 20:25:01,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:01,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:01,080 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:01,084 INFO L82 PathProgramCache]: Analyzing trace with hash 574813456, now seen corresponding path program 1 times [2020-07-10 20:25:01,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:01,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1485867230] [2020-07-10 20:25:01,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:01,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 20:25:01,294 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25#true} {25#true} #45#return; {25#true} is VALID [2020-07-10 20:25:01,297 INFO L263 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2020-07-10 20:25:01,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 20:25:01,298 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #45#return; {25#true} is VALID [2020-07-10 20:25:01,299 INFO L263 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret1 := main(); {25#true} is VALID [2020-07-10 20:25:01,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~i~0; {25#true} is VALID [2020-07-10 20:25:01,301 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#true} ~i~0 := 0; {29#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:01,306 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#(<= main_~i~0 0)} assume !(~i~0 < 1000000); {26#false} is VALID [2020-07-10 20:25:01,306 INFO L263 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {26#false} is VALID [2020-07-10 20:25:01,307 INFO L280 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2020-07-10 20:25:01,307 INFO L280 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2020-07-10 20:25:01,307 INFO L280 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-10 20:25:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:01,310 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:01,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1485867230] [2020-07-10 20:25:01,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:01,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:25:01,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077056642] [2020-07-10 20:25:01,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-10 20:25:01,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:01,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:25:01,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:01,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:25:01,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:01,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:25:01,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:25:01,364 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-07-10 20:25:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:01,493 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-10 20:25:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:25:01,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-10 20:25:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:25:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-10 20:25:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:25:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-10 20:25:01,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2020-07-10 20:25:01,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:01,618 INFO L225 Difference]: With dead ends: 37 [2020-07-10 20:25:01,619 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 20:25:01,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:25:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 20:25:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-07-10 20:25:01,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:01,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 16 states. [2020-07-10 20:25:01,672 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 16 states. [2020-07-10 20:25:01,672 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 16 states. [2020-07-10 20:25:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:01,676 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 20:25:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 20:25:01,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:01,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:01,677 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 18 states. [2020-07-10 20:25:01,678 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 18 states. [2020-07-10 20:25:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:01,681 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 20:25:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 20:25:01,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:01,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:01,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:01,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 20:25:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-10 20:25:01,688 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2020-07-10 20:25:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:01,688 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-10 20:25:01,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:25:01,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2020-07-10 20:25:01,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 20:25:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 20:25:01,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:01,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:01,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:25:01,713 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:01,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1625616653, now seen corresponding path program 1 times [2020-07-10 20:25:01,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:01,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1380020985] [2020-07-10 20:25:01,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:04,088 INFO L280 TraceCheckUtils]: 0: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-10 20:25:04,089 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {174#true} {174#true} #45#return; {174#true} is VALID [2020-07-10 20:25:04,089 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2020-07-10 20:25:04,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-10 20:25:04,090 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {174#true} {174#true} #45#return; {174#true} is VALID [2020-07-10 20:25:04,091 INFO L263 TraceCheckUtils]: 3: Hoare triple {174#true} call #t~ret1 := main(); {174#true} is VALID [2020-07-10 20:25:04,091 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} havoc ~i~0; {174#true} is VALID [2020-07-10 20:25:04,092 INFO L280 TraceCheckUtils]: 5: Hoare triple {174#true} ~i~0 := 0; {178#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:04,094 INFO L280 TraceCheckUtils]: 6: Hoare triple {178#(<= main_~i~0 0)} [51] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_1 2))) (or (and (<= v_oct_main_~i~0_in_1 999999) (<= .cse0 v_oct_main_~i~0_out_1) (<= v_oct_main_~i~0_in_1 999998) (<= v_oct_main_~i~0_out_1 1000000) (<= v_oct_main_~i~0_out_1 1000001)) (let ((.cse1 (+ v_oct_main_~i~0_in_1 1))) (and (<= (* 2 v_oct_main_~i~0_in_1) 1999998) (<= .cse1 v_oct_main_~i~0_out_1) (<= v_oct_main_~i~0_out_1 .cse1) (or (< 1000001 v_oct_main_~i~0_out_1) (< 999998 v_oct_main_~i~0_in_1) (< 999999 v_oct_main_~i~0_in_1) (< 1000000 v_oct_main_~i~0_out_1) (< v_oct_main_~i~0_out_1 .cse0)))))) InVars {main_~i~0=v_oct_main_~i~0_in_1} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_1|, main_~i~0=v_oct_main_~i~0_out_1} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {179#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:04,095 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= main_~i~0 1000000)} [50] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {180#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:04,097 INFO L263 TraceCheckUtils]: 8: Hoare triple {180#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {181#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:04,098 INFO L280 TraceCheckUtils]: 9: Hoare triple {181#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {182#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:04,098 INFO L280 TraceCheckUtils]: 10: Hoare triple {182#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {175#false} is VALID [2020-07-10 20:25:04,099 INFO L280 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-10 20:25:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:04,189 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:04,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1380020985] [2020-07-10 20:25:04,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:04,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:25:04,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411842513] [2020-07-10 20:25:04,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-10 20:25:04,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:04,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:25:04,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:04,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:25:04,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:04,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:25:04,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:25:04,220 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2020-07-10 20:25:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:04,396 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 20:25:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:25:04,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-10 20:25:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:25:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-10 20:25:04,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:25:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-10 20:25:04,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2020-07-10 20:25:04,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:04,447 INFO L225 Difference]: With dead ends: 27 [2020-07-10 20:25:04,448 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 20:25:04,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:25:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 20:25:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-10 20:25:04,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:04,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2020-07-10 20:25:04,473 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2020-07-10 20:25:04,473 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2020-07-10 20:25:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:04,476 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-10 20:25:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-10 20:25:04,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:04,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:04,477 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2020-07-10 20:25:04,477 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2020-07-10 20:25:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:04,481 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-10 20:25:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-10 20:25:04,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:04,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:04,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:04,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 20:25:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-10 20:25:04,486 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2020-07-10 20:25:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:04,486 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-10 20:25:04,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:25:04,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2020-07-10 20:25:04,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 20:25:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 20:25:04,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:04,511 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:04,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:25:04,511 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1174316682, now seen corresponding path program 2 times [2020-07-10 20:25:04,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:04,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1508422088] [2020-07-10 20:25:04,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:06,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-10 20:25:06,807 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {326#true} {326#true} #45#return; {326#true} is VALID [2020-07-10 20:25:06,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2020-07-10 20:25:06,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-10 20:25:06,808 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {326#true} {326#true} #45#return; {326#true} is VALID [2020-07-10 20:25:06,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {326#true} call #t~ret1 := main(); {326#true} is VALID [2020-07-10 20:25:06,808 INFO L280 TraceCheckUtils]: 4: Hoare triple {326#true} havoc ~i~0; {326#true} is VALID [2020-07-10 20:25:06,809 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#true} ~i~0 := 0; {330#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:06,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {330#(<= main_~i~0 0)} [53] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_2 2))) (or (and (<= v_oct_main_~i~0_in_2 999999) (<= .cse0 v_oct_main_~i~0_out_2) (<= v_oct_main_~i~0_in_2 999998) (<= v_oct_main_~i~0_out_2 1000001) (<= v_oct_main_~i~0_out_2 1000000)) (let ((.cse1 (+ v_oct_main_~i~0_in_2 1))) (and (or (< v_oct_main_~i~0_out_2 .cse0) (< 1000000 v_oct_main_~i~0_out_2) (< 999999 v_oct_main_~i~0_in_2) (< 1000001 v_oct_main_~i~0_out_2) (< 999998 v_oct_main_~i~0_in_2)) (<= .cse1 v_oct_main_~i~0_out_2) (<= (* 2 v_oct_main_~i~0_in_2) 1999998) (<= v_oct_main_~i~0_out_2 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_2} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_2|, main_~i~0=v_oct_main_~i~0_out_2} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {331#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:06,811 INFO L280 TraceCheckUtils]: 7: Hoare triple {331#(<= main_~i~0 1000000)} [52] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {332#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:06,812 INFO L263 TraceCheckUtils]: 8: Hoare triple {332#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {333#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:06,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {333#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {334#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:06,814 INFO L280 TraceCheckUtils]: 10: Hoare triple {334#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {327#false} is VALID [2020-07-10 20:25:06,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-10 20:25:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:06,937 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:06,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1508422088] [2020-07-10 20:25:06,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:06,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 20:25:06,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506959094] [2020-07-10 20:25:06,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-07-10 20:25:06,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:06,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 20:25:06,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:06,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 20:25:06,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 20:25:06,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:25:06,963 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2020-07-10 20:25:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,204 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-10 20:25:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:25:07,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-07-10 20:25:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:25:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-10 20:25:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:25:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-10 20:25:07,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2020-07-10 20:25:07,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:07,249 INFO L225 Difference]: With dead ends: 31 [2020-07-10 20:25:07,249 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 20:25:07,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:25:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 20:25:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-10 20:25:07,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:07,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-10 20:25:07,273 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-10 20:25:07,273 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-10 20:25:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,275 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 20:25:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-10 20:25:07,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:07,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:07,276 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-10 20:25:07,277 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-10 20:25:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,279 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 20:25:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-10 20:25:07,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:07,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:07,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:07,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 20:25:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2020-07-10 20:25:07,282 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2020-07-10 20:25:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:07,282 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2020-07-10 20:25:07,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 20:25:07,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2020-07-10 20:25:07,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-10 20:25:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 20:25:07,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:07,309 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:07,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:25:07,310 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash -199797369, now seen corresponding path program 3 times [2020-07-10 20:25:07,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:07,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [861563734] [2020-07-10 20:25:07,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:09,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-10 20:25:09,510 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {505#true} {505#true} #45#return; {505#true} is VALID [2020-07-10 20:25:09,510 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2020-07-10 20:25:09,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-10 20:25:09,511 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {505#true} {505#true} #45#return; {505#true} is VALID [2020-07-10 20:25:09,511 INFO L263 TraceCheckUtils]: 3: Hoare triple {505#true} call #t~ret1 := main(); {505#true} is VALID [2020-07-10 20:25:09,512 INFO L280 TraceCheckUtils]: 4: Hoare triple {505#true} havoc ~i~0; {505#true} is VALID [2020-07-10 20:25:09,512 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} ~i~0 := 0; {509#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:09,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {509#(<= main_~i~0 0)} [55] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_3 2))) (or (and (<= .cse0 v_oct_main_~i~0_out_3) (<= v_oct_main_~i~0_out_3 1000000) (<= v_oct_main_~i~0_in_3 999999) (<= v_oct_main_~i~0_out_3 1000001) (<= v_oct_main_~i~0_in_3 999998)) (let ((.cse1 (+ v_oct_main_~i~0_in_3 1))) (and (<= (* 2 v_oct_main_~i~0_in_3) 1999998) (or (< v_oct_main_~i~0_out_3 .cse0) (< 999998 v_oct_main_~i~0_in_3) (< 999999 v_oct_main_~i~0_in_3) (< 1000000 v_oct_main_~i~0_out_3) (< 1000001 v_oct_main_~i~0_out_3)) (<= .cse1 v_oct_main_~i~0_out_3) (<= v_oct_main_~i~0_out_3 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_3} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_3|, main_~i~0=v_oct_main_~i~0_out_3} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {510#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:09,515 INFO L280 TraceCheckUtils]: 7: Hoare triple {510#(<= main_~i~0 1000000)} [54] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {511#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:09,516 INFO L263 TraceCheckUtils]: 8: Hoare triple {511#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {512#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:09,522 INFO L280 TraceCheckUtils]: 9: Hoare triple {512#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {513#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:09,524 INFO L280 TraceCheckUtils]: 10: Hoare triple {513#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {506#false} is VALID [2020-07-10 20:25:09,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-10 20:25:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:09,730 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:09,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [861563734] [2020-07-10 20:25:09,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:09,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 20:25:09,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089399938] [2020-07-10 20:25:09,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-07-10 20:25:09,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:09,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 20:25:09,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:09,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 20:25:09,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:09,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 20:25:09,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-07-10 20:25:09,757 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 15 states. [2020-07-10 20:25:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:10,024 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 20:25:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:25:10,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-07-10 20:25:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:25:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2020-07-10 20:25:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:25:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2020-07-10 20:25:10,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 35 transitions. [2020-07-10 20:25:10,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:10,067 INFO L225 Difference]: With dead ends: 35 [2020-07-10 20:25:10,068 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 20:25:10,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-07-10 20:25:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 20:25:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-10 20:25:10,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:10,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-10 20:25:10,092 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-10 20:25:10,092 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-10 20:25:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:10,095 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-07-10 20:25:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2020-07-10 20:25:10,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:10,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:10,096 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-10 20:25:10,097 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-10 20:25:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:10,099 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-07-10 20:25:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2020-07-10 20:25:10,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:10,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:10,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:10,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 20:25:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-10 20:25:10,101 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 23 [2020-07-10 20:25:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:10,102 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-10 20:25:10,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 20:25:10,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-10 20:25:10,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 20:25:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 20:25:10,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:10,151 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:10,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:25:10,152 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:10,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2014723588, now seen corresponding path program 4 times [2020-07-10 20:25:10,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:10,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1622851051] [2020-07-10 20:25:10,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:12,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 20:25:12,349 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {711#true} {711#true} #45#return; {711#true} is VALID [2020-07-10 20:25:12,349 INFO L263 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {711#true} is VALID [2020-07-10 20:25:12,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 20:25:12,350 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {711#true} {711#true} #45#return; {711#true} is VALID [2020-07-10 20:25:12,350 INFO L263 TraceCheckUtils]: 3: Hoare triple {711#true} call #t~ret1 := main(); {711#true} is VALID [2020-07-10 20:25:12,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {711#true} havoc ~i~0; {711#true} is VALID [2020-07-10 20:25:12,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {711#true} ~i~0 := 0; {715#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:12,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {715#(<= main_~i~0 0)} [57] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_4 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_4 1))) (and (or (< 999998 v_oct_main_~i~0_in_4) (< v_oct_main_~i~0_out_4 .cse0) (< 1000000 v_oct_main_~i~0_out_4) (< 1000001 v_oct_main_~i~0_out_4) (< 999999 v_oct_main_~i~0_in_4)) (<= v_oct_main_~i~0_out_4 .cse1) (<= .cse1 v_oct_main_~i~0_out_4) (<= (* 2 v_oct_main_~i~0_in_4) 1999998))) (and (<= .cse0 v_oct_main_~i~0_out_4) (<= v_oct_main_~i~0_in_4 999999) (<= v_oct_main_~i~0_in_4 999998) (<= v_oct_main_~i~0_out_4 1000001) (<= v_oct_main_~i~0_out_4 1000000)))) InVars {main_~i~0=v_oct_main_~i~0_in_4} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_4|, main_~i~0=v_oct_main_~i~0_out_4} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {716#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:12,356 INFO L280 TraceCheckUtils]: 7: Hoare triple {716#(<= main_~i~0 1000000)} [56] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {717#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:12,357 INFO L263 TraceCheckUtils]: 8: Hoare triple {717#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {718#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:12,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {718#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {719#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:12,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {719#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {712#false} is VALID [2020-07-10 20:25:12,358 INFO L280 TraceCheckUtils]: 11: Hoare triple {712#false} assume !false; {712#false} is VALID [2020-07-10 20:25:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:12,622 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:12,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1622851051] [2020-07-10 20:25:12,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:12,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-10 20:25:12,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974631544] [2020-07-10 20:25:12,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-07-10 20:25:12,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:12,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 20:25:12,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:12,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 20:25:12,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 20:25:12,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-07-10 20:25:12,672 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 18 states. [2020-07-10 20:25:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:12,967 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-10 20:25:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:25:12,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-07-10 20:25:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 20:25:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2020-07-10 20:25:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 20:25:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2020-07-10 20:25:12,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 39 transitions. [2020-07-10 20:25:13,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:13,017 INFO L225 Difference]: With dead ends: 39 [2020-07-10 20:25:13,018 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 20:25:13,018 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-07-10 20:25:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 20:25:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-10 20:25:13,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:13,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-10 20:25:13,046 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-10 20:25:13,047 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-10 20:25:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:13,049 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 20:25:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 20:25:13,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:13,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:13,050 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-10 20:25:13,050 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-10 20:25:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:13,052 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 20:25:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 20:25:13,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:13,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:13,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:13,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 20:25:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-07-10 20:25:13,055 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 27 [2020-07-10 20:25:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:13,055 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-07-10 20:25:13,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 20:25:13,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2020-07-10 20:25:13,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-10 20:25:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:25:13,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:13,093 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:13,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:25:13,094 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:13,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1723686911, now seen corresponding path program 5 times [2020-07-10 20:25:13,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:13,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [794794701] [2020-07-10 20:25:13,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:15,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {944#true} assume true; {944#true} is VALID [2020-07-10 20:25:15,286 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {944#true} {944#true} #45#return; {944#true} is VALID [2020-07-10 20:25:15,287 INFO L263 TraceCheckUtils]: 0: Hoare triple {944#true} call ULTIMATE.init(); {944#true} is VALID [2020-07-10 20:25:15,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {944#true} assume true; {944#true} is VALID [2020-07-10 20:25:15,287 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {944#true} {944#true} #45#return; {944#true} is VALID [2020-07-10 20:25:15,288 INFO L263 TraceCheckUtils]: 3: Hoare triple {944#true} call #t~ret1 := main(); {944#true} is VALID [2020-07-10 20:25:15,288 INFO L280 TraceCheckUtils]: 4: Hoare triple {944#true} havoc ~i~0; {944#true} is VALID [2020-07-10 20:25:15,289 INFO L280 TraceCheckUtils]: 5: Hoare triple {944#true} ~i~0 := 0; {948#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:15,290 INFO L280 TraceCheckUtils]: 6: Hoare triple {948#(<= main_~i~0 0)} [59] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_5 2))) (or (and (<= v_oct_main_~i~0_out_5 1000001) (<= .cse0 v_oct_main_~i~0_out_5) (<= v_oct_main_~i~0_in_5 999999) (<= v_oct_main_~i~0_in_5 999998) (<= v_oct_main_~i~0_out_5 1000000)) (let ((.cse1 (+ v_oct_main_~i~0_in_5 1))) (and (<= (* 2 v_oct_main_~i~0_in_5) 1999998) (<= .cse1 v_oct_main_~i~0_out_5) (or (< 1000001 v_oct_main_~i~0_out_5) (< 1000000 v_oct_main_~i~0_out_5) (< v_oct_main_~i~0_out_5 .cse0) (< 999998 v_oct_main_~i~0_in_5) (< 999999 v_oct_main_~i~0_in_5)) (<= v_oct_main_~i~0_out_5 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_5} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_5|, main_~i~0=v_oct_main_~i~0_out_5} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {949#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:15,290 INFO L280 TraceCheckUtils]: 7: Hoare triple {949#(<= main_~i~0 1000000)} [58] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {950#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:15,291 INFO L263 TraceCheckUtils]: 8: Hoare triple {950#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {951#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:15,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {951#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {952#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:15,292 INFO L280 TraceCheckUtils]: 10: Hoare triple {952#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {945#false} is VALID [2020-07-10 20:25:15,292 INFO L280 TraceCheckUtils]: 11: Hoare triple {945#false} assume !false; {945#false} is VALID [2020-07-10 20:25:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:15,642 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:15,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [794794701] [2020-07-10 20:25:15,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:15,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-07-10 20:25:15,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970136999] [2020-07-10 20:25:15,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2020-07-10 20:25:15,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:15,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 20:25:15,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:15,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 20:25:15,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:15,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 20:25:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2020-07-10 20:25:15,687 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 21 states. [2020-07-10 20:25:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:15,972 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-10 20:25:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 20:25:15,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2020-07-10 20:25:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 20:25:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-10 20:25:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 20:25:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-10 20:25:15,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 43 transitions. [2020-07-10 20:25:16,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:16,032 INFO L225 Difference]: With dead ends: 43 [2020-07-10 20:25:16,034 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 20:25:16,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2020-07-10 20:25:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 20:25:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-10 20:25:16,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:16,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-10 20:25:16,075 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-10 20:25:16,075 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-10 20:25:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:16,087 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-10 20:25:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:25:16,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:16,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:16,088 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-10 20:25:16,088 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-10 20:25:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:16,090 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-10 20:25:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:25:16,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:16,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:16,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:16,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 20:25:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-07-10 20:25:16,093 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2020-07-10 20:25:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:16,094 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-07-10 20:25:16,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 20:25:16,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2020-07-10 20:25:16,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-10 20:25:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:25:16,131 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:16,132 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:16,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:25:16,132 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:16,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1455178882, now seen corresponding path program 6 times [2020-07-10 20:25:16,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:16,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [212493305] [2020-07-10 20:25:16,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:18,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {1204#true} assume true; {1204#true} is VALID [2020-07-10 20:25:18,282 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1204#true} {1204#true} #45#return; {1204#true} is VALID [2020-07-10 20:25:18,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {1204#true} call ULTIMATE.init(); {1204#true} is VALID [2020-07-10 20:25:18,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {1204#true} assume true; {1204#true} is VALID [2020-07-10 20:25:18,282 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1204#true} {1204#true} #45#return; {1204#true} is VALID [2020-07-10 20:25:18,283 INFO L263 TraceCheckUtils]: 3: Hoare triple {1204#true} call #t~ret1 := main(); {1204#true} is VALID [2020-07-10 20:25:18,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {1204#true} havoc ~i~0; {1204#true} is VALID [2020-07-10 20:25:18,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {1204#true} ~i~0 := 0; {1208#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:18,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {1208#(<= main_~i~0 0)} [61] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_6 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_6 1))) (and (or (< 999999 v_oct_main_~i~0_in_6) (< v_oct_main_~i~0_out_6 .cse0) (< 1000001 v_oct_main_~i~0_out_6) (< 999998 v_oct_main_~i~0_in_6) (< 1000000 v_oct_main_~i~0_out_6)) (<= v_oct_main_~i~0_out_6 .cse1) (<= .cse1 v_oct_main_~i~0_out_6) (<= (* 2 v_oct_main_~i~0_in_6) 1999998))) (and (<= v_oct_main_~i~0_in_6 999998) (<= .cse0 v_oct_main_~i~0_out_6) (<= v_oct_main_~i~0_out_6 1000001) (<= v_oct_main_~i~0_out_6 1000000) (<= v_oct_main_~i~0_in_6 999999)))) InVars {main_~i~0=v_oct_main_~i~0_in_6} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_6|, main_~i~0=v_oct_main_~i~0_out_6} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {1209#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:18,293 INFO L280 TraceCheckUtils]: 7: Hoare triple {1209#(<= main_~i~0 1000000)} [60] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1210#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:18,294 INFO L263 TraceCheckUtils]: 8: Hoare triple {1210#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {1211#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:18,294 INFO L280 TraceCheckUtils]: 9: Hoare triple {1211#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1212#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:18,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {1212#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1205#false} is VALID [2020-07-10 20:25:18,295 INFO L280 TraceCheckUtils]: 11: Hoare triple {1205#false} assume !false; {1205#false} is VALID [2020-07-10 20:25:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:18,748 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:18,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [212493305] [2020-07-10 20:25:18,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:18,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-07-10 20:25:18,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921917775] [2020-07-10 20:25:18,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2020-07-10 20:25:18,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:18,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-10 20:25:18,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:18,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-10 20:25:18,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:18,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-10 20:25:18,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2020-07-10 20:25:18,794 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 24 states. [2020-07-10 20:25:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:19,138 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-10 20:25:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-10 20:25:19,138 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2020-07-10 20:25:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 20:25:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 47 transitions. [2020-07-10 20:25:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 20:25:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 47 transitions. [2020-07-10 20:25:19,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 47 transitions. [2020-07-10 20:25:19,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:19,206 INFO L225 Difference]: With dead ends: 47 [2020-07-10 20:25:19,206 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 20:25:19,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2020-07-10 20:25:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 20:25:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-10 20:25:19,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:19,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-10 20:25:19,250 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-10 20:25:19,250 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-10 20:25:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:19,252 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-10 20:25:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-10 20:25:19,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:19,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:19,252 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-10 20:25:19,253 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-10 20:25:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:19,255 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-10 20:25:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-10 20:25:19,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:19,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:19,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:19,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 20:25:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2020-07-10 20:25:19,257 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 35 [2020-07-10 20:25:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:19,258 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2020-07-10 20:25:19,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-10 20:25:19,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2020-07-10 20:25:19,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2020-07-10 20:25:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:25:19,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:19,302 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:19,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:25:19,302 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:19,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:19,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1411436667, now seen corresponding path program 7 times [2020-07-10 20:25:19,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:19,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872499972] [2020-07-10 20:25:19,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:21,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {1491#true} assume true; {1491#true} is VALID [2020-07-10 20:25:21,445 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1491#true} {1491#true} #45#return; {1491#true} is VALID [2020-07-10 20:25:21,445 INFO L263 TraceCheckUtils]: 0: Hoare triple {1491#true} call ULTIMATE.init(); {1491#true} is VALID [2020-07-10 20:25:21,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {1491#true} assume true; {1491#true} is VALID [2020-07-10 20:25:21,446 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1491#true} {1491#true} #45#return; {1491#true} is VALID [2020-07-10 20:25:21,446 INFO L263 TraceCheckUtils]: 3: Hoare triple {1491#true} call #t~ret1 := main(); {1491#true} is VALID [2020-07-10 20:25:21,446 INFO L280 TraceCheckUtils]: 4: Hoare triple {1491#true} havoc ~i~0; {1491#true} is VALID [2020-07-10 20:25:21,451 INFO L280 TraceCheckUtils]: 5: Hoare triple {1491#true} ~i~0 := 0; {1495#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:21,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {1495#(<= main_~i~0 0)} [63] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_7 2))) (or (and (<= v_oct_main_~i~0_in_7 999999) (<= v_oct_main_~i~0_in_7 999998) (<= v_oct_main_~i~0_out_7 1000000) (<= v_oct_main_~i~0_out_7 1000001) (<= .cse0 v_oct_main_~i~0_out_7)) (let ((.cse1 (+ v_oct_main_~i~0_in_7 1))) (and (<= (* 2 v_oct_main_~i~0_in_7) 1999998) (<= v_oct_main_~i~0_out_7 .cse1) (<= .cse1 v_oct_main_~i~0_out_7) (or (< 999999 v_oct_main_~i~0_in_7) (< v_oct_main_~i~0_out_7 .cse0) (< 1000001 v_oct_main_~i~0_out_7) (< 1000000 v_oct_main_~i~0_out_7) (< 999998 v_oct_main_~i~0_in_7)))))) InVars {main_~i~0=v_oct_main_~i~0_in_7} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_7|, main_~i~0=v_oct_main_~i~0_out_7} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {1496#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:21,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {1496#(<= main_~i~0 1000000)} [62] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1497#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:21,453 INFO L263 TraceCheckUtils]: 8: Hoare triple {1497#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {1498#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:21,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {1498#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1499#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:21,454 INFO L280 TraceCheckUtils]: 10: Hoare triple {1499#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1492#false} is VALID [2020-07-10 20:25:21,455 INFO L280 TraceCheckUtils]: 11: Hoare triple {1492#false} assume !false; {1492#false} is VALID [2020-07-10 20:25:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:22,010 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:22,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872499972] [2020-07-10 20:25:22,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:22,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-07-10 20:25:22,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528203528] [2020-07-10 20:25:22,011 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2020-07-10 20:25:22,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:22,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2020-07-10 20:25:22,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:22,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-10 20:25:22,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:22,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-10 20:25:22,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2020-07-10 20:25:22,060 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 27 states. [2020-07-10 20:25:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:22,471 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-10 20:25:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-10 20:25:22,471 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2020-07-10 20:25:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 20:25:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2020-07-10 20:25:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 20:25:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2020-07-10 20:25:22,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 51 transitions. [2020-07-10 20:25:22,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:22,530 INFO L225 Difference]: With dead ends: 51 [2020-07-10 20:25:22,530 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 20:25:22,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2020-07-10 20:25:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 20:25:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-10 20:25:22,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:22,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-10 20:25:22,569 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-10 20:25:22,569 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-10 20:25:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:22,571 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-10 20:25:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-10 20:25:22,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:22,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:22,571 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-10 20:25:22,572 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-10 20:25:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:22,573 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-10 20:25:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-10 20:25:22,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:22,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:22,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:22,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 20:25:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2020-07-10 20:25:22,577 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 39 [2020-07-10 20:25:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:22,577 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2020-07-10 20:25:22,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-10 20:25:22,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2020-07-10 20:25:22,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-10 20:25:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 20:25:22,625 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:22,626 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:22,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:25:22,626 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1883315960, now seen corresponding path program 8 times [2020-07-10 20:25:22,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:22,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [534997809] [2020-07-10 20:25:22,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 13 to 23 [2020-07-10 20:25:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:24,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {1805#true} assume true; {1805#true} is VALID [2020-07-10 20:25:24,787 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1805#true} {1805#true} #45#return; {1805#true} is VALID [2020-07-10 20:25:24,787 INFO L263 TraceCheckUtils]: 0: Hoare triple {1805#true} call ULTIMATE.init(); {1805#true} is VALID [2020-07-10 20:25:24,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {1805#true} assume true; {1805#true} is VALID [2020-07-10 20:25:24,788 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1805#true} {1805#true} #45#return; {1805#true} is VALID [2020-07-10 20:25:24,788 INFO L263 TraceCheckUtils]: 3: Hoare triple {1805#true} call #t~ret1 := main(); {1805#true} is VALID [2020-07-10 20:25:24,788 INFO L280 TraceCheckUtils]: 4: Hoare triple {1805#true} havoc ~i~0; {1805#true} is VALID [2020-07-10 20:25:24,789 INFO L280 TraceCheckUtils]: 5: Hoare triple {1805#true} ~i~0 := 0; {1809#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:24,790 INFO L280 TraceCheckUtils]: 6: Hoare triple {1809#(<= main_~i~0 0)} [65] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_8 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_8 1))) (and (<= v_oct_main_~i~0_out_8 .cse0) (or (< v_oct_main_~i~0_out_8 .cse1) (< 1000001 v_oct_main_~i~0_out_8) (< 999999 v_oct_main_~i~0_in_8) (< 1000000 v_oct_main_~i~0_out_8) (< 999998 v_oct_main_~i~0_in_8)) (<= (* 2 v_oct_main_~i~0_in_8) 1999998) (<= .cse0 v_oct_main_~i~0_out_8))) (and (<= .cse1 v_oct_main_~i~0_out_8) (<= v_oct_main_~i~0_in_8 999998) (<= v_oct_main_~i~0_out_8 1000000) (<= v_oct_main_~i~0_in_8 999999) (<= v_oct_main_~i~0_out_8 1000001)))) InVars {main_~i~0=v_oct_main_~i~0_in_8} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_8|, main_~i~0=v_oct_main_~i~0_out_8} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {1810#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:24,791 INFO L280 TraceCheckUtils]: 7: Hoare triple {1810#(<= main_~i~0 1000000)} [64] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1811#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:24,794 INFO L263 TraceCheckUtils]: 8: Hoare triple {1811#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {1812#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:24,798 INFO L280 TraceCheckUtils]: 9: Hoare triple {1812#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1813#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:24,799 INFO L280 TraceCheckUtils]: 10: Hoare triple {1813#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1806#false} is VALID [2020-07-10 20:25:24,799 INFO L280 TraceCheckUtils]: 11: Hoare triple {1806#false} assume !false; {1806#false} is VALID [2020-07-10 20:25:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:25,463 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:25,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [534997809] [2020-07-10 20:25:25,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:25,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-07-10 20:25:25,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267176229] [2020-07-10 20:25:25,465 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2020-07-10 20:25:25,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:25,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2020-07-10 20:25:25,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:25,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-10 20:25:25,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:25,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-10 20:25:25,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2020-07-10 20:25:25,507 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 30 states. [2020-07-10 20:25:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:25,960 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-10 20:25:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-10 20:25:25,960 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2020-07-10 20:25:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 20:25:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. [2020-07-10 20:25:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 20:25:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. [2020-07-10 20:25:25,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 55 transitions. [2020-07-10 20:25:26,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:26,022 INFO L225 Difference]: With dead ends: 55 [2020-07-10 20:25:26,023 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 20:25:26,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2020-07-10 20:25:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 20:25:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-10 20:25:26,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:26,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2020-07-10 20:25:26,067 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2020-07-10 20:25:26,067 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2020-07-10 20:25:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:26,071 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-10 20:25:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2020-07-10 20:25:26,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:26,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:26,072 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2020-07-10 20:25:26,072 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2020-07-10 20:25:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:26,074 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-10 20:25:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2020-07-10 20:25:26,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:26,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:26,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:26,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 20:25:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-07-10 20:25:26,077 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 43 [2020-07-10 20:25:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:26,077 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-07-10 20:25:26,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-10 20:25:26,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2020-07-10 20:25:26,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-10 20:25:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-10 20:25:26,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:26,133 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:26,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:25:26,134 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:26,134 INFO L82 PathProgramCache]: Analyzing trace with hash -831789323, now seen corresponding path program 9 times [2020-07-10 20:25:26,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:26,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1750224154] [2020-07-10 20:25:26,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:28,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {2146#true} assume true; {2146#true} is VALID [2020-07-10 20:25:28,295 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2146#true} {2146#true} #45#return; {2146#true} is VALID [2020-07-10 20:25:28,296 INFO L263 TraceCheckUtils]: 0: Hoare triple {2146#true} call ULTIMATE.init(); {2146#true} is VALID [2020-07-10 20:25:28,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {2146#true} assume true; {2146#true} is VALID [2020-07-10 20:25:28,296 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2146#true} {2146#true} #45#return; {2146#true} is VALID [2020-07-10 20:25:28,297 INFO L263 TraceCheckUtils]: 3: Hoare triple {2146#true} call #t~ret1 := main(); {2146#true} is VALID [2020-07-10 20:25:28,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {2146#true} havoc ~i~0; {2146#true} is VALID [2020-07-10 20:25:28,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {2146#true} ~i~0 := 0; {2150#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:28,299 INFO L280 TraceCheckUtils]: 6: Hoare triple {2150#(<= main_~i~0 0)} [67] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_9 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_9 1))) (and (or (< 999999 v_oct_main_~i~0_in_9) (< 1000000 v_oct_main_~i~0_out_9) (< v_oct_main_~i~0_out_9 .cse0) (< 1000001 v_oct_main_~i~0_out_9) (< 999998 v_oct_main_~i~0_in_9)) (<= v_oct_main_~i~0_out_9 .cse1) (<= .cse1 v_oct_main_~i~0_out_9) (<= (* 2 v_oct_main_~i~0_in_9) 1999998))) (and (<= v_oct_main_~i~0_in_9 999999) (<= v_oct_main_~i~0_out_9 1000000) (<= v_oct_main_~i~0_out_9 1000001) (<= .cse0 v_oct_main_~i~0_out_9) (<= v_oct_main_~i~0_in_9 999998)))) InVars {main_~i~0=v_oct_main_~i~0_in_9} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_9|, main_~i~0=v_oct_main_~i~0_out_9} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {2151#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:28,300 INFO L280 TraceCheckUtils]: 7: Hoare triple {2151#(<= main_~i~0 1000000)} [66] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {2152#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:28,301 INFO L263 TraceCheckUtils]: 8: Hoare triple {2152#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {2153#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:28,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {2153#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2154#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:28,302 INFO L280 TraceCheckUtils]: 10: Hoare triple {2154#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2147#false} is VALID [2020-07-10 20:25:28,302 INFO L280 TraceCheckUtils]: 11: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2020-07-10 20:25:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:29,099 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:29,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1750224154] [2020-07-10 20:25:29,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:29,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2020-07-10 20:25:29,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455532651] [2020-07-10 20:25:29,100 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2020-07-10 20:25:29,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:29,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2020-07-10 20:25:29,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:29,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-10 20:25:29,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:29,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-10 20:25:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2020-07-10 20:25:29,150 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2020-07-10 20:25:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:29,467 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-10 20:25:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-10 20:25:29,468 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2020-07-10 20:25:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 20:25:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2020-07-10 20:25:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 20:25:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2020-07-10 20:25:29,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 59 transitions. [2020-07-10 20:25:29,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:29,555 INFO L225 Difference]: With dead ends: 59 [2020-07-10 20:25:29,555 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 20:25:29,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2020-07-10 20:25:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 20:25:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-07-10 20:25:29,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:29,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2020-07-10 20:25:29,601 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2020-07-10 20:25:29,601 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2020-07-10 20:25:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:29,603 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-10 20:25:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-07-10 20:25:29,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:29,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:29,604 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2020-07-10 20:25:29,605 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2020-07-10 20:25:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:29,606 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-10 20:25:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-07-10 20:25:29,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:29,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:29,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:29,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 20:25:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2020-07-10 20:25:29,609 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 47 [2020-07-10 20:25:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:29,609 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2020-07-10 20:25:29,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-10 20:25:29,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2020-07-10 20:25:29,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2020-07-10 20:25:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 20:25:29,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:29,663 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:29,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:25:29,663 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash 164128882, now seen corresponding path program 10 times [2020-07-10 20:25:29,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:29,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113940860] [2020-07-10 20:25:29,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:31,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {2514#true} assume true; {2514#true} is VALID [2020-07-10 20:25:31,813 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2514#true} {2514#true} #45#return; {2514#true} is VALID [2020-07-10 20:25:31,813 INFO L263 TraceCheckUtils]: 0: Hoare triple {2514#true} call ULTIMATE.init(); {2514#true} is VALID [2020-07-10 20:25:31,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {2514#true} assume true; {2514#true} is VALID [2020-07-10 20:25:31,814 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2514#true} {2514#true} #45#return; {2514#true} is VALID [2020-07-10 20:25:31,814 INFO L263 TraceCheckUtils]: 3: Hoare triple {2514#true} call #t~ret1 := main(); {2514#true} is VALID [2020-07-10 20:25:31,814 INFO L280 TraceCheckUtils]: 4: Hoare triple {2514#true} havoc ~i~0; {2514#true} is VALID [2020-07-10 20:25:31,815 INFO L280 TraceCheckUtils]: 5: Hoare triple {2514#true} ~i~0 := 0; {2518#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:31,816 INFO L280 TraceCheckUtils]: 6: Hoare triple {2518#(<= main_~i~0 0)} [69] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_10 2))) (or (and (<= v_oct_main_~i~0_in_10 999999) (<= v_oct_main_~i~0_out_10 1000001) (<= v_oct_main_~i~0_out_10 1000000) (<= .cse0 v_oct_main_~i~0_out_10) (<= v_oct_main_~i~0_in_10 999998)) (let ((.cse1 (+ v_oct_main_~i~0_in_10 1))) (and (<= .cse1 v_oct_main_~i~0_out_10) (<= (* 2 v_oct_main_~i~0_in_10) 1999998) (or (< 999998 v_oct_main_~i~0_in_10) (< 1000001 v_oct_main_~i~0_out_10) (< 1000000 v_oct_main_~i~0_out_10) (< v_oct_main_~i~0_out_10 .cse0) (< 999999 v_oct_main_~i~0_in_10)) (<= v_oct_main_~i~0_out_10 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_10} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_10|, main_~i~0=v_oct_main_~i~0_out_10} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {2519#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:31,817 INFO L280 TraceCheckUtils]: 7: Hoare triple {2519#(<= main_~i~0 1000000)} [68] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {2520#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:31,817 INFO L263 TraceCheckUtils]: 8: Hoare triple {2520#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {2521#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:31,818 INFO L280 TraceCheckUtils]: 9: Hoare triple {2521#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2522#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:31,818 INFO L280 TraceCheckUtils]: 10: Hoare triple {2522#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2515#false} is VALID [2020-07-10 20:25:31,819 INFO L280 TraceCheckUtils]: 11: Hoare triple {2515#false} assume !false; {2515#false} is VALID [2020-07-10 20:25:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:32,742 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:32,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113940860] [2020-07-10 20:25:32,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:32,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2020-07-10 20:25:32,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642022824] [2020-07-10 20:25:32,744 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2020-07-10 20:25:32,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:32,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2020-07-10 20:25:32,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:32,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-07-10 20:25:32,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:32,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-07-10 20:25:32,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=964, Unknown=0, NotChecked=0, Total=1332 [2020-07-10 20:25:32,803 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2020-07-10 20:25:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:33,334 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2020-07-10 20:25:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-10 20:25:33,334 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2020-07-10 20:25:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 20:25:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2020-07-10 20:25:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 20:25:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2020-07-10 20:25:33,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 63 transitions. [2020-07-10 20:25:33,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:33,410 INFO L225 Difference]: With dead ends: 63 [2020-07-10 20:25:33,411 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 20:25:33,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=368, Invalid=964, Unknown=0, NotChecked=0, Total=1332 [2020-07-10 20:25:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 20:25:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-07-10 20:25:33,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:33,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2020-07-10 20:25:33,468 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2020-07-10 20:25:33,469 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2020-07-10 20:25:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:33,470 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-10 20:25:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2020-07-10 20:25:33,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:33,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:33,471 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2020-07-10 20:25:33,471 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2020-07-10 20:25:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:33,472 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-10 20:25:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2020-07-10 20:25:33,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:33,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:33,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:33,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 20:25:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2020-07-10 20:25:33,474 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 51 [2020-07-10 20:25:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:33,474 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2020-07-10 20:25:33,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-07-10 20:25:33,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2020-07-10 20:25:33,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-07-10 20:25:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 20:25:33,536 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:33,536 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:33,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 20:25:33,537 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:33,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1474159471, now seen corresponding path program 11 times [2020-07-10 20:25:33,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:33,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [596974496] [2020-07-10 20:25:33,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:35,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {2909#true} assume true; {2909#true} is VALID [2020-07-10 20:25:35,699 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2909#true} {2909#true} #45#return; {2909#true} is VALID [2020-07-10 20:25:35,699 INFO L263 TraceCheckUtils]: 0: Hoare triple {2909#true} call ULTIMATE.init(); {2909#true} is VALID [2020-07-10 20:25:35,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {2909#true} assume true; {2909#true} is VALID [2020-07-10 20:25:35,700 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2909#true} {2909#true} #45#return; {2909#true} is VALID [2020-07-10 20:25:35,700 INFO L263 TraceCheckUtils]: 3: Hoare triple {2909#true} call #t~ret1 := main(); {2909#true} is VALID [2020-07-10 20:25:35,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {2909#true} havoc ~i~0; {2909#true} is VALID [2020-07-10 20:25:35,701 INFO L280 TraceCheckUtils]: 5: Hoare triple {2909#true} ~i~0 := 0; {2913#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:35,701 INFO L280 TraceCheckUtils]: 6: Hoare triple {2913#(<= main_~i~0 0)} [71] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_11 2))) (or (and (<= v_oct_main_~i~0_in_11 999999) (<= .cse0 v_oct_main_~i~0_out_11) (<= v_oct_main_~i~0_out_11 1000000) (<= v_oct_main_~i~0_out_11 1000001) (<= v_oct_main_~i~0_in_11 999998)) (let ((.cse1 (+ v_oct_main_~i~0_in_11 1))) (and (<= .cse1 v_oct_main_~i~0_out_11) (or (< 999999 v_oct_main_~i~0_in_11) (< v_oct_main_~i~0_out_11 .cse0) (< 999998 v_oct_main_~i~0_in_11) (< 1000000 v_oct_main_~i~0_out_11) (< 1000001 v_oct_main_~i~0_out_11)) (<= (* 2 v_oct_main_~i~0_in_11) 1999998) (<= v_oct_main_~i~0_out_11 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_11} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_11|, main_~i~0=v_oct_main_~i~0_out_11} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {2914#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:35,702 INFO L280 TraceCheckUtils]: 7: Hoare triple {2914#(<= main_~i~0 1000000)} [70] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {2915#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:35,703 INFO L263 TraceCheckUtils]: 8: Hoare triple {2915#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {2916#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:35,703 INFO L280 TraceCheckUtils]: 9: Hoare triple {2916#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2917#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:35,704 INFO L280 TraceCheckUtils]: 10: Hoare triple {2917#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2910#false} is VALID [2020-07-10 20:25:35,704 INFO L280 TraceCheckUtils]: 11: Hoare triple {2910#false} assume !false; {2910#false} is VALID [2020-07-10 20:25:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:36,758 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:36,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [596974496] [2020-07-10 20:25:36,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:36,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2020-07-10 20:25:36,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75346149] [2020-07-10 20:25:36,760 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 55 [2020-07-10 20:25:36,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:36,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2020-07-10 20:25:36,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:36,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-07-10 20:25:36,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:36,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-07-10 20:25:36,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=1129, Unknown=0, NotChecked=0, Total=1560 [2020-07-10 20:25:36,829 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 39 states. [2020-07-10 20:25:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:37,158 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2020-07-10 20:25:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-10 20:25:37,158 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 55 [2020-07-10 20:25:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 20:25:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 67 transitions. [2020-07-10 20:25:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 20:25:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 67 transitions. [2020-07-10 20:25:37,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 67 transitions. [2020-07-10 20:25:37,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:37,250 INFO L225 Difference]: With dead ends: 67 [2020-07-10 20:25:37,250 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 20:25:37,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=431, Invalid=1129, Unknown=0, NotChecked=0, Total=1560 [2020-07-10 20:25:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 20:25:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2020-07-10 20:25:37,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:37,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2020-07-10 20:25:37,304 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2020-07-10 20:25:37,304 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2020-07-10 20:25:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:37,306 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2020-07-10 20:25:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2020-07-10 20:25:37,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:37,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:37,307 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2020-07-10 20:25:37,307 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2020-07-10 20:25:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:37,308 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2020-07-10 20:25:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2020-07-10 20:25:37,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:37,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:37,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:37,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 20:25:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2020-07-10 20:25:37,310 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 55 [2020-07-10 20:25:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:37,311 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2020-07-10 20:25:37,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-07-10 20:25:37,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2020-07-10 20:25:37,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2020-07-10 20:25:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-10 20:25:37,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:37,381 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:37,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 20:25:37,382 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1486067692, now seen corresponding path program 12 times [2020-07-10 20:25:37,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:37,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1978424437] [2020-07-10 20:25:37,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:39,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {3331#true} assume true; {3331#true} is VALID [2020-07-10 20:25:39,515 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3331#true} {3331#true} #45#return; {3331#true} is VALID [2020-07-10 20:25:39,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {3331#true} call ULTIMATE.init(); {3331#true} is VALID [2020-07-10 20:25:39,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {3331#true} assume true; {3331#true} is VALID [2020-07-10 20:25:39,516 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3331#true} {3331#true} #45#return; {3331#true} is VALID [2020-07-10 20:25:39,516 INFO L263 TraceCheckUtils]: 3: Hoare triple {3331#true} call #t~ret1 := main(); {3331#true} is VALID [2020-07-10 20:25:39,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {3331#true} havoc ~i~0; {3331#true} is VALID [2020-07-10 20:25:39,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {3331#true} ~i~0 := 0; {3335#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:39,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {3335#(<= main_~i~0 0)} [73] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_12 2))) (or (and (<= v_oct_main_~i~0_in_12 999998) (<= v_oct_main_~i~0_in_12 999999) (<= v_oct_main_~i~0_out_12 1000001) (<= v_oct_main_~i~0_out_12 1000000) (<= .cse0 v_oct_main_~i~0_out_12)) (let ((.cse1 (+ v_oct_main_~i~0_in_12 1))) (and (<= v_oct_main_~i~0_out_12 .cse1) (<= (* 2 v_oct_main_~i~0_in_12) 1999998) (or (< 999999 v_oct_main_~i~0_in_12) (< 1000000 v_oct_main_~i~0_out_12) (< v_oct_main_~i~0_out_12 .cse0) (< 999998 v_oct_main_~i~0_in_12) (< 1000001 v_oct_main_~i~0_out_12)) (<= .cse1 v_oct_main_~i~0_out_12))))) InVars {main_~i~0=v_oct_main_~i~0_in_12} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_12|, main_~i~0=v_oct_main_~i~0_out_12} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {3336#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:39,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {3336#(<= main_~i~0 1000000)} [72] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {3337#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:39,519 INFO L263 TraceCheckUtils]: 8: Hoare triple {3337#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {3338#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:39,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {3338#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3339#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:39,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {3339#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3332#false} is VALID [2020-07-10 20:25:39,520 INFO L280 TraceCheckUtils]: 11: Hoare triple {3332#false} assume !false; {3332#false} is VALID [2020-07-10 20:25:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:40,748 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:40,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1978424437] [2020-07-10 20:25:40,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:40,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2020-07-10 20:25:40,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571017080] [2020-07-10 20:25:40,750 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 59 [2020-07-10 20:25:40,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:40,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2020-07-10 20:25:40,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:40,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-07-10 20:25:40,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:40,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-07-10 20:25:40,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1307, Unknown=0, NotChecked=0, Total=1806 [2020-07-10 20:25:40,819 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 42 states. [2020-07-10 20:25:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:41,420 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2020-07-10 20:25:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-10 20:25:41,421 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 59 [2020-07-10 20:25:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 20:25:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2020-07-10 20:25:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 20:25:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2020-07-10 20:25:41,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 71 transitions. [2020-07-10 20:25:41,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:41,506 INFO L225 Difference]: With dead ends: 71 [2020-07-10 20:25:41,506 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 20:25:41,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=499, Invalid=1307, Unknown=0, NotChecked=0, Total=1806 [2020-07-10 20:25:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 20:25:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-10 20:25:41,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:41,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-10 20:25:41,569 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-10 20:25:41,569 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-10 20:25:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:41,571 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2020-07-10 20:25:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2020-07-10 20:25:41,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:41,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:41,573 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-10 20:25:41,573 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-10 20:25:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:41,574 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2020-07-10 20:25:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2020-07-10 20:25:41,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:41,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:41,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:41,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 20:25:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2020-07-10 20:25:41,577 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 59 [2020-07-10 20:25:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:41,577 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2020-07-10 20:25:41,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-07-10 20:25:41,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2020-07-10 20:25:41,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2020-07-10 20:25:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-10 20:25:41,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:41,653 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:41,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 20:25:41,654 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:41,654 INFO L82 PathProgramCache]: Analyzing trace with hash -433011223, now seen corresponding path program 13 times [2020-07-10 20:25:41,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:41,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526951353] [2020-07-10 20:25:41,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:43,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {3780#true} assume true; {3780#true} is VALID [2020-07-10 20:25:43,805 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3780#true} {3780#true} #45#return; {3780#true} is VALID [2020-07-10 20:25:43,805 INFO L263 TraceCheckUtils]: 0: Hoare triple {3780#true} call ULTIMATE.init(); {3780#true} is VALID [2020-07-10 20:25:43,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {3780#true} assume true; {3780#true} is VALID [2020-07-10 20:25:43,805 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3780#true} {3780#true} #45#return; {3780#true} is VALID [2020-07-10 20:25:43,806 INFO L263 TraceCheckUtils]: 3: Hoare triple {3780#true} call #t~ret1 := main(); {3780#true} is VALID [2020-07-10 20:25:43,806 INFO L280 TraceCheckUtils]: 4: Hoare triple {3780#true} havoc ~i~0; {3780#true} is VALID [2020-07-10 20:25:43,806 INFO L280 TraceCheckUtils]: 5: Hoare triple {3780#true} ~i~0 := 0; {3784#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:43,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {3784#(<= main_~i~0 0)} [75] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_13 2))) (or (and (<= v_oct_main_~i~0_out_13 1000001) (<= v_oct_main_~i~0_in_13 999998) (<= v_oct_main_~i~0_out_13 1000000) (<= .cse0 v_oct_main_~i~0_out_13) (<= v_oct_main_~i~0_in_13 999999)) (let ((.cse1 (+ v_oct_main_~i~0_in_13 1))) (and (<= .cse1 v_oct_main_~i~0_out_13) (<= (* 2 v_oct_main_~i~0_in_13) 1999998) (or (< 999999 v_oct_main_~i~0_in_13) (< 1000001 v_oct_main_~i~0_out_13) (< 1000000 v_oct_main_~i~0_out_13) (< v_oct_main_~i~0_out_13 .cse0) (< 999998 v_oct_main_~i~0_in_13)) (<= v_oct_main_~i~0_out_13 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_13} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_13|, main_~i~0=v_oct_main_~i~0_out_13} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {3785#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:43,808 INFO L280 TraceCheckUtils]: 7: Hoare triple {3785#(<= main_~i~0 1000000)} [74] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {3786#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:43,809 INFO L263 TraceCheckUtils]: 8: Hoare triple {3786#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {3787#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:43,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {3787#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3788#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:43,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {3788#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3781#false} is VALID [2020-07-10 20:25:43,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {3781#false} assume !false; {3781#false} is VALID [2020-07-10 20:25:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:45,210 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:45,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526951353] [2020-07-10 20:25:45,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:45,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2020-07-10 20:25:45,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666063794] [2020-07-10 20:25:45,212 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 63 [2020-07-10 20:25:45,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:45,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2020-07-10 20:25:45,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:45,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-07-10 20:25:45,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:45,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-07-10 20:25:45,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2020-07-10 20:25:45,300 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 45 states. [2020-07-10 20:25:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:45,999 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2020-07-10 20:25:45,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-10 20:25:45,999 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 63 [2020-07-10 20:25:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 20:25:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 75 transitions. [2020-07-10 20:25:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 20:25:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 75 transitions. [2020-07-10 20:25:46,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 75 transitions. [2020-07-10 20:25:46,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:46,091 INFO L225 Difference]: With dead ends: 75 [2020-07-10 20:25:46,092 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 20:25:46,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2020-07-10 20:25:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 20:25:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2020-07-10 20:25:46,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:46,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 68 states. [2020-07-10 20:25:46,161 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 68 states. [2020-07-10 20:25:46,161 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 68 states. [2020-07-10 20:25:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:46,163 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2020-07-10 20:25:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-10 20:25:46,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:46,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:46,165 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 70 states. [2020-07-10 20:25:46,165 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 70 states. [2020-07-10 20:25:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:46,167 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2020-07-10 20:25:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-10 20:25:46,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:46,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:46,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:46,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-10 20:25:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2020-07-10 20:25:46,169 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 63 [2020-07-10 20:25:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:46,170 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2020-07-10 20:25:46,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-07-10 20:25:46,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 68 transitions. [2020-07-10 20:25:46,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2020-07-10 20:25:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 20:25:46,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:46,247 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:46,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 20:25:46,248 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash -446911130, now seen corresponding path program 14 times [2020-07-10 20:25:46,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:46,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748554397] [2020-07-10 20:25:46,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:48,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {4256#true} assume true; {4256#true} is VALID [2020-07-10 20:25:48,392 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4256#true} {4256#true} #45#return; {4256#true} is VALID [2020-07-10 20:25:48,392 INFO L263 TraceCheckUtils]: 0: Hoare triple {4256#true} call ULTIMATE.init(); {4256#true} is VALID [2020-07-10 20:25:48,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {4256#true} assume true; {4256#true} is VALID [2020-07-10 20:25:48,393 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4256#true} {4256#true} #45#return; {4256#true} is VALID [2020-07-10 20:25:48,393 INFO L263 TraceCheckUtils]: 3: Hoare triple {4256#true} call #t~ret1 := main(); {4256#true} is VALID [2020-07-10 20:25:48,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {4256#true} havoc ~i~0; {4256#true} is VALID [2020-07-10 20:25:48,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {4256#true} ~i~0 := 0; {4260#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:48,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {4260#(<= main_~i~0 0)} [77] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_14 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_14 1))) (and (<= .cse0 v_oct_main_~i~0_out_14) (<= v_oct_main_~i~0_out_14 .cse0) (or (< v_oct_main_~i~0_out_14 .cse1) (< 999999 v_oct_main_~i~0_in_14) (< 999998 v_oct_main_~i~0_in_14) (< 1000000 v_oct_main_~i~0_out_14) (< 1000001 v_oct_main_~i~0_out_14)) (<= (* 2 v_oct_main_~i~0_in_14) 1999998))) (and (<= v_oct_main_~i~0_in_14 999999) (<= .cse1 v_oct_main_~i~0_out_14) (<= v_oct_main_~i~0_in_14 999998) (<= v_oct_main_~i~0_out_14 1000000) (<= v_oct_main_~i~0_out_14 1000001)))) InVars {main_~i~0=v_oct_main_~i~0_in_14} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_14|, main_~i~0=v_oct_main_~i~0_out_14} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {4261#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:48,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {4261#(<= main_~i~0 1000000)} [76] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {4262#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:48,405 INFO L263 TraceCheckUtils]: 8: Hoare triple {4262#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {4263#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:48,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {4263#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4264#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:48,406 INFO L280 TraceCheckUtils]: 10: Hoare triple {4264#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4257#false} is VALID [2020-07-10 20:25:48,406 INFO L280 TraceCheckUtils]: 11: Hoare triple {4257#false} assume !false; {4257#false} is VALID [2020-07-10 20:25:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:49,925 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:49,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748554397] [2020-07-10 20:25:49,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:49,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2020-07-10 20:25:49,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656556640] [2020-07-10 20:25:49,927 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 67 [2020-07-10 20:25:49,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:49,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2020-07-10 20:25:50,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:50,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-07-10 20:25:50,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:50,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-07-10 20:25:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=1702, Unknown=0, NotChecked=0, Total=2352 [2020-07-10 20:25:50,005 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 48 states. [2020-07-10 20:25:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:50,507 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2020-07-10 20:25:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-07-10 20:25:50,508 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 67 [2020-07-10 20:25:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 20:25:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 79 transitions. [2020-07-10 20:25:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 20:25:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 79 transitions. [2020-07-10 20:25:50,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 79 transitions. [2020-07-10 20:25:50,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:50,611 INFO L225 Difference]: With dead ends: 79 [2020-07-10 20:25:50,611 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 20:25:50,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=650, Invalid=1702, Unknown=0, NotChecked=0, Total=2352 [2020-07-10 20:25:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 20:25:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2020-07-10 20:25:50,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:50,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2020-07-10 20:25:50,695 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2020-07-10 20:25:50,696 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2020-07-10 20:25:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:50,698 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2020-07-10 20:25:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2020-07-10 20:25:50,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:50,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:50,699 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2020-07-10 20:25:50,700 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2020-07-10 20:25:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:50,702 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2020-07-10 20:25:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2020-07-10 20:25:50,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:50,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:50,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:50,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 20:25:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2020-07-10 20:25:50,704 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 67 [2020-07-10 20:25:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:50,705 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2020-07-10 20:25:50,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-07-10 20:25:50,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 72 transitions. [2020-07-10 20:25:50,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2020-07-10 20:25:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-10 20:25:50,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:50,779 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:50,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 20:25:50,779 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash 354324067, now seen corresponding path program 15 times [2020-07-10 20:25:50,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:50,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1328742403] [2020-07-10 20:25:50,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:52,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {4759#true} assume true; {4759#true} is VALID [2020-07-10 20:25:52,946 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4759#true} {4759#true} #45#return; {4759#true} is VALID [2020-07-10 20:25:52,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {4759#true} call ULTIMATE.init(); {4759#true} is VALID [2020-07-10 20:25:52,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {4759#true} assume true; {4759#true} is VALID [2020-07-10 20:25:52,947 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4759#true} {4759#true} #45#return; {4759#true} is VALID [2020-07-10 20:25:52,947 INFO L263 TraceCheckUtils]: 3: Hoare triple {4759#true} call #t~ret1 := main(); {4759#true} is VALID [2020-07-10 20:25:52,947 INFO L280 TraceCheckUtils]: 4: Hoare triple {4759#true} havoc ~i~0; {4759#true} is VALID [2020-07-10 20:25:52,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {4759#true} ~i~0 := 0; {4763#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:52,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {4763#(<= main_~i~0 0)} [79] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_15 2))) (or (and (<= v_oct_main_~i~0_in_15 999999) (<= v_oct_main_~i~0_out_15 1000000) (<= .cse0 v_oct_main_~i~0_out_15) (<= v_oct_main_~i~0_out_15 1000001) (<= v_oct_main_~i~0_in_15 999998)) (let ((.cse1 (+ v_oct_main_~i~0_in_15 1))) (and (<= .cse1 v_oct_main_~i~0_out_15) (<= (* 2 v_oct_main_~i~0_in_15) 1999998) (or (< v_oct_main_~i~0_out_15 .cse0) (< 1000001 v_oct_main_~i~0_out_15) (< 999999 v_oct_main_~i~0_in_15) (< 999998 v_oct_main_~i~0_in_15) (< 1000000 v_oct_main_~i~0_out_15)) (<= v_oct_main_~i~0_out_15 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_15} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_15|, main_~i~0=v_oct_main_~i~0_out_15} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {4764#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:52,949 INFO L280 TraceCheckUtils]: 7: Hoare triple {4764#(<= main_~i~0 1000000)} [78] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {4765#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:52,950 INFO L263 TraceCheckUtils]: 8: Hoare triple {4765#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {4766#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:52,951 INFO L280 TraceCheckUtils]: 9: Hoare triple {4766#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4767#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:52,951 INFO L280 TraceCheckUtils]: 10: Hoare triple {4767#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4760#false} is VALID [2020-07-10 20:25:52,951 INFO L280 TraceCheckUtils]: 11: Hoare triple {4760#false} assume !false; {4760#false} is VALID [2020-07-10 20:25:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:54,638 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:54,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1328742403] [2020-07-10 20:25:54,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:54,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2020-07-10 20:25:54,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840166892] [2020-07-10 20:25:54,640 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 71 [2020-07-10 20:25:54,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:54,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2020-07-10 20:25:54,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:54,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2020-07-10 20:25:54,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:54,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2020-07-10 20:25:54,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=1919, Unknown=0, NotChecked=0, Total=2652 [2020-07-10 20:25:54,722 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 51 states. [2020-07-10 20:25:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:55,500 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2020-07-10 20:25:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-07-10 20:25:55,501 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 71 [2020-07-10 20:25:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 20:25:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 83 transitions. [2020-07-10 20:25:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 20:25:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 83 transitions. [2020-07-10 20:25:55,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 83 transitions. [2020-07-10 20:25:55,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:55,604 INFO L225 Difference]: With dead ends: 83 [2020-07-10 20:25:55,604 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 20:25:55,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=733, Invalid=1919, Unknown=0, NotChecked=0, Total=2652 [2020-07-10 20:25:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 20:25:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-10 20:25:55,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:55,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-10 20:25:55,670 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-10 20:25:55,670 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-10 20:25:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:55,673 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2020-07-10 20:25:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2020-07-10 20:25:55,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:55,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:55,674 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-10 20:25:55,674 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-10 20:25:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:55,677 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2020-07-10 20:25:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2020-07-10 20:25:55,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:55,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:55,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:55,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 20:25:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2020-07-10 20:25:55,680 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 71 [2020-07-10 20:25:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:55,681 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2020-07-10 20:25:55,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 51 states. [2020-07-10 20:25:55,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 76 transitions. [2020-07-10 20:25:55,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2020-07-10 20:25:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-10 20:25:55,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:55,769 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:55,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 20:25:55,770 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash -555898656, now seen corresponding path program 16 times [2020-07-10 20:25:55,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:55,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947147335] [2020-07-10 20:25:55,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:25:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:57,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {5289#true} assume true; {5289#true} is VALID [2020-07-10 20:25:57,935 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5289#true} {5289#true} #45#return; {5289#true} is VALID [2020-07-10 20:25:57,935 INFO L263 TraceCheckUtils]: 0: Hoare triple {5289#true} call ULTIMATE.init(); {5289#true} is VALID [2020-07-10 20:25:57,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {5289#true} assume true; {5289#true} is VALID [2020-07-10 20:25:57,935 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5289#true} {5289#true} #45#return; {5289#true} is VALID [2020-07-10 20:25:57,935 INFO L263 TraceCheckUtils]: 3: Hoare triple {5289#true} call #t~ret1 := main(); {5289#true} is VALID [2020-07-10 20:25:57,936 INFO L280 TraceCheckUtils]: 4: Hoare triple {5289#true} havoc ~i~0; {5289#true} is VALID [2020-07-10 20:25:57,936 INFO L280 TraceCheckUtils]: 5: Hoare triple {5289#true} ~i~0 := 0; {5293#(<= main_~i~0 0)} is VALID [2020-07-10 20:25:57,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {5293#(<= main_~i~0 0)} [81] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_16 2))) (or (and (<= v_oct_main_~i~0_out_16 1000001) (<= v_oct_main_~i~0_out_16 1000000) (<= v_oct_main_~i~0_in_16 999998) (<= v_oct_main_~i~0_in_16 999999) (<= .cse0 v_oct_main_~i~0_out_16)) (let ((.cse1 (+ v_oct_main_~i~0_in_16 1))) (and (<= v_oct_main_~i~0_out_16 .cse1) (<= (* 2 v_oct_main_~i~0_in_16) 1999998) (or (< 1000000 v_oct_main_~i~0_out_16) (< 999998 v_oct_main_~i~0_in_16) (< 1000001 v_oct_main_~i~0_out_16) (< v_oct_main_~i~0_out_16 .cse0) (< 999999 v_oct_main_~i~0_in_16)) (<= .cse1 v_oct_main_~i~0_out_16))))) InVars {main_~i~0=v_oct_main_~i~0_in_16} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_16|, main_~i~0=v_oct_main_~i~0_out_16} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {5294#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:25:57,938 INFO L280 TraceCheckUtils]: 7: Hoare triple {5294#(<= main_~i~0 1000000)} [80] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {5295#(= main_~i~0 1000000)} is VALID [2020-07-10 20:25:57,939 INFO L263 TraceCheckUtils]: 8: Hoare triple {5295#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {5296#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:57,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {5296#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5297#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:57,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {5297#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5290#false} is VALID [2020-07-10 20:25:57,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {5290#false} assume !false; {5290#false} is VALID [2020-07-10 20:25:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:59,821 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:59,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947147335] [2020-07-10 20:25:59,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:59,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2020-07-10 20:25:59,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730040705] [2020-07-10 20:25:59,822 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 75 [2020-07-10 20:25:59,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:59,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2020-07-10 20:25:59,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:59,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2020-07-10 20:25:59,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:59,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2020-07-10 20:25:59,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=2149, Unknown=0, NotChecked=0, Total=2970 [2020-07-10 20:25:59,912 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 54 states. [2020-07-10 20:26:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:00,767 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-07-10 20:26:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-07-10 20:26:00,767 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 75 [2020-07-10 20:26:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 20:26:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2020-07-10 20:26:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 20:26:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2020-07-10 20:26:00,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 87 transitions. [2020-07-10 20:26:00,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:00,864 INFO L225 Difference]: With dead ends: 87 [2020-07-10 20:26:00,865 INFO L226 Difference]: Without dead ends: 82 [2020-07-10 20:26:00,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=821, Invalid=2149, Unknown=0, NotChecked=0, Total=2970 [2020-07-10 20:26:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-10 20:26:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2020-07-10 20:26:00,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:00,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 80 states. [2020-07-10 20:26:00,933 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 80 states. [2020-07-10 20:26:00,933 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 80 states. [2020-07-10 20:26:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:00,936 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2020-07-10 20:26:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2020-07-10 20:26:00,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:00,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:00,937 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 82 states. [2020-07-10 20:26:00,937 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 82 states. [2020-07-10 20:26:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:00,939 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2020-07-10 20:26:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2020-07-10 20:26:00,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:00,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:00,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:00,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-10 20:26:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2020-07-10 20:26:00,942 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 75 [2020-07-10 20:26:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:00,942 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2020-07-10 20:26:00,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 54 states. [2020-07-10 20:26:00,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 80 transitions. [2020-07-10 20:26:01,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2020-07-10 20:26:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-10 20:26:01,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:01,025 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:01,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 20:26:01,025 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash 643906781, now seen corresponding path program 17 times [2020-07-10 20:26:01,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:01,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473477809] [2020-07-10 20:26:01,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:26:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:03,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {5846#true} assume true; {5846#true} is VALID [2020-07-10 20:26:03,173 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5846#true} {5846#true} #45#return; {5846#true} is VALID [2020-07-10 20:26:03,174 INFO L263 TraceCheckUtils]: 0: Hoare triple {5846#true} call ULTIMATE.init(); {5846#true} is VALID [2020-07-10 20:26:03,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {5846#true} assume true; {5846#true} is VALID [2020-07-10 20:26:03,174 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5846#true} {5846#true} #45#return; {5846#true} is VALID [2020-07-10 20:26:03,174 INFO L263 TraceCheckUtils]: 3: Hoare triple {5846#true} call #t~ret1 := main(); {5846#true} is VALID [2020-07-10 20:26:03,174 INFO L280 TraceCheckUtils]: 4: Hoare triple {5846#true} havoc ~i~0; {5846#true} is VALID [2020-07-10 20:26:03,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {5846#true} ~i~0 := 0; {5850#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:03,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {5850#(<= main_~i~0 0)} [83] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_17 2))) (or (and (<= v_oct_main_~i~0_in_17 999998) (<= v_oct_main_~i~0_out_17 1000001) (<= v_oct_main_~i~0_in_17 999999) (<= v_oct_main_~i~0_out_17 1000000) (<= .cse0 v_oct_main_~i~0_out_17)) (let ((.cse1 (+ v_oct_main_~i~0_in_17 1))) (and (<= .cse1 v_oct_main_~i~0_out_17) (or (< 1000000 v_oct_main_~i~0_out_17) (< 999999 v_oct_main_~i~0_in_17) (< 999998 v_oct_main_~i~0_in_17) (< v_oct_main_~i~0_out_17 .cse0) (< 1000001 v_oct_main_~i~0_out_17)) (<= (* 2 v_oct_main_~i~0_in_17) 1999998) (<= v_oct_main_~i~0_out_17 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_17} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_17|, main_~i~0=v_oct_main_~i~0_out_17} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {5851#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:03,184 INFO L280 TraceCheckUtils]: 7: Hoare triple {5851#(<= main_~i~0 1000000)} [82] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {5852#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:03,184 INFO L263 TraceCheckUtils]: 8: Hoare triple {5852#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {5853#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:03,185 INFO L280 TraceCheckUtils]: 9: Hoare triple {5853#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5854#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:03,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {5854#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5847#false} is VALID [2020-07-10 20:26:03,187 INFO L280 TraceCheckUtils]: 11: Hoare triple {5847#false} assume !false; {5847#false} is VALID [2020-07-10 20:26:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:26:05,286 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:26:05,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473477809] [2020-07-10 20:26:05,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:26:05,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2020-07-10 20:26:05,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129280133] [2020-07-10 20:26:05,288 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2020-07-10 20:26:05,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:26:05,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2020-07-10 20:26:05,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:05,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2020-07-10 20:26:05,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:26:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2020-07-10 20:26:05,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=2392, Unknown=0, NotChecked=0, Total=3306 [2020-07-10 20:26:05,389 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 57 states. [2020-07-10 20:26:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:05,973 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2020-07-10 20:26:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-07-10 20:26:05,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2020-07-10 20:26:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 20:26:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-07-10 20:26:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 20:26:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-07-10 20:26:05,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 91 transitions. [2020-07-10 20:26:06,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:06,092 INFO L225 Difference]: With dead ends: 91 [2020-07-10 20:26:06,092 INFO L226 Difference]: Without dead ends: 86 [2020-07-10 20:26:06,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=914, Invalid=2392, Unknown=0, NotChecked=0, Total=3306 [2020-07-10 20:26:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-10 20:26:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2020-07-10 20:26:06,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:06,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2020-07-10 20:26:06,180 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2020-07-10 20:26:06,181 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2020-07-10 20:26:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:06,184 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2020-07-10 20:26:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2020-07-10 20:26:06,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:06,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:06,185 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2020-07-10 20:26:06,185 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2020-07-10 20:26:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:06,188 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2020-07-10 20:26:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2020-07-10 20:26:06,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:06,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:06,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:06,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-10 20:26:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2020-07-10 20:26:06,191 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 79 [2020-07-10 20:26:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:06,191 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2020-07-10 20:26:06,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 57 states. [2020-07-10 20:26:06,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 84 transitions. [2020-07-10 20:26:06,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2020-07-10 20:26:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-10 20:26:06,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:06,305 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:06,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-10 20:26:06,306 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash 433097306, now seen corresponding path program 18 times [2020-07-10 20:26:06,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:06,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502079677] [2020-07-10 20:26:06,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:26:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:08,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {6430#true} assume true; {6430#true} is VALID [2020-07-10 20:26:08,468 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6430#true} {6430#true} #45#return; {6430#true} is VALID [2020-07-10 20:26:08,468 INFO L263 TraceCheckUtils]: 0: Hoare triple {6430#true} call ULTIMATE.init(); {6430#true} is VALID [2020-07-10 20:26:08,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {6430#true} assume true; {6430#true} is VALID [2020-07-10 20:26:08,469 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6430#true} {6430#true} #45#return; {6430#true} is VALID [2020-07-10 20:26:08,469 INFO L263 TraceCheckUtils]: 3: Hoare triple {6430#true} call #t~ret1 := main(); {6430#true} is VALID [2020-07-10 20:26:08,469 INFO L280 TraceCheckUtils]: 4: Hoare triple {6430#true} havoc ~i~0; {6430#true} is VALID [2020-07-10 20:26:08,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {6430#true} ~i~0 := 0; {6434#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:08,471 INFO L280 TraceCheckUtils]: 6: Hoare triple {6434#(<= main_~i~0 0)} [85] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_18 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_18 1))) (and (<= (* 2 v_oct_main_~i~0_in_18) 1999998) (<= v_oct_main_~i~0_out_18 .cse0) (or (< 999999 v_oct_main_~i~0_in_18) (< 1000000 v_oct_main_~i~0_out_18) (< 999998 v_oct_main_~i~0_in_18) (< v_oct_main_~i~0_out_18 .cse1) (< 1000001 v_oct_main_~i~0_out_18)) (<= .cse0 v_oct_main_~i~0_out_18))) (and (<= v_oct_main_~i~0_in_18 999999) (<= v_oct_main_~i~0_out_18 1000000) (<= v_oct_main_~i~0_in_18 999998) (<= .cse1 v_oct_main_~i~0_out_18) (<= v_oct_main_~i~0_out_18 1000001)))) InVars {main_~i~0=v_oct_main_~i~0_in_18} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_18|, main_~i~0=v_oct_main_~i~0_out_18} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {6435#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:08,472 INFO L280 TraceCheckUtils]: 7: Hoare triple {6435#(<= main_~i~0 1000000)} [84] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {6436#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:08,473 INFO L263 TraceCheckUtils]: 8: Hoare triple {6436#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {6437#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:08,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {6437#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6438#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:08,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {6438#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6431#false} is VALID [2020-07-10 20:26:08,480 INFO L280 TraceCheckUtils]: 11: Hoare triple {6431#false} assume !false; {6431#false} is VALID [2020-07-10 20:26:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:26:10,819 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:26:10,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502079677] [2020-07-10 20:26:10,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:26:10,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2020-07-10 20:26:10,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449707311] [2020-07-10 20:26:10,820 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 83 [2020-07-10 20:26:10,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:26:10,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2020-07-10 20:26:10,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:10,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-07-10 20:26:10,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:26:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-07-10 20:26:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=2648, Unknown=0, NotChecked=0, Total=3660 [2020-07-10 20:26:10,932 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 60 states. [2020-07-10 20:26:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:11,991 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2020-07-10 20:26:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2020-07-10 20:26:11,991 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 83 [2020-07-10 20:26:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 20:26:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 95 transitions. [2020-07-10 20:26:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 20:26:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 95 transitions. [2020-07-10 20:26:11,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 95 transitions. [2020-07-10 20:26:12,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:12,103 INFO L225 Difference]: With dead ends: 95 [2020-07-10 20:26:12,103 INFO L226 Difference]: Without dead ends: 90 [2020-07-10 20:26:12,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1012, Invalid=2648, Unknown=0, NotChecked=0, Total=3660 [2020-07-10 20:26:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-10 20:26:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2020-07-10 20:26:12,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:12,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2020-07-10 20:26:12,205 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2020-07-10 20:26:12,205 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2020-07-10 20:26:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:12,208 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2020-07-10 20:26:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2020-07-10 20:26:12,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:12,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:12,209 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2020-07-10 20:26:12,209 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2020-07-10 20:26:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:12,214 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2020-07-10 20:26:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2020-07-10 20:26:12,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:12,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:12,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:12,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-10 20:26:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2020-07-10 20:26:12,221 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 83 [2020-07-10 20:26:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:12,221 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2020-07-10 20:26:12,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-07-10 20:26:12,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 88 transitions. [2020-07-10 20:26:12,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2020-07-10 20:26:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-10 20:26:12,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:12,358 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:12,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-10 20:26:12,358 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash 28496215, now seen corresponding path program 19 times [2020-07-10 20:26:12,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:12,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1018289257] [2020-07-10 20:26:12,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:26:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:14,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {7041#true} assume true; {7041#true} is VALID [2020-07-10 20:26:14,543 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7041#true} {7041#true} #45#return; {7041#true} is VALID [2020-07-10 20:26:14,543 INFO L263 TraceCheckUtils]: 0: Hoare triple {7041#true} call ULTIMATE.init(); {7041#true} is VALID [2020-07-10 20:26:14,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {7041#true} assume true; {7041#true} is VALID [2020-07-10 20:26:14,543 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7041#true} {7041#true} #45#return; {7041#true} is VALID [2020-07-10 20:26:14,544 INFO L263 TraceCheckUtils]: 3: Hoare triple {7041#true} call #t~ret1 := main(); {7041#true} is VALID [2020-07-10 20:26:14,544 INFO L280 TraceCheckUtils]: 4: Hoare triple {7041#true} havoc ~i~0; {7041#true} is VALID [2020-07-10 20:26:14,544 INFO L280 TraceCheckUtils]: 5: Hoare triple {7041#true} ~i~0 := 0; {7045#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:14,545 INFO L280 TraceCheckUtils]: 6: Hoare triple {7045#(<= main_~i~0 0)} [87] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_19 2))) (or (and (<= v_oct_main_~i~0_in_19 999998) (<= .cse0 v_oct_main_~i~0_out_19) (<= v_oct_main_~i~0_in_19 999999) (<= v_oct_main_~i~0_out_19 1000001) (<= v_oct_main_~i~0_out_19 1000000)) (let ((.cse1 (+ v_oct_main_~i~0_in_19 1))) (and (<= .cse1 v_oct_main_~i~0_out_19) (<= (* 2 v_oct_main_~i~0_in_19) 1999998) (or (< v_oct_main_~i~0_out_19 .cse0) (< 1000000 v_oct_main_~i~0_out_19) (< 999999 v_oct_main_~i~0_in_19) (< 1000001 v_oct_main_~i~0_out_19) (< 999998 v_oct_main_~i~0_in_19)) (<= v_oct_main_~i~0_out_19 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_19} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_19|, main_~i~0=v_oct_main_~i~0_out_19} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {7046#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:14,546 INFO L280 TraceCheckUtils]: 7: Hoare triple {7046#(<= main_~i~0 1000000)} [86] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {7047#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:14,547 INFO L263 TraceCheckUtils]: 8: Hoare triple {7047#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {7048#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:14,547 INFO L280 TraceCheckUtils]: 9: Hoare triple {7048#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7049#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:14,547 INFO L280 TraceCheckUtils]: 10: Hoare triple {7049#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7042#false} is VALID [2020-07-10 20:26:14,548 INFO L280 TraceCheckUtils]: 11: Hoare triple {7042#false} assume !false; {7042#false} is VALID [2020-07-10 20:26:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:26:17,102 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:26:17,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1018289257] [2020-07-10 20:26:17,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:26:17,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2020-07-10 20:26:17,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049743559] [2020-07-10 20:26:17,103 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 87 [2020-07-10 20:26:17,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:26:17,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2020-07-10 20:26:17,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:17,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2020-07-10 20:26:17,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:26:17,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2020-07-10 20:26:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1115, Invalid=2917, Unknown=0, NotChecked=0, Total=4032 [2020-07-10 20:26:17,210 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 63 states. [2020-07-10 20:26:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:18,208 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2020-07-10 20:26:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2020-07-10 20:26:18,208 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 87 [2020-07-10 20:26:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-10 20:26:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 99 transitions. [2020-07-10 20:26:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-10 20:26:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 99 transitions. [2020-07-10 20:26:18,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 99 transitions. [2020-07-10 20:26:18,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:18,339 INFO L225 Difference]: With dead ends: 99 [2020-07-10 20:26:18,339 INFO L226 Difference]: Without dead ends: 94 [2020-07-10 20:26:18,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1115, Invalid=2917, Unknown=0, NotChecked=0, Total=4032 [2020-07-10 20:26:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-10 20:26:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2020-07-10 20:26:18,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:18,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2020-07-10 20:26:18,436 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2020-07-10 20:26:18,436 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2020-07-10 20:26:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:18,439 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2020-07-10 20:26:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2020-07-10 20:26:18,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:18,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:18,440 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2020-07-10 20:26:18,440 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2020-07-10 20:26:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:18,442 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2020-07-10 20:26:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2020-07-10 20:26:18,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:18,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:18,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:18,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-10 20:26:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2020-07-10 20:26:18,445 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 87 [2020-07-10 20:26:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:18,445 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2020-07-10 20:26:18,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 63 states. [2020-07-10 20:26:18,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states and 92 transitions. [2020-07-10 20:26:18,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2020-07-10 20:26:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-10 20:26:18,549 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:18,549 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:18,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-10 20:26:18,549 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash 284119508, now seen corresponding path program 20 times [2020-07-10 20:26:18,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:18,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245696734] [2020-07-10 20:26:18,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:26:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:20,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {7679#true} assume true; {7679#true} is VALID [2020-07-10 20:26:20,727 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7679#true} {7679#true} #45#return; {7679#true} is VALID [2020-07-10 20:26:20,727 INFO L263 TraceCheckUtils]: 0: Hoare triple {7679#true} call ULTIMATE.init(); {7679#true} is VALID [2020-07-10 20:26:20,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {7679#true} assume true; {7679#true} is VALID [2020-07-10 20:26:20,727 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7679#true} {7679#true} #45#return; {7679#true} is VALID [2020-07-10 20:26:20,728 INFO L263 TraceCheckUtils]: 3: Hoare triple {7679#true} call #t~ret1 := main(); {7679#true} is VALID [2020-07-10 20:26:20,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {7679#true} havoc ~i~0; {7679#true} is VALID [2020-07-10 20:26:20,729 INFO L280 TraceCheckUtils]: 5: Hoare triple {7679#true} ~i~0 := 0; {7683#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:20,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {7683#(<= main_~i~0 0)} [89] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_20 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_20 1))) (and (<= .cse0 v_oct_main_~i~0_out_20) (<= (* 2 v_oct_main_~i~0_in_20) 1999998) (or (< 1000000 v_oct_main_~i~0_out_20) (< 999999 v_oct_main_~i~0_in_20) (< 999998 v_oct_main_~i~0_in_20) (< 1000001 v_oct_main_~i~0_out_20) (< v_oct_main_~i~0_out_20 .cse1)) (<= v_oct_main_~i~0_out_20 .cse0))) (and (<= v_oct_main_~i~0_in_20 999998) (<= v_oct_main_~i~0_out_20 1000001) (<= .cse1 v_oct_main_~i~0_out_20) (<= v_oct_main_~i~0_out_20 1000000) (<= v_oct_main_~i~0_in_20 999999)))) InVars {main_~i~0=v_oct_main_~i~0_in_20} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_20|, main_~i~0=v_oct_main_~i~0_out_20} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {7684#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:20,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {7684#(<= main_~i~0 1000000)} [88] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {7685#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:20,732 INFO L263 TraceCheckUtils]: 8: Hoare triple {7685#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {7686#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:20,732 INFO L280 TraceCheckUtils]: 9: Hoare triple {7686#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7687#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:20,733 INFO L280 TraceCheckUtils]: 10: Hoare triple {7687#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7680#false} is VALID [2020-07-10 20:26:20,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {7680#false} assume !false; {7680#false} is VALID [2020-07-10 20:26:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:26:23,521 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:26:23,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245696734] [2020-07-10 20:26:23,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:26:23,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2020-07-10 20:26:23,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854911882] [2020-07-10 20:26:23,523 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 91 [2020-07-10 20:26:23,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:26:23,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2020-07-10 20:26:23,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:23,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2020-07-10 20:26:23,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:26:23,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2020-07-10 20:26:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1223, Invalid=3199, Unknown=0, NotChecked=0, Total=4422 [2020-07-10 20:26:23,641 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 66 states. [2020-07-10 20:26:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:24,685 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2020-07-10 20:26:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-07-10 20:26:24,686 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 91 [2020-07-10 20:26:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 20:26:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 103 transitions. [2020-07-10 20:26:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 20:26:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 103 transitions. [2020-07-10 20:26:24,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 103 transitions. [2020-07-10 20:26:24,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:24,818 INFO L225 Difference]: With dead ends: 103 [2020-07-10 20:26:24,818 INFO L226 Difference]: Without dead ends: 98 [2020-07-10 20:26:24,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1223, Invalid=3199, Unknown=0, NotChecked=0, Total=4422 [2020-07-10 20:26:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-10 20:26:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2020-07-10 20:26:24,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:24,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2020-07-10 20:26:24,909 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2020-07-10 20:26:24,909 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2020-07-10 20:26:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:24,911 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2020-07-10 20:26:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2020-07-10 20:26:24,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:24,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:24,912 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2020-07-10 20:26:24,913 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2020-07-10 20:26:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:24,914 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2020-07-10 20:26:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2020-07-10 20:26:24,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:24,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:24,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:24,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-10 20:26:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2020-07-10 20:26:24,917 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 91 [2020-07-10 20:26:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:24,917 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2020-07-10 20:26:24,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 66 states. [2020-07-10 20:26:24,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 96 transitions. [2020-07-10 20:26:25,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2020-07-10 20:26:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-07-10 20:26:25,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:25,038 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:25,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-10 20:26:25,038 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash 885869521, now seen corresponding path program 21 times [2020-07-10 20:26:25,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:25,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [813083265] [2020-07-10 20:26:25,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:26:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:27,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {8344#true} assume true; {8344#true} is VALID [2020-07-10 20:26:27,220 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8344#true} {8344#true} #45#return; {8344#true} is VALID [2020-07-10 20:26:27,220 INFO L263 TraceCheckUtils]: 0: Hoare triple {8344#true} call ULTIMATE.init(); {8344#true} is VALID [2020-07-10 20:26:27,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {8344#true} assume true; {8344#true} is VALID [2020-07-10 20:26:27,221 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8344#true} {8344#true} #45#return; {8344#true} is VALID [2020-07-10 20:26:27,221 INFO L263 TraceCheckUtils]: 3: Hoare triple {8344#true} call #t~ret1 := main(); {8344#true} is VALID [2020-07-10 20:26:27,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {8344#true} havoc ~i~0; {8344#true} is VALID [2020-07-10 20:26:27,222 INFO L280 TraceCheckUtils]: 5: Hoare triple {8344#true} ~i~0 := 0; {8348#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:27,223 INFO L280 TraceCheckUtils]: 6: Hoare triple {8348#(<= main_~i~0 0)} [91] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_21 2))) (or (and (<= v_oct_main_~i~0_out_21 1000001) (<= v_oct_main_~i~0_in_21 999998) (<= .cse0 v_oct_main_~i~0_out_21) (<= v_oct_main_~i~0_out_21 1000000) (<= v_oct_main_~i~0_in_21 999999)) (let ((.cse1 (+ v_oct_main_~i~0_in_21 1))) (and (<= .cse1 v_oct_main_~i~0_out_21) (<= v_oct_main_~i~0_out_21 .cse1) (or (< 999999 v_oct_main_~i~0_in_21) (< 1000000 v_oct_main_~i~0_out_21) (< 1000001 v_oct_main_~i~0_out_21) (< 999998 v_oct_main_~i~0_in_21) (< v_oct_main_~i~0_out_21 .cse0)) (<= (* 2 v_oct_main_~i~0_in_21) 1999998))))) InVars {main_~i~0=v_oct_main_~i~0_in_21} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_21|, main_~i~0=v_oct_main_~i~0_out_21} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {8349#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:27,223 INFO L280 TraceCheckUtils]: 7: Hoare triple {8349#(<= main_~i~0 1000000)} [90] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {8350#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:27,224 INFO L263 TraceCheckUtils]: 8: Hoare triple {8350#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {8351#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:27,224 INFO L280 TraceCheckUtils]: 9: Hoare triple {8351#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8352#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:27,225 INFO L280 TraceCheckUtils]: 10: Hoare triple {8352#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8345#false} is VALID [2020-07-10 20:26:27,225 INFO L280 TraceCheckUtils]: 11: Hoare triple {8345#false} assume !false; {8345#false} is VALID [2020-07-10 20:26:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:26:30,347 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:26:30,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [813083265] [2020-07-10 20:26:30,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:26:30,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2020-07-10 20:26:30,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703615455] [2020-07-10 20:26:30,348 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 95 [2020-07-10 20:26:30,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:26:30,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states. [2020-07-10 20:26:30,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:30,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2020-07-10 20:26:30,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:26:30,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2020-07-10 20:26:30,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=3494, Unknown=0, NotChecked=0, Total=4830 [2020-07-10 20:26:30,468 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 69 states. [2020-07-10 20:26:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:31,600 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2020-07-10 20:26:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2020-07-10 20:26:31,600 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 95 [2020-07-10 20:26:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-10 20:26:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 107 transitions. [2020-07-10 20:26:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-10 20:26:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 107 transitions. [2020-07-10 20:26:31,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 107 transitions. [2020-07-10 20:26:31,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:31,728 INFO L225 Difference]: With dead ends: 107 [2020-07-10 20:26:31,728 INFO L226 Difference]: Without dead ends: 102 [2020-07-10 20:26:31,729 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1336, Invalid=3494, Unknown=0, NotChecked=0, Total=4830 [2020-07-10 20:26:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-10 20:26:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2020-07-10 20:26:31,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:31,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2020-07-10 20:26:31,819 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2020-07-10 20:26:31,819 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2020-07-10 20:26:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:31,821 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2020-07-10 20:26:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2020-07-10 20:26:31,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:31,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:31,821 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2020-07-10 20:26:31,822 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2020-07-10 20:26:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:31,823 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2020-07-10 20:26:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2020-07-10 20:26:31,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:31,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:31,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:31,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-10 20:26:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2020-07-10 20:26:31,826 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 95 [2020-07-10 20:26:31,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:31,826 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2020-07-10 20:26:31,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 69 states. [2020-07-10 20:26:31,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 100 transitions. [2020-07-10 20:26:31,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2020-07-10 20:26:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-10 20:26:31,941 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:31,941 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:31,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-10 20:26:31,942 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -453771442, now seen corresponding path program 22 times [2020-07-10 20:26:31,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:31,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902524730] [2020-07-10 20:26:31,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:26:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:34,082 INFO L280 TraceCheckUtils]: 0: Hoare triple {9036#true} assume true; {9036#true} is VALID [2020-07-10 20:26:34,082 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9036#true} {9036#true} #45#return; {9036#true} is VALID [2020-07-10 20:26:34,082 INFO L263 TraceCheckUtils]: 0: Hoare triple {9036#true} call ULTIMATE.init(); {9036#true} is VALID [2020-07-10 20:26:34,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {9036#true} assume true; {9036#true} is VALID [2020-07-10 20:26:34,083 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9036#true} {9036#true} #45#return; {9036#true} is VALID [2020-07-10 20:26:34,083 INFO L263 TraceCheckUtils]: 3: Hoare triple {9036#true} call #t~ret1 := main(); {9036#true} is VALID [2020-07-10 20:26:34,083 INFO L280 TraceCheckUtils]: 4: Hoare triple {9036#true} havoc ~i~0; {9036#true} is VALID [2020-07-10 20:26:34,084 INFO L280 TraceCheckUtils]: 5: Hoare triple {9036#true} ~i~0 := 0; {9040#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:34,090 INFO L280 TraceCheckUtils]: 6: Hoare triple {9040#(<= main_~i~0 0)} [93] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_22 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_22 1))) (and (or (< 999999 v_oct_main_~i~0_in_22) (< v_oct_main_~i~0_out_22 .cse0) (< 1000001 v_oct_main_~i~0_out_22) (< 999998 v_oct_main_~i~0_in_22) (< 1000000 v_oct_main_~i~0_out_22)) (<= (* 2 v_oct_main_~i~0_in_22) 1999998) (<= v_oct_main_~i~0_out_22 .cse1) (<= .cse1 v_oct_main_~i~0_out_22))) (and (<= v_oct_main_~i~0_in_22 999999) (<= v_oct_main_~i~0_out_22 1000001) (<= v_oct_main_~i~0_out_22 1000000) (<= .cse0 v_oct_main_~i~0_out_22) (<= v_oct_main_~i~0_in_22 999998)))) InVars {main_~i~0=v_oct_main_~i~0_in_22} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_22|, main_~i~0=v_oct_main_~i~0_out_22} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {9041#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:34,091 INFO L280 TraceCheckUtils]: 7: Hoare triple {9041#(<= main_~i~0 1000000)} [92] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {9042#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:34,092 INFO L263 TraceCheckUtils]: 8: Hoare triple {9042#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {9043#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:34,092 INFO L280 TraceCheckUtils]: 9: Hoare triple {9043#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {9044#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:34,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {9044#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {9037#false} is VALID [2020-07-10 20:26:34,093 INFO L280 TraceCheckUtils]: 11: Hoare triple {9037#false} assume !false; {9037#false} is VALID [2020-07-10 20:26:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:26:37,485 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:26:37,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902524730] [2020-07-10 20:26:37,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:26:37,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2020-07-10 20:26:37,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540825100] [2020-07-10 20:26:37,486 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 99 [2020-07-10 20:26:37,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:26:37,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states. [2020-07-10 20:26:37,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:37,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2020-07-10 20:26:37,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:26:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2020-07-10 20:26:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1454, Invalid=3802, Unknown=0, NotChecked=0, Total=5256 [2020-07-10 20:26:37,620 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 72 states. [2020-07-10 20:26:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:38,355 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2020-07-10 20:26:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2020-07-10 20:26:38,355 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 99 [2020-07-10 20:26:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 20:26:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 111 transitions. [2020-07-10 20:26:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 20:26:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 111 transitions. [2020-07-10 20:26:38,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 111 transitions. [2020-07-10 20:26:38,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:38,499 INFO L225 Difference]: With dead ends: 111 [2020-07-10 20:26:38,499 INFO L226 Difference]: Without dead ends: 106 [2020-07-10 20:26:38,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2406 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1454, Invalid=3802, Unknown=0, NotChecked=0, Total=5256 [2020-07-10 20:26:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-07-10 20:26:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2020-07-10 20:26:38,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:38,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 104 states. [2020-07-10 20:26:38,595 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 104 states. [2020-07-10 20:26:38,595 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 104 states. [2020-07-10 20:26:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:38,597 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2020-07-10 20:26:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2020-07-10 20:26:38,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:38,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:38,597 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 106 states. [2020-07-10 20:26:38,597 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 106 states. [2020-07-10 20:26:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:38,599 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2020-07-10 20:26:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2020-07-10 20:26:38,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:38,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:38,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:38,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-10 20:26:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2020-07-10 20:26:38,602 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 99 [2020-07-10 20:26:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:38,602 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2020-07-10 20:26:38,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 72 states. [2020-07-10 20:26:38,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 104 states and 104 transitions. [2020-07-10 20:26:38,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2020-07-10 20:26:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-07-10 20:26:38,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:38,746 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:38,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-10 20:26:38,747 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:38,747 INFO L82 PathProgramCache]: Analyzing trace with hash -211112885, now seen corresponding path program 23 times [2020-07-10 20:26:38,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:38,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141228680] [2020-07-10 20:26:38,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:26:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:40,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {9755#true} assume true; {9755#true} is VALID [2020-07-10 20:26:40,888 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9755#true} {9755#true} #45#return; {9755#true} is VALID [2020-07-10 20:26:40,888 INFO L263 TraceCheckUtils]: 0: Hoare triple {9755#true} call ULTIMATE.init(); {9755#true} is VALID [2020-07-10 20:26:40,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {9755#true} assume true; {9755#true} is VALID [2020-07-10 20:26:40,888 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9755#true} {9755#true} #45#return; {9755#true} is VALID [2020-07-10 20:26:40,888 INFO L263 TraceCheckUtils]: 3: Hoare triple {9755#true} call #t~ret1 := main(); {9755#true} is VALID [2020-07-10 20:26:40,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {9755#true} havoc ~i~0; {9755#true} is VALID [2020-07-10 20:26:40,889 INFO L280 TraceCheckUtils]: 5: Hoare triple {9755#true} ~i~0 := 0; {9759#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:40,890 INFO L280 TraceCheckUtils]: 6: Hoare triple {9759#(<= main_~i~0 0)} [95] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_23 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_23 1))) (and (<= (* 2 v_oct_main_~i~0_in_23) 1999998) (or (< 999999 v_oct_main_~i~0_in_23) (< 1000000 v_oct_main_~i~0_out_23) (< 999998 v_oct_main_~i~0_in_23) (< v_oct_main_~i~0_out_23 .cse0) (< 1000001 v_oct_main_~i~0_out_23)) (<= .cse1 v_oct_main_~i~0_out_23) (<= v_oct_main_~i~0_out_23 .cse1))) (and (<= v_oct_main_~i~0_in_23 999999) (<= .cse0 v_oct_main_~i~0_out_23) (<= v_oct_main_~i~0_out_23 1000001) (<= v_oct_main_~i~0_out_23 1000000) (<= v_oct_main_~i~0_in_23 999998)))) InVars {main_~i~0=v_oct_main_~i~0_in_23} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_23|, main_~i~0=v_oct_main_~i~0_out_23} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {9760#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:40,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {9760#(<= main_~i~0 1000000)} [94] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {9761#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:40,891 INFO L263 TraceCheckUtils]: 8: Hoare triple {9761#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {9762#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:40,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {9762#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {9763#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:40,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {9763#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {9756#false} is VALID [2020-07-10 20:26:40,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {9756#false} assume !false; {9756#false} is VALID [2020-07-10 20:26:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:26:44,526 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:26:44,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141228680] [2020-07-10 20:26:44,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:26:44,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2020-07-10 20:26:44,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032438771] [2020-07-10 20:26:44,528 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 103 [2020-07-10 20:26:44,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:26:44,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states. [2020-07-10 20:26:44,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:44,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2020-07-10 20:26:44,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:26:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2020-07-10 20:26:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1577, Invalid=4123, Unknown=0, NotChecked=0, Total=5700 [2020-07-10 20:26:44,664 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 75 states. [2020-07-10 20:26:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:45,924 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2020-07-10 20:26:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2020-07-10 20:26:45,924 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 103 [2020-07-10 20:26:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-10 20:26:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 115 transitions. [2020-07-10 20:26:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-10 20:26:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 115 transitions. [2020-07-10 20:26:45,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 115 transitions. [2020-07-10 20:26:46,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:46,065 INFO L225 Difference]: With dead ends: 115 [2020-07-10 20:26:46,065 INFO L226 Difference]: Without dead ends: 110 [2020-07-10 20:26:46,066 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2630 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1577, Invalid=4123, Unknown=0, NotChecked=0, Total=5700 [2020-07-10 20:26:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-10 20:26:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2020-07-10 20:26:46,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:46,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2020-07-10 20:26:46,168 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2020-07-10 20:26:46,168 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2020-07-10 20:26:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:46,170 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2020-07-10 20:26:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2020-07-10 20:26:46,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:46,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:46,171 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2020-07-10 20:26:46,171 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2020-07-10 20:26:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:46,173 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2020-07-10 20:26:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2020-07-10 20:26:46,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:46,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:46,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:46,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-10 20:26:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2020-07-10 20:26:46,176 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 103 [2020-07-10 20:26:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:46,176 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2020-07-10 20:26:46,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 75 states. [2020-07-10 20:26:46,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 108 transitions. [2020-07-10 20:26:46,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2020-07-10 20:26:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-07-10 20:26:46,320 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:46,320 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:46,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-10 20:26:46,321 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1553502920, now seen corresponding path program 24 times [2020-07-10 20:26:46,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:46,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519623385] [2020-07-10 20:26:46,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 13 to 23 [2020-07-10 20:26:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:48,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {10501#true} assume true; {10501#true} is VALID [2020-07-10 20:26:48,493 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10501#true} {10501#true} #45#return; {10501#true} is VALID [2020-07-10 20:26:48,493 INFO L263 TraceCheckUtils]: 0: Hoare triple {10501#true} call ULTIMATE.init(); {10501#true} is VALID [2020-07-10 20:26:48,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {10501#true} assume true; {10501#true} is VALID [2020-07-10 20:26:48,493 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10501#true} {10501#true} #45#return; {10501#true} is VALID [2020-07-10 20:26:48,494 INFO L263 TraceCheckUtils]: 3: Hoare triple {10501#true} call #t~ret1 := main(); {10501#true} is VALID [2020-07-10 20:26:48,494 INFO L280 TraceCheckUtils]: 4: Hoare triple {10501#true} havoc ~i~0; {10501#true} is VALID [2020-07-10 20:26:48,494 INFO L280 TraceCheckUtils]: 5: Hoare triple {10501#true} ~i~0 := 0; {10505#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:48,495 INFO L280 TraceCheckUtils]: 6: Hoare triple {10505#(<= main_~i~0 0)} [97] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_24 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_24 1))) (and (<= .cse0 v_oct_main_~i~0_out_24) (<= (* 2 v_oct_main_~i~0_in_24) 1999998) (<= v_oct_main_~i~0_out_24 .cse0) (or (< v_oct_main_~i~0_out_24 .cse1) (< 1000001 v_oct_main_~i~0_out_24) (< 1000000 v_oct_main_~i~0_out_24) (< 999999 v_oct_main_~i~0_in_24) (< 999998 v_oct_main_~i~0_in_24)))) (and (<= v_oct_main_~i~0_in_24 999998) (<= v_oct_main_~i~0_out_24 1000001) (<= .cse1 v_oct_main_~i~0_out_24) (<= v_oct_main_~i~0_out_24 1000000) (<= v_oct_main_~i~0_in_24 999999)))) InVars {main_~i~0=v_oct_main_~i~0_in_24} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_24|, main_~i~0=v_oct_main_~i~0_out_24} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {10506#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:48,496 INFO L280 TraceCheckUtils]: 7: Hoare triple {10506#(<= main_~i~0 1000000)} [96] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {10507#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:48,497 INFO L263 TraceCheckUtils]: 8: Hoare triple {10507#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {10508#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:48,497 INFO L280 TraceCheckUtils]: 9: Hoare triple {10508#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {10509#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:48,497 INFO L280 TraceCheckUtils]: 10: Hoare triple {10509#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {10502#false} is VALID [2020-07-10 20:26:48,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {10502#false} assume !false; {10502#false} is VALID [2020-07-10 20:26:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:26:52,472 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:26:52,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519623385] [2020-07-10 20:26:52,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:26:52,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2020-07-10 20:26:52,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438381743] [2020-07-10 20:26:52,474 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 107 [2020-07-10 20:26:52,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:26:52,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states. [2020-07-10 20:26:52,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:52,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2020-07-10 20:26:52,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:26:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2020-07-10 20:26:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1705, Invalid=4457, Unknown=0, NotChecked=0, Total=6162 [2020-07-10 20:26:52,618 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 78 states. [2020-07-10 20:26:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:53,903 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2020-07-10 20:26:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2020-07-10 20:26:53,904 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 107 [2020-07-10 20:26:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:26:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-10 20:26:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 119 transitions. [2020-07-10 20:26:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-10 20:26:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 119 transitions. [2020-07-10 20:26:53,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 119 transitions. [2020-07-10 20:26:54,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:54,063 INFO L225 Difference]: With dead ends: 119 [2020-07-10 20:26:54,063 INFO L226 Difference]: Without dead ends: 114 [2020-07-10 20:26:54,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 6 SyntacticMatches, 25 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2864 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1705, Invalid=4457, Unknown=0, NotChecked=0, Total=6162 [2020-07-10 20:26:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-10 20:26:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2020-07-10 20:26:54,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:26:54,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2020-07-10 20:26:54,182 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2020-07-10 20:26:54,182 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2020-07-10 20:26:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:54,184 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2020-07-10 20:26:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2020-07-10 20:26:54,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:54,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:54,184 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2020-07-10 20:26:54,184 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2020-07-10 20:26:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:26:54,186 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2020-07-10 20:26:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2020-07-10 20:26:54,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:26:54,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:26:54,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:26:54,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:26:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-10 20:26:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2020-07-10 20:26:54,188 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 107 [2020-07-10 20:26:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:26:54,188 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2020-07-10 20:26:54,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 78 states. [2020-07-10 20:26:54,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 112 states and 112 transitions. [2020-07-10 20:26:54,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:26:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2020-07-10 20:26:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-10 20:26:54,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:26:54,335 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:26:54,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-10 20:26:54,335 INFO L427 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:26:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:26:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash 390394565, now seen corresponding path program 25 times [2020-07-10 20:26:54,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:26:54,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2020799375] [2020-07-10 20:26:54,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:26:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:26:56,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {11274#true} assume true; {11274#true} is VALID [2020-07-10 20:26:56,485 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11274#true} {11274#true} #45#return; {11274#true} is VALID [2020-07-10 20:26:56,485 INFO L263 TraceCheckUtils]: 0: Hoare triple {11274#true} call ULTIMATE.init(); {11274#true} is VALID [2020-07-10 20:26:56,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {11274#true} assume true; {11274#true} is VALID [2020-07-10 20:26:56,486 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11274#true} {11274#true} #45#return; {11274#true} is VALID [2020-07-10 20:26:56,486 INFO L263 TraceCheckUtils]: 3: Hoare triple {11274#true} call #t~ret1 := main(); {11274#true} is VALID [2020-07-10 20:26:56,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {11274#true} havoc ~i~0; {11274#true} is VALID [2020-07-10 20:26:56,487 INFO L280 TraceCheckUtils]: 5: Hoare triple {11274#true} ~i~0 := 0; {11278#(<= main_~i~0 0)} is VALID [2020-07-10 20:26:56,488 INFO L280 TraceCheckUtils]: 6: Hoare triple {11278#(<= main_~i~0 0)} [99] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_25 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_25 1))) (and (or (< 999999 v_oct_main_~i~0_in_25) (< 1000001 v_oct_main_~i~0_out_25) (< 999998 v_oct_main_~i~0_in_25) (< 1000000 v_oct_main_~i~0_out_25) (< v_oct_main_~i~0_out_25 .cse0)) (<= v_oct_main_~i~0_out_25 .cse1) (<= .cse1 v_oct_main_~i~0_out_25) (<= (* 2 v_oct_main_~i~0_in_25) 1999998))) (and (<= v_oct_main_~i~0_out_25 1000000) (<= v_oct_main_~i~0_in_25 999999) (<= v_oct_main_~i~0_out_25 1000001) (<= v_oct_main_~i~0_in_25 999998) (<= .cse0 v_oct_main_~i~0_out_25)))) InVars {main_~i~0=v_oct_main_~i~0_in_25} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_25|, main_~i~0=v_oct_main_~i~0_out_25} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {11279#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:26:56,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {11279#(<= main_~i~0 1000000)} [98] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {11280#(= main_~i~0 1000000)} is VALID [2020-07-10 20:26:56,490 INFO L263 TraceCheckUtils]: 8: Hoare triple {11280#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {11281#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:26:56,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {11281#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {11282#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:26:56,491 INFO L280 TraceCheckUtils]: 10: Hoare triple {11282#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {11275#false} is VALID [2020-07-10 20:26:56,492 INFO L280 TraceCheckUtils]: 11: Hoare triple {11275#false} assume !false; {11275#false} is VALID [2020-07-10 20:26:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:27:00,894 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:27:00,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2020799375] [2020-07-10 20:27:00,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:27:00,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2020-07-10 20:27:00,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890332881] [2020-07-10 20:27:00,896 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 111 [2020-07-10 20:27:00,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:27:00,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states. [2020-07-10 20:27:01,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:01,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2020-07-10 20:27:01,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:27:01,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2020-07-10 20:27:01,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1838, Invalid=4804, Unknown=0, NotChecked=0, Total=6642 [2020-07-10 20:27:01,047 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 81 states. [2020-07-10 20:27:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:02,378 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2020-07-10 20:27:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2020-07-10 20:27:02,378 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 111 [2020-07-10 20:27:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:27:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-10 20:27:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2020-07-10 20:27:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-10 20:27:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2020-07-10 20:27:02,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 123 transitions. [2020-07-10 20:27:02,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:02,555 INFO L225 Difference]: With dead ends: 123 [2020-07-10 20:27:02,556 INFO L226 Difference]: Without dead ends: 118 [2020-07-10 20:27:02,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3108 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1838, Invalid=4804, Unknown=0, NotChecked=0, Total=6642 [2020-07-10 20:27:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-10 20:27:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2020-07-10 20:27:02,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:27:02,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 116 states. [2020-07-10 20:27:02,663 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 116 states. [2020-07-10 20:27:02,663 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 116 states. [2020-07-10 20:27:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:02,666 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2020-07-10 20:27:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2020-07-10 20:27:02,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:02,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:02,667 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 118 states. [2020-07-10 20:27:02,667 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 118 states. [2020-07-10 20:27:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:02,668 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2020-07-10 20:27:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2020-07-10 20:27:02,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:02,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:02,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:27:02,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:27:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-07-10 20:27:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2020-07-10 20:27:02,671 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 111 [2020-07-10 20:27:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:27:02,671 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2020-07-10 20:27:02,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 81 states. [2020-07-10 20:27:02,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 116 states and 116 transitions. [2020-07-10 20:27:02,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2020-07-10 20:27:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-07-10 20:27:02,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:27:02,835 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:27:02,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-10 20:27:02,836 INFO L427 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:27:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:27:02,838 INFO L82 PathProgramCache]: Analyzing trace with hash -459862974, now seen corresponding path program 26 times [2020-07-10 20:27:02,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:27:02,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [331023031] [2020-07-10 20:27:02,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:27:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:04,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {12074#true} assume true; {12074#true} is VALID [2020-07-10 20:27:04,976 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12074#true} {12074#true} #45#return; {12074#true} is VALID [2020-07-10 20:27:04,976 INFO L263 TraceCheckUtils]: 0: Hoare triple {12074#true} call ULTIMATE.init(); {12074#true} is VALID [2020-07-10 20:27:04,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {12074#true} assume true; {12074#true} is VALID [2020-07-10 20:27:04,976 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12074#true} {12074#true} #45#return; {12074#true} is VALID [2020-07-10 20:27:04,977 INFO L263 TraceCheckUtils]: 3: Hoare triple {12074#true} call #t~ret1 := main(); {12074#true} is VALID [2020-07-10 20:27:04,977 INFO L280 TraceCheckUtils]: 4: Hoare triple {12074#true} havoc ~i~0; {12074#true} is VALID [2020-07-10 20:27:04,979 INFO L280 TraceCheckUtils]: 5: Hoare triple {12074#true} ~i~0 := 0; {12078#(<= main_~i~0 0)} is VALID [2020-07-10 20:27:04,981 INFO L280 TraceCheckUtils]: 6: Hoare triple {12078#(<= main_~i~0 0)} [101] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_26 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_26 1))) (and (or (< v_oct_main_~i~0_out_26 .cse0) (< 999998 v_oct_main_~i~0_in_26) (< 999999 v_oct_main_~i~0_in_26) (< 1000001 v_oct_main_~i~0_out_26) (< 1000000 v_oct_main_~i~0_out_26)) (<= .cse1 v_oct_main_~i~0_out_26) (<= v_oct_main_~i~0_out_26 .cse1) (<= (* 2 v_oct_main_~i~0_in_26) 1999998))) (and (<= v_oct_main_~i~0_out_26 1000001) (<= v_oct_main_~i~0_in_26 999998) (<= v_oct_main_~i~0_out_26 1000000) (<= .cse0 v_oct_main_~i~0_out_26) (<= v_oct_main_~i~0_in_26 999999)))) InVars {main_~i~0=v_oct_main_~i~0_in_26} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_26|, main_~i~0=v_oct_main_~i~0_out_26} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {12079#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:27:04,981 INFO L280 TraceCheckUtils]: 7: Hoare triple {12079#(<= main_~i~0 1000000)} [100] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {12080#(= main_~i~0 1000000)} is VALID [2020-07-10 20:27:04,982 INFO L263 TraceCheckUtils]: 8: Hoare triple {12080#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {12081#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:27:04,983 INFO L280 TraceCheckUtils]: 9: Hoare triple {12081#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {12082#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:27:04,983 INFO L280 TraceCheckUtils]: 10: Hoare triple {12082#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12075#false} is VALID [2020-07-10 20:27:04,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {12075#false} assume !false; {12075#false} is VALID [2020-07-10 20:27:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:27:09,634 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:27:09,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [331023031] [2020-07-10 20:27:09,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:27:09,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2020-07-10 20:27:09,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263402741] [2020-07-10 20:27:09,636 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 115 [2020-07-10 20:27:09,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:27:09,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states. [2020-07-10 20:27:09,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:09,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2020-07-10 20:27:09,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:27:09,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2020-07-10 20:27:09,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1976, Invalid=5164, Unknown=0, NotChecked=0, Total=7140 [2020-07-10 20:27:09,796 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 84 states. [2020-07-10 20:27:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:10,872 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2020-07-10 20:27:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-07-10 20:27:10,873 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 115 [2020-07-10 20:27:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:27:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-10 20:27:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2020-07-10 20:27:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-10 20:27:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2020-07-10 20:27:10,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 127 transitions. [2020-07-10 20:27:11,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:11,064 INFO L225 Difference]: With dead ends: 127 [2020-07-10 20:27:11,065 INFO L226 Difference]: Without dead ends: 122 [2020-07-10 20:27:11,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3362 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1976, Invalid=5164, Unknown=0, NotChecked=0, Total=7140 [2020-07-10 20:27:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-10 20:27:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2020-07-10 20:27:11,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:27:11,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2020-07-10 20:27:11,192 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2020-07-10 20:27:11,192 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2020-07-10 20:27:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:11,195 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2020-07-10 20:27:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2020-07-10 20:27:11,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:11,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:11,196 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2020-07-10 20:27:11,196 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2020-07-10 20:27:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:11,197 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2020-07-10 20:27:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2020-07-10 20:27:11,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:11,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:11,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:27:11,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:27:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-10 20:27:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2020-07-10 20:27:11,200 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 115 [2020-07-10 20:27:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:27:11,200 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2020-07-10 20:27:11,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 84 states. [2020-07-10 20:27:11,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 120 transitions. [2020-07-10 20:27:11,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2020-07-10 20:27:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-07-10 20:27:11,359 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:27:11,359 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:27:11,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-10 20:27:11,360 INFO L427 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:27:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:27:11,360 INFO L82 PathProgramCache]: Analyzing trace with hash 538320703, now seen corresponding path program 27 times [2020-07-10 20:27:11,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:27:11,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1595706958] [2020-07-10 20:27:11,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:27:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:13,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {12901#true} assume true; {12901#true} is VALID [2020-07-10 20:27:13,537 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12901#true} {12901#true} #45#return; {12901#true} is VALID [2020-07-10 20:27:13,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {12901#true} call ULTIMATE.init(); {12901#true} is VALID [2020-07-10 20:27:13,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {12901#true} assume true; {12901#true} is VALID [2020-07-10 20:27:13,538 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12901#true} {12901#true} #45#return; {12901#true} is VALID [2020-07-10 20:27:13,538 INFO L263 TraceCheckUtils]: 3: Hoare triple {12901#true} call #t~ret1 := main(); {12901#true} is VALID [2020-07-10 20:27:13,538 INFO L280 TraceCheckUtils]: 4: Hoare triple {12901#true} havoc ~i~0; {12901#true} is VALID [2020-07-10 20:27:13,543 INFO L280 TraceCheckUtils]: 5: Hoare triple {12901#true} ~i~0 := 0; {12905#(<= main_~i~0 0)} is VALID [2020-07-10 20:27:13,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {12905#(<= main_~i~0 0)} [103] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_27 2))) (or (and (<= v_oct_main_~i~0_out_27 1000000) (<= v_oct_main_~i~0_in_27 999999) (<= .cse0 v_oct_main_~i~0_out_27) (<= v_oct_main_~i~0_out_27 1000001) (<= v_oct_main_~i~0_in_27 999998)) (let ((.cse1 (+ v_oct_main_~i~0_in_27 1))) (and (<= v_oct_main_~i~0_out_27 .cse1) (or (< 999998 v_oct_main_~i~0_in_27) (< 1000001 v_oct_main_~i~0_out_27) (< 1000000 v_oct_main_~i~0_out_27) (< v_oct_main_~i~0_out_27 .cse0) (< 999999 v_oct_main_~i~0_in_27)) (<= .cse1 v_oct_main_~i~0_out_27) (<= (* 2 v_oct_main_~i~0_in_27) 1999998))))) InVars {main_~i~0=v_oct_main_~i~0_in_27} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_27|, main_~i~0=v_oct_main_~i~0_out_27} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {12906#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:27:13,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {12906#(<= main_~i~0 1000000)} [102] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {12907#(= main_~i~0 1000000)} is VALID [2020-07-10 20:27:13,545 INFO L263 TraceCheckUtils]: 8: Hoare triple {12907#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {12908#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:27:13,546 INFO L280 TraceCheckUtils]: 9: Hoare triple {12908#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {12909#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:27:13,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {12909#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12902#false} is VALID [2020-07-10 20:27:13,546 INFO L280 TraceCheckUtils]: 11: Hoare triple {12902#false} assume !false; {12902#false} is VALID [2020-07-10 20:27:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:27:18,607 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:27:18,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1595706958] [2020-07-10 20:27:18,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:27:18,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2020-07-10 20:27:18,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118845552] [2020-07-10 20:27:18,609 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 119 [2020-07-10 20:27:18,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:27:18,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states. [2020-07-10 20:27:18,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:18,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2020-07-10 20:27:18,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:27:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2020-07-10 20:27:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2119, Invalid=5537, Unknown=0, NotChecked=0, Total=7656 [2020-07-10 20:27:18,777 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 87 states. [2020-07-10 20:27:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:20,050 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2020-07-10 20:27:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2020-07-10 20:27:20,051 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 119 [2020-07-10 20:27:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:27:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-10 20:27:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2020-07-10 20:27:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-10 20:27:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2020-07-10 20:27:20,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 131 transitions. [2020-07-10 20:27:20,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:20,248 INFO L225 Difference]: With dead ends: 131 [2020-07-10 20:27:20,248 INFO L226 Difference]: Without dead ends: 126 [2020-07-10 20:27:20,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 6 SyntacticMatches, 28 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2119, Invalid=5537, Unknown=0, NotChecked=0, Total=7656 [2020-07-10 20:27:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-10 20:27:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2020-07-10 20:27:20,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:27:20,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 124 states. [2020-07-10 20:27:20,375 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 124 states. [2020-07-10 20:27:20,375 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 124 states. [2020-07-10 20:27:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:20,376 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2020-07-10 20:27:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2020-07-10 20:27:20,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:20,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:20,377 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 126 states. [2020-07-10 20:27:20,377 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 126 states. [2020-07-10 20:27:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:20,379 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2020-07-10 20:27:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2020-07-10 20:27:20,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:20,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:20,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:27:20,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:27:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-07-10 20:27:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2020-07-10 20:27:20,382 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 119 [2020-07-10 20:27:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:27:20,382 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2020-07-10 20:27:20,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 87 states. [2020-07-10 20:27:20,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 124 states and 124 transitions. [2020-07-10 20:27:20,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2020-07-10 20:27:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-10 20:27:20,562 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:27:20,562 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:27:20,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-10 20:27:20,563 INFO L427 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:27:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:27:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1884722244, now seen corresponding path program 28 times [2020-07-10 20:27:20,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:27:20,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [474190351] [2020-07-10 20:27:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:27:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:22,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {13755#true} assume true; {13755#true} is VALID [2020-07-10 20:27:22,737 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13755#true} {13755#true} #45#return; {13755#true} is VALID [2020-07-10 20:27:22,737 INFO L263 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13755#true} is VALID [2020-07-10 20:27:22,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {13755#true} assume true; {13755#true} is VALID [2020-07-10 20:27:22,738 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13755#true} {13755#true} #45#return; {13755#true} is VALID [2020-07-10 20:27:22,738 INFO L263 TraceCheckUtils]: 3: Hoare triple {13755#true} call #t~ret1 := main(); {13755#true} is VALID [2020-07-10 20:27:22,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {13755#true} havoc ~i~0; {13755#true} is VALID [2020-07-10 20:27:22,743 INFO L280 TraceCheckUtils]: 5: Hoare triple {13755#true} ~i~0 := 0; {13759#(<= main_~i~0 0)} is VALID [2020-07-10 20:27:22,745 INFO L280 TraceCheckUtils]: 6: Hoare triple {13759#(<= main_~i~0 0)} [105] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_28 2))) (or (and (<= v_oct_main_~i~0_in_28 999998) (<= v_oct_main_~i~0_out_28 1000000) (<= .cse0 v_oct_main_~i~0_out_28) (<= v_oct_main_~i~0_in_28 999999) (<= v_oct_main_~i~0_out_28 1000001)) (let ((.cse1 (+ v_oct_main_~i~0_in_28 1))) (and (<= v_oct_main_~i~0_out_28 .cse1) (<= .cse1 v_oct_main_~i~0_out_28) (or (< v_oct_main_~i~0_out_28 .cse0) (< 999998 v_oct_main_~i~0_in_28) (< 1000001 v_oct_main_~i~0_out_28) (< 1000000 v_oct_main_~i~0_out_28) (< 999999 v_oct_main_~i~0_in_28)) (<= (* 2 v_oct_main_~i~0_in_28) 1999998))))) InVars {main_~i~0=v_oct_main_~i~0_in_28} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_28|, main_~i~0=v_oct_main_~i~0_out_28} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {13760#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:27:22,745 INFO L280 TraceCheckUtils]: 7: Hoare triple {13760#(<= main_~i~0 1000000)} [104] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {13761#(= main_~i~0 1000000)} is VALID [2020-07-10 20:27:22,746 INFO L263 TraceCheckUtils]: 8: Hoare triple {13761#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {13762#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:27:22,746 INFO L280 TraceCheckUtils]: 9: Hoare triple {13762#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {13763#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:27:22,747 INFO L280 TraceCheckUtils]: 10: Hoare triple {13763#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {13756#false} is VALID [2020-07-10 20:27:22,747 INFO L280 TraceCheckUtils]: 11: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2020-07-10 20:27:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:27:28,195 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:27:28,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [474190351] [2020-07-10 20:27:28,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:27:28,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2020-07-10 20:27:28,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535991893] [2020-07-10 20:27:28,196 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 123 [2020-07-10 20:27:28,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:27:28,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states. [2020-07-10 20:27:28,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:28,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2020-07-10 20:27:28,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:27:28,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2020-07-10 20:27:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2267, Invalid=5923, Unknown=0, NotChecked=0, Total=8190 [2020-07-10 20:27:28,374 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 90 states. [2020-07-10 20:27:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:29,287 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2020-07-10 20:27:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-07-10 20:27:29,288 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 123 [2020-07-10 20:27:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:27:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-10 20:27:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2020-07-10 20:27:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-10 20:27:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2020-07-10 20:27:29,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states and 135 transitions. [2020-07-10 20:27:29,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:29,482 INFO L225 Difference]: With dead ends: 135 [2020-07-10 20:27:29,482 INFO L226 Difference]: Without dead ends: 130 [2020-07-10 20:27:29,483 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 29 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3900 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2267, Invalid=5923, Unknown=0, NotChecked=0, Total=8190 [2020-07-10 20:27:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-10 20:27:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2020-07-10 20:27:29,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:27:29,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 128 states. [2020-07-10 20:27:29,621 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 128 states. [2020-07-10 20:27:29,621 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 128 states. [2020-07-10 20:27:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:29,623 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2020-07-10 20:27:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2020-07-10 20:27:29,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:29,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:29,624 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 130 states. [2020-07-10 20:27:29,624 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 130 states. [2020-07-10 20:27:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:29,634 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2020-07-10 20:27:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2020-07-10 20:27:29,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:29,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:29,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:27:29,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:27:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-07-10 20:27:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2020-07-10 20:27:29,637 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 123 [2020-07-10 20:27:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:27:29,638 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2020-07-10 20:27:29,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 90 states. [2020-07-10 20:27:29,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 128 states and 128 transitions. [2020-07-10 20:27:29,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2020-07-10 20:27:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-07-10 20:27:29,818 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:27:29,818 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:27:29,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-07-10 20:27:29,819 INFO L427 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:27:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:27:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 865612217, now seen corresponding path program 29 times [2020-07-10 20:27:29,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:27:29,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644485259] [2020-07-10 20:27:29,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:27:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:31,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {14636#true} assume true; {14636#true} is VALID [2020-07-10 20:27:31,974 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14636#true} {14636#true} #45#return; {14636#true} is VALID [2020-07-10 20:27:31,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {14636#true} call ULTIMATE.init(); {14636#true} is VALID [2020-07-10 20:27:31,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {14636#true} assume true; {14636#true} is VALID [2020-07-10 20:27:31,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14636#true} {14636#true} #45#return; {14636#true} is VALID [2020-07-10 20:27:31,975 INFO L263 TraceCheckUtils]: 3: Hoare triple {14636#true} call #t~ret1 := main(); {14636#true} is VALID [2020-07-10 20:27:31,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {14636#true} havoc ~i~0; {14636#true} is VALID [2020-07-10 20:27:31,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {14636#true} ~i~0 := 0; {14640#(<= main_~i~0 0)} is VALID [2020-07-10 20:27:31,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {14640#(<= main_~i~0 0)} [107] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_29 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_29 1))) (and (<= .cse0 v_oct_main_~i~0_out_29) (or (< 1000000 v_oct_main_~i~0_out_29) (< 1000001 v_oct_main_~i~0_out_29) (< 999998 v_oct_main_~i~0_in_29) (< v_oct_main_~i~0_out_29 .cse1) (< 999999 v_oct_main_~i~0_in_29)) (<= v_oct_main_~i~0_out_29 .cse0) (<= (* 2 v_oct_main_~i~0_in_29) 1999998))) (and (<= v_oct_main_~i~0_out_29 1000000) (<= v_oct_main_~i~0_in_29 999998) (<= v_oct_main_~i~0_in_29 999999) (<= .cse1 v_oct_main_~i~0_out_29) (<= v_oct_main_~i~0_out_29 1000001)))) InVars {main_~i~0=v_oct_main_~i~0_in_29} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_29|, main_~i~0=v_oct_main_~i~0_out_29} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {14641#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:27:31,977 INFO L280 TraceCheckUtils]: 7: Hoare triple {14641#(<= main_~i~0 1000000)} [106] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {14642#(= main_~i~0 1000000)} is VALID [2020-07-10 20:27:31,978 INFO L263 TraceCheckUtils]: 8: Hoare triple {14642#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {14643#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:27:31,979 INFO L280 TraceCheckUtils]: 9: Hoare triple {14643#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {14644#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:27:31,979 INFO L280 TraceCheckUtils]: 10: Hoare triple {14644#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {14637#false} is VALID [2020-07-10 20:27:31,979 INFO L280 TraceCheckUtils]: 11: Hoare triple {14637#false} assume !false; {14637#false} is VALID [2020-07-10 20:27:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:27:37,872 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:27:37,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644485259] [2020-07-10 20:27:37,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:27:37,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [93] imperfect sequences [] total 93 [2020-07-10 20:27:37,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939245742] [2020-07-10 20:27:37,873 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 127 [2020-07-10 20:27:37,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:27:37,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states. [2020-07-10 20:27:38,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:38,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2020-07-10 20:27:38,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:27:38,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2020-07-10 20:27:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2420, Invalid=6322, Unknown=0, NotChecked=0, Total=8742 [2020-07-10 20:27:38,056 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 93 states. [2020-07-10 20:27:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:38,873 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2020-07-10 20:27:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2020-07-10 20:27:38,873 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 127 [2020-07-10 20:27:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:27:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-10 20:27:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2020-07-10 20:27:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-10 20:27:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2020-07-10 20:27:38,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states and 139 transitions. [2020-07-10 20:27:39,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:39,075 INFO L225 Difference]: With dead ends: 139 [2020-07-10 20:27:39,075 INFO L226 Difference]: Without dead ends: 134 [2020-07-10 20:27:39,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4184 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2420, Invalid=6322, Unknown=0, NotChecked=0, Total=8742 [2020-07-10 20:27:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-10 20:27:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2020-07-10 20:27:39,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:27:39,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 132 states. [2020-07-10 20:27:39,204 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 132 states. [2020-07-10 20:27:39,204 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 132 states. [2020-07-10 20:27:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:39,206 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2020-07-10 20:27:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2020-07-10 20:27:39,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:39,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:39,207 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 134 states. [2020-07-10 20:27:39,207 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 134 states. [2020-07-10 20:27:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:39,209 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2020-07-10 20:27:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2020-07-10 20:27:39,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:39,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:39,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:27:39,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:27:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-10 20:27:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2020-07-10 20:27:39,211 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 127 [2020-07-10 20:27:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:27:39,212 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2020-07-10 20:27:39,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 93 states. [2020-07-10 20:27:39,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 132 states and 132 transitions. [2020-07-10 20:27:39,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2020-07-10 20:27:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-07-10 20:27:39,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:27:39,410 INFO L422 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:27:39,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-07-10 20:27:39,410 INFO L427 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:27:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:27:39,411 INFO L82 PathProgramCache]: Analyzing trace with hash 378122550, now seen corresponding path program 30 times [2020-07-10 20:27:39,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:27:39,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59355445] [2020-07-10 20:27:39,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:27:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:41,593 INFO L280 TraceCheckUtils]: 0: Hoare triple {15544#true} assume true; {15544#true} is VALID [2020-07-10 20:27:41,594 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15544#true} {15544#true} #45#return; {15544#true} is VALID [2020-07-10 20:27:41,594 INFO L263 TraceCheckUtils]: 0: Hoare triple {15544#true} call ULTIMATE.init(); {15544#true} is VALID [2020-07-10 20:27:41,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {15544#true} assume true; {15544#true} is VALID [2020-07-10 20:27:41,594 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15544#true} {15544#true} #45#return; {15544#true} is VALID [2020-07-10 20:27:41,595 INFO L263 TraceCheckUtils]: 3: Hoare triple {15544#true} call #t~ret1 := main(); {15544#true} is VALID [2020-07-10 20:27:41,595 INFO L280 TraceCheckUtils]: 4: Hoare triple {15544#true} havoc ~i~0; {15544#true} is VALID [2020-07-10 20:27:41,595 INFO L280 TraceCheckUtils]: 5: Hoare triple {15544#true} ~i~0 := 0; {15548#(<= main_~i~0 0)} is VALID [2020-07-10 20:27:41,597 INFO L280 TraceCheckUtils]: 6: Hoare triple {15548#(<= main_~i~0 0)} [109] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_30 2))) (or (and (<= v_oct_main_~i~0_out_30 1000001) (<= .cse0 v_oct_main_~i~0_out_30) (<= v_oct_main_~i~0_in_30 999999) (<= v_oct_main_~i~0_out_30 1000000) (<= v_oct_main_~i~0_in_30 999998)) (let ((.cse1 (+ v_oct_main_~i~0_in_30 1))) (and (or (< v_oct_main_~i~0_out_30 .cse0) (< 1000000 v_oct_main_~i~0_out_30) (< 999999 v_oct_main_~i~0_in_30) (< 1000001 v_oct_main_~i~0_out_30) (< 999998 v_oct_main_~i~0_in_30)) (<= v_oct_main_~i~0_out_30 .cse1) (<= (* 2 v_oct_main_~i~0_in_30) 1999998) (<= .cse1 v_oct_main_~i~0_out_30))))) InVars {main_~i~0=v_oct_main_~i~0_in_30} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_30|, main_~i~0=v_oct_main_~i~0_out_30} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {15549#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:27:41,597 INFO L280 TraceCheckUtils]: 7: Hoare triple {15549#(<= main_~i~0 1000000)} [108] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {15550#(= main_~i~0 1000000)} is VALID [2020-07-10 20:27:41,598 INFO L263 TraceCheckUtils]: 8: Hoare triple {15550#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {15551#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:27:41,599 INFO L280 TraceCheckUtils]: 9: Hoare triple {15551#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {15552#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:27:41,600 INFO L280 TraceCheckUtils]: 10: Hoare triple {15552#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {15545#false} is VALID [2020-07-10 20:27:41,600 INFO L280 TraceCheckUtils]: 11: Hoare triple {15545#false} assume !false; {15545#false} is VALID [2020-07-10 20:27:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:27:48,133 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:27:48,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59355445] [2020-07-10 20:27:48,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:27:48,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2020-07-10 20:27:48,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810124968] [2020-07-10 20:27:48,134 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 131 [2020-07-10 20:27:48,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:27:48,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2020-07-10 20:27:48,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:48,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2020-07-10 20:27:48,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:27:48,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2020-07-10 20:27:48,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2578, Invalid=6734, Unknown=0, NotChecked=0, Total=9312 [2020-07-10 20:27:48,329 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 96 states. [2020-07-10 20:27:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:49,361 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2020-07-10 20:27:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2020-07-10 20:27:49,361 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 131 [2020-07-10 20:27:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:27:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-10 20:27:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2020-07-10 20:27:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-10 20:27:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2020-07-10 20:27:49,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 143 transitions. [2020-07-10 20:27:49,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:49,576 INFO L225 Difference]: With dead ends: 143 [2020-07-10 20:27:49,576 INFO L226 Difference]: Without dead ends: 138 [2020-07-10 20:27:49,577 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4478 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2578, Invalid=6734, Unknown=0, NotChecked=0, Total=9312 [2020-07-10 20:27:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-10 20:27:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-10 20:27:49,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:27:49,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2020-07-10 20:27:49,728 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2020-07-10 20:27:49,728 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2020-07-10 20:27:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:49,730 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2020-07-10 20:27:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2020-07-10 20:27:49,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:49,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:49,730 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2020-07-10 20:27:49,731 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2020-07-10 20:27:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:27:49,732 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2020-07-10 20:27:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2020-07-10 20:27:49,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:27:49,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:27:49,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:27:49,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:27:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-10 20:27:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2020-07-10 20:27:49,735 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 131 [2020-07-10 20:27:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:27:49,735 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2020-07-10 20:27:49,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 96 states. [2020-07-10 20:27:49,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 136 states and 136 transitions. [2020-07-10 20:27:49,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2020-07-10 20:27:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-07-10 20:27:49,943 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:27:49,944 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:27:49,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-07-10 20:27:49,944 INFO L427 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:27:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:27:49,945 INFO L82 PathProgramCache]: Analyzing trace with hash 495266355, now seen corresponding path program 31 times [2020-07-10 20:27:49,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:27:49,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749308940] [2020-07-10 20:27:49,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:27:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:27:52,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {16479#true} assume true; {16479#true} is VALID [2020-07-10 20:27:52,107 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {16479#true} {16479#true} #45#return; {16479#true} is VALID [2020-07-10 20:27:52,107 INFO L263 TraceCheckUtils]: 0: Hoare triple {16479#true} call ULTIMATE.init(); {16479#true} is VALID [2020-07-10 20:27:52,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {16479#true} assume true; {16479#true} is VALID [2020-07-10 20:27:52,107 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {16479#true} {16479#true} #45#return; {16479#true} is VALID [2020-07-10 20:27:52,108 INFO L263 TraceCheckUtils]: 3: Hoare triple {16479#true} call #t~ret1 := main(); {16479#true} is VALID [2020-07-10 20:27:52,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {16479#true} havoc ~i~0; {16479#true} is VALID [2020-07-10 20:27:52,108 INFO L280 TraceCheckUtils]: 5: Hoare triple {16479#true} ~i~0 := 0; {16483#(<= main_~i~0 0)} is VALID [2020-07-10 20:27:52,109 INFO L280 TraceCheckUtils]: 6: Hoare triple {16483#(<= main_~i~0 0)} [111] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_31 2))) (or (and (<= v_oct_main_~i~0_out_31 1000000) (<= v_oct_main_~i~0_in_31 999999) (<= .cse0 v_oct_main_~i~0_out_31) (<= v_oct_main_~i~0_in_31 999998) (<= v_oct_main_~i~0_out_31 1000001)) (let ((.cse1 (+ v_oct_main_~i~0_in_31 1))) (and (<= (* 2 v_oct_main_~i~0_in_31) 1999998) (<= .cse1 v_oct_main_~i~0_out_31) (or (< 1000001 v_oct_main_~i~0_out_31) (< 1000000 v_oct_main_~i~0_out_31) (< 999998 v_oct_main_~i~0_in_31) (< v_oct_main_~i~0_out_31 .cse0) (< 999999 v_oct_main_~i~0_in_31)) (<= v_oct_main_~i~0_out_31 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_31} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_31|, main_~i~0=v_oct_main_~i~0_out_31} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {16484#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:27:52,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {16484#(<= main_~i~0 1000000)} [110] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {16485#(= main_~i~0 1000000)} is VALID [2020-07-10 20:27:52,111 INFO L263 TraceCheckUtils]: 8: Hoare triple {16485#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {16486#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:27:52,111 INFO L280 TraceCheckUtils]: 9: Hoare triple {16486#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {16487#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:27:52,112 INFO L280 TraceCheckUtils]: 10: Hoare triple {16487#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {16480#false} is VALID [2020-07-10 20:27:52,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {16480#false} assume !false; {16480#false} is VALID [2020-07-10 20:27:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:27:58,956 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:27:58,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749308940] [2020-07-10 20:27:58,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:27:58,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [99] imperfect sequences [] total 99 [2020-07-10 20:27:58,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664346072] [2020-07-10 20:27:58,958 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 135 [2020-07-10 20:27:58,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:27:58,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states. [2020-07-10 20:27:59,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:27:59,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2020-07-10 20:27:59,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:27:59,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2020-07-10 20:27:59,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2741, Invalid=7159, Unknown=0, NotChecked=0, Total=9900 [2020-07-10 20:27:59,163 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 99 states. [2020-07-10 20:28:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:00,954 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2020-07-10 20:28:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2020-07-10 20:28:00,955 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 135 [2020-07-10 20:28:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:28:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-10 20:28:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2020-07-10 20:28:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-10 20:28:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2020-07-10 20:28:00,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 147 transitions. [2020-07-10 20:28:01,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:01,196 INFO L225 Difference]: With dead ends: 147 [2020-07-10 20:28:01,196 INFO L226 Difference]: Without dead ends: 142 [2020-07-10 20:28:01,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 6 SyntacticMatches, 32 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4782 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2741, Invalid=7159, Unknown=0, NotChecked=0, Total=9900 [2020-07-10 20:28:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-10 20:28:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2020-07-10 20:28:01,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:28:01,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2020-07-10 20:28:01,334 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2020-07-10 20:28:01,335 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2020-07-10 20:28:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:01,337 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2020-07-10 20:28:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2020-07-10 20:28:01,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:01,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:01,338 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2020-07-10 20:28:01,338 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2020-07-10 20:28:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:01,340 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2020-07-10 20:28:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2020-07-10 20:28:01,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:01,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:01,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:28:01,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:28:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-10 20:28:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2020-07-10 20:28:01,342 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 135 [2020-07-10 20:28:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:28:01,343 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2020-07-10 20:28:01,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 99 states. [2020-07-10 20:28:01,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 140 states and 140 transitions. [2020-07-10 20:28:01,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2020-07-10 20:28:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-07-10 20:28:01,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:28:01,552 INFO L422 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:28:01,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-07-10 20:28:01,553 INFO L427 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:28:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:28:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash -672015184, now seen corresponding path program 32 times [2020-07-10 20:28:01,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:28:01,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487305171] [2020-07-10 20:28:01,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:28:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:03,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {17441#true} assume true; {17441#true} is VALID [2020-07-10 20:28:03,719 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17441#true} {17441#true} #45#return; {17441#true} is VALID [2020-07-10 20:28:03,719 INFO L263 TraceCheckUtils]: 0: Hoare triple {17441#true} call ULTIMATE.init(); {17441#true} is VALID [2020-07-10 20:28:03,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {17441#true} assume true; {17441#true} is VALID [2020-07-10 20:28:03,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17441#true} {17441#true} #45#return; {17441#true} is VALID [2020-07-10 20:28:03,719 INFO L263 TraceCheckUtils]: 3: Hoare triple {17441#true} call #t~ret1 := main(); {17441#true} is VALID [2020-07-10 20:28:03,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {17441#true} havoc ~i~0; {17441#true} is VALID [2020-07-10 20:28:03,720 INFO L280 TraceCheckUtils]: 5: Hoare triple {17441#true} ~i~0 := 0; {17445#(<= main_~i~0 0)} is VALID [2020-07-10 20:28:03,721 INFO L280 TraceCheckUtils]: 6: Hoare triple {17445#(<= main_~i~0 0)} [113] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_32 2))) (or (and (<= v_oct_main_~i~0_out_32 1000000) (<= v_oct_main_~i~0_in_32 999999) (<= v_oct_main_~i~0_in_32 999998) (<= v_oct_main_~i~0_out_32 1000001) (<= .cse0 v_oct_main_~i~0_out_32)) (let ((.cse1 (+ v_oct_main_~i~0_in_32 1))) (and (<= .cse1 v_oct_main_~i~0_out_32) (or (< 1000000 v_oct_main_~i~0_out_32) (< 1000001 v_oct_main_~i~0_out_32) (< 999998 v_oct_main_~i~0_in_32) (< v_oct_main_~i~0_out_32 .cse0) (< 999999 v_oct_main_~i~0_in_32)) (<= v_oct_main_~i~0_out_32 .cse1) (<= (* 2 v_oct_main_~i~0_in_32) 1999998))))) InVars {main_~i~0=v_oct_main_~i~0_in_32} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_32|, main_~i~0=v_oct_main_~i~0_out_32} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {17446#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:28:03,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {17446#(<= main_~i~0 1000000)} [112] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {17447#(= main_~i~0 1000000)} is VALID [2020-07-10 20:28:03,723 INFO L263 TraceCheckUtils]: 8: Hoare triple {17447#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {17448#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:28:03,723 INFO L280 TraceCheckUtils]: 9: Hoare triple {17448#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {17449#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:28:03,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {17449#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {17442#false} is VALID [2020-07-10 20:28:03,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {17442#false} assume !false; {17442#false} is VALID [2020-07-10 20:28:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:28:11,109 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:28:11,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487305171] [2020-07-10 20:28:11,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:28:11,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2020-07-10 20:28:11,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720349694] [2020-07-10 20:28:11,111 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 139 [2020-07-10 20:28:11,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:28:11,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states. [2020-07-10 20:28:11,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:11,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2020-07-10 20:28:11,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:28:11,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2020-07-10 20:28:11,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2909, Invalid=7597, Unknown=0, NotChecked=0, Total=10506 [2020-07-10 20:28:11,333 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 102 states. [2020-07-10 20:28:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:13,372 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2020-07-10 20:28:13,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2020-07-10 20:28:13,372 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 139 [2020-07-10 20:28:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:28:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-10 20:28:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2020-07-10 20:28:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-10 20:28:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2020-07-10 20:28:13,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states and 151 transitions. [2020-07-10 20:28:13,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:13,616 INFO L225 Difference]: With dead ends: 151 [2020-07-10 20:28:13,616 INFO L226 Difference]: Without dead ends: 146 [2020-07-10 20:28:13,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 6 SyntacticMatches, 33 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2909, Invalid=7597, Unknown=0, NotChecked=0, Total=10506 [2020-07-10 20:28:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-10 20:28:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2020-07-10 20:28:13,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:28:13,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2020-07-10 20:28:13,783 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2020-07-10 20:28:13,783 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2020-07-10 20:28:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:13,785 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2020-07-10 20:28:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2020-07-10 20:28:13,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:13,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:13,785 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2020-07-10 20:28:13,785 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2020-07-10 20:28:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:13,788 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2020-07-10 20:28:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2020-07-10 20:28:13,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:13,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:13,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:28:13,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:28:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-10 20:28:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2020-07-10 20:28:13,791 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 139 [2020-07-10 20:28:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:28:13,791 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2020-07-10 20:28:13,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 102 states. [2020-07-10 20:28:13,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states and 144 transitions. [2020-07-10 20:28:14,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2020-07-10 20:28:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-07-10 20:28:14,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:28:14,023 INFO L422 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:28:14,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-07-10 20:28:14,024 INFO L427 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:28:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:28:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1335298221, now seen corresponding path program 33 times [2020-07-10 20:28:14,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:28:14,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1889297370] [2020-07-10 20:28:14,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:28:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:16,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {18430#true} assume true; {18430#true} is VALID [2020-07-10 20:28:16,175 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {18430#true} {18430#true} #45#return; {18430#true} is VALID [2020-07-10 20:28:16,176 INFO L263 TraceCheckUtils]: 0: Hoare triple {18430#true} call ULTIMATE.init(); {18430#true} is VALID [2020-07-10 20:28:16,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {18430#true} assume true; {18430#true} is VALID [2020-07-10 20:28:16,176 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {18430#true} {18430#true} #45#return; {18430#true} is VALID [2020-07-10 20:28:16,176 INFO L263 TraceCheckUtils]: 3: Hoare triple {18430#true} call #t~ret1 := main(); {18430#true} is VALID [2020-07-10 20:28:16,176 INFO L280 TraceCheckUtils]: 4: Hoare triple {18430#true} havoc ~i~0; {18430#true} is VALID [2020-07-10 20:28:16,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {18430#true} ~i~0 := 0; {18434#(<= main_~i~0 0)} is VALID [2020-07-10 20:28:16,178 INFO L280 TraceCheckUtils]: 6: Hoare triple {18434#(<= main_~i~0 0)} [115] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_33 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_33 1))) (and (<= v_oct_main_~i~0_out_33 .cse0) (or (< 1000000 v_oct_main_~i~0_out_33) (< 999999 v_oct_main_~i~0_in_33) (< 999998 v_oct_main_~i~0_in_33) (< v_oct_main_~i~0_out_33 .cse1) (< 1000001 v_oct_main_~i~0_out_33)) (<= .cse0 v_oct_main_~i~0_out_33) (<= (* 2 v_oct_main_~i~0_in_33) 1999998))) (and (<= .cse1 v_oct_main_~i~0_out_33) (<= v_oct_main_~i~0_in_33 999999) (<= v_oct_main_~i~0_out_33 1000000) (<= v_oct_main_~i~0_in_33 999998) (<= v_oct_main_~i~0_out_33 1000001)))) InVars {main_~i~0=v_oct_main_~i~0_in_33} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_33|, main_~i~0=v_oct_main_~i~0_out_33} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {18435#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:28:16,178 INFO L280 TraceCheckUtils]: 7: Hoare triple {18435#(<= main_~i~0 1000000)} [114] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {18436#(= main_~i~0 1000000)} is VALID [2020-07-10 20:28:16,179 INFO L263 TraceCheckUtils]: 8: Hoare triple {18436#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {18437#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:28:16,180 INFO L280 TraceCheckUtils]: 9: Hoare triple {18437#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {18438#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:28:16,180 INFO L280 TraceCheckUtils]: 10: Hoare triple {18438#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {18431#false} is VALID [2020-07-10 20:28:16,180 INFO L280 TraceCheckUtils]: 11: Hoare triple {18431#false} assume !false; {18431#false} is VALID [2020-07-10 20:28:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:28:24,209 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:28:24,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1889297370] [2020-07-10 20:28:24,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:28:24,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2020-07-10 20:28:24,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299064719] [2020-07-10 20:28:24,211 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 143 [2020-07-10 20:28:24,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:28:24,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states. [2020-07-10 20:28:24,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:24,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2020-07-10 20:28:24,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:28:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2020-07-10 20:28:24,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=8048, Unknown=0, NotChecked=0, Total=11130 [2020-07-10 20:28:24,441 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 105 states. [2020-07-10 20:28:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:26,423 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2020-07-10 20:28:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2020-07-10 20:28:26,423 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 143 [2020-07-10 20:28:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:28:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-10 20:28:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2020-07-10 20:28:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-10 20:28:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2020-07-10 20:28:26,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states and 155 transitions. [2020-07-10 20:28:26,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:26,681 INFO L225 Difference]: With dead ends: 155 [2020-07-10 20:28:26,681 INFO L226 Difference]: Without dead ends: 150 [2020-07-10 20:28:26,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 6 SyntacticMatches, 34 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5420 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3082, Invalid=8048, Unknown=0, NotChecked=0, Total=11130 [2020-07-10 20:28:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-07-10 20:28:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2020-07-10 20:28:26,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:28:26,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2020-07-10 20:28:26,889 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2020-07-10 20:28:26,889 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2020-07-10 20:28:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:26,892 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2020-07-10 20:28:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2020-07-10 20:28:26,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:26,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:26,893 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2020-07-10 20:28:26,893 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2020-07-10 20:28:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:26,895 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2020-07-10 20:28:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2020-07-10 20:28:26,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:26,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:26,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:28:26,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:28:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-10 20:28:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2020-07-10 20:28:26,901 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 143 [2020-07-10 20:28:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:28:26,902 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2020-07-10 20:28:26,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 105 states. [2020-07-10 20:28:26,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 148 states and 148 transitions. [2020-07-10 20:28:27,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2020-07-10 20:28:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-10 20:28:27,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:28:27,139 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:28:27,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-07-10 20:28:27,139 INFO L427 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:28:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:28:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash -660869590, now seen corresponding path program 34 times [2020-07-10 20:28:27,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:28:27,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780683122] [2020-07-10 20:28:27,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:28:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:29,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {19446#true} assume true; {19446#true} is VALID [2020-07-10 20:28:29,300 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19446#true} {19446#true} #45#return; {19446#true} is VALID [2020-07-10 20:28:29,300 INFO L263 TraceCheckUtils]: 0: Hoare triple {19446#true} call ULTIMATE.init(); {19446#true} is VALID [2020-07-10 20:28:29,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {19446#true} assume true; {19446#true} is VALID [2020-07-10 20:28:29,300 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19446#true} {19446#true} #45#return; {19446#true} is VALID [2020-07-10 20:28:29,301 INFO L263 TraceCheckUtils]: 3: Hoare triple {19446#true} call #t~ret1 := main(); {19446#true} is VALID [2020-07-10 20:28:29,301 INFO L280 TraceCheckUtils]: 4: Hoare triple {19446#true} havoc ~i~0; {19446#true} is VALID [2020-07-10 20:28:29,302 INFO L280 TraceCheckUtils]: 5: Hoare triple {19446#true} ~i~0 := 0; {19450#(<= main_~i~0 0)} is VALID [2020-07-10 20:28:29,303 INFO L280 TraceCheckUtils]: 6: Hoare triple {19450#(<= main_~i~0 0)} [117] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_34 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_34 1))) (and (<= v_oct_main_~i~0_out_34 .cse0) (or (< 999999 v_oct_main_~i~0_in_34) (< 999998 v_oct_main_~i~0_in_34) (< 1000000 v_oct_main_~i~0_out_34) (< 1000001 v_oct_main_~i~0_out_34) (< v_oct_main_~i~0_out_34 .cse1)) (<= .cse0 v_oct_main_~i~0_out_34) (<= (* 2 v_oct_main_~i~0_in_34) 1999998))) (and (<= v_oct_main_~i~0_out_34 1000001) (<= v_oct_main_~i~0_in_34 999998) (<= v_oct_main_~i~0_out_34 1000000) (<= v_oct_main_~i~0_in_34 999999) (<= .cse1 v_oct_main_~i~0_out_34)))) InVars {main_~i~0=v_oct_main_~i~0_in_34} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_34|, main_~i~0=v_oct_main_~i~0_out_34} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {19451#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:28:29,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {19451#(<= main_~i~0 1000000)} [116] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {19452#(= main_~i~0 1000000)} is VALID [2020-07-10 20:28:29,305 INFO L263 TraceCheckUtils]: 8: Hoare triple {19452#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {19453#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:28:29,305 INFO L280 TraceCheckUtils]: 9: Hoare triple {19453#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {19454#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:28:29,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {19454#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {19447#false} is VALID [2020-07-10 20:28:29,306 INFO L280 TraceCheckUtils]: 11: Hoare triple {19447#false} assume !false; {19447#false} is VALID [2020-07-10 20:28:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:28:37,941 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:28:37,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780683122] [2020-07-10 20:28:37,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:28:37,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [108] imperfect sequences [] total 108 [2020-07-10 20:28:37,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526863068] [2020-07-10 20:28:37,943 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 147 [2020-07-10 20:28:37,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:28:37,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states. [2020-07-10 20:28:38,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:38,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2020-07-10 20:28:38,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:28:38,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2020-07-10 20:28:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3260, Invalid=8512, Unknown=0, NotChecked=0, Total=11772 [2020-07-10 20:28:38,195 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 108 states. [2020-07-10 20:28:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:40,258 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2020-07-10 20:28:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2020-07-10 20:28:40,258 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 147 [2020-07-10 20:28:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:28:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-10 20:28:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 159 transitions. [2020-07-10 20:28:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-10 20:28:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 159 transitions. [2020-07-10 20:28:40,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states and 159 transitions. [2020-07-10 20:28:40,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:40,526 INFO L225 Difference]: With dead ends: 159 [2020-07-10 20:28:40,526 INFO L226 Difference]: Without dead ends: 154 [2020-07-10 20:28:40,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 6 SyntacticMatches, 35 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5754 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3260, Invalid=8512, Unknown=0, NotChecked=0, Total=11772 [2020-07-10 20:28:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-07-10 20:28:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2020-07-10 20:28:40,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:28:40,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 152 states. [2020-07-10 20:28:40,704 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 152 states. [2020-07-10 20:28:40,704 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 152 states. [2020-07-10 20:28:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:40,707 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2020-07-10 20:28:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2020-07-10 20:28:40,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:40,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:40,707 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 154 states. [2020-07-10 20:28:40,707 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 154 states. [2020-07-10 20:28:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:40,710 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2020-07-10 20:28:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2020-07-10 20:28:40,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:40,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:40,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:28:40,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:28:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-10 20:28:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2020-07-10 20:28:40,712 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 147 [2020-07-10 20:28:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:28:40,712 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2020-07-10 20:28:40,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 108 states. [2020-07-10 20:28:40,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 152 states and 152 transitions. [2020-07-10 20:28:40,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2020-07-10 20:28:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-07-10 20:28:40,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:28:40,963 INFO L422 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:28:40,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-07-10 20:28:40,964 INFO L427 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:28:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:28:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash -511193817, now seen corresponding path program 35 times [2020-07-10 20:28:40,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:28:40,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [814044625] [2020-07-10 20:28:40,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:28:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:43,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {20489#true} assume true; {20489#true} is VALID [2020-07-10 20:28:43,109 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20489#true} {20489#true} #45#return; {20489#true} is VALID [2020-07-10 20:28:43,109 INFO L263 TraceCheckUtils]: 0: Hoare triple {20489#true} call ULTIMATE.init(); {20489#true} is VALID [2020-07-10 20:28:43,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {20489#true} assume true; {20489#true} is VALID [2020-07-10 20:28:43,110 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20489#true} {20489#true} #45#return; {20489#true} is VALID [2020-07-10 20:28:43,110 INFO L263 TraceCheckUtils]: 3: Hoare triple {20489#true} call #t~ret1 := main(); {20489#true} is VALID [2020-07-10 20:28:43,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {20489#true} havoc ~i~0; {20489#true} is VALID [2020-07-10 20:28:43,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {20489#true} ~i~0 := 0; {20493#(<= main_~i~0 0)} is VALID [2020-07-10 20:28:43,112 INFO L280 TraceCheckUtils]: 6: Hoare triple {20493#(<= main_~i~0 0)} [119] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_35 2))) (or (and (<= v_oct_main_~i~0_in_35 999999) (<= v_oct_main_~i~0_out_35 1000001) (<= v_oct_main_~i~0_in_35 999998) (<= v_oct_main_~i~0_out_35 1000000) (<= .cse0 v_oct_main_~i~0_out_35)) (let ((.cse1 (+ v_oct_main_~i~0_in_35 1))) (and (<= (* 2 v_oct_main_~i~0_in_35) 1999998) (<= .cse1 v_oct_main_~i~0_out_35) (or (< v_oct_main_~i~0_out_35 .cse0) (< 1000000 v_oct_main_~i~0_out_35) (< 999999 v_oct_main_~i~0_in_35) (< 1000001 v_oct_main_~i~0_out_35) (< 999998 v_oct_main_~i~0_in_35)) (<= v_oct_main_~i~0_out_35 .cse1))))) InVars {main_~i~0=v_oct_main_~i~0_in_35} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_35|, main_~i~0=v_oct_main_~i~0_out_35} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {20494#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:28:43,113 INFO L280 TraceCheckUtils]: 7: Hoare triple {20494#(<= main_~i~0 1000000)} [118] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {20495#(= main_~i~0 1000000)} is VALID [2020-07-10 20:28:43,114 INFO L263 TraceCheckUtils]: 8: Hoare triple {20495#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {20496#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:28:43,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {20496#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {20497#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:28:43,116 INFO L280 TraceCheckUtils]: 10: Hoare triple {20497#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {20490#false} is VALID [2020-07-10 20:28:43,116 INFO L280 TraceCheckUtils]: 11: Hoare triple {20490#false} assume !false; {20490#false} is VALID [2020-07-10 20:28:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:28:52,282 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:28:52,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [814044625] [2020-07-10 20:28:52,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:28:52,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [111] imperfect sequences [] total 111 [2020-07-10 20:28:52,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001159115] [2020-07-10 20:28:52,284 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 151 [2020-07-10 20:28:52,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:28:52,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 111 states. [2020-07-10 20:28:52,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:52,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2020-07-10 20:28:52,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:28:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2020-07-10 20:28:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3443, Invalid=8989, Unknown=0, NotChecked=0, Total=12432 [2020-07-10 20:28:52,538 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 111 states. [2020-07-10 20:28:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:54,673 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2020-07-10 20:28:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2020-07-10 20:28:54,673 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 151 [2020-07-10 20:28:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:28:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-07-10 20:28:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2020-07-10 20:28:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-07-10 20:28:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2020-07-10 20:28:54,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 163 transitions. [2020-07-10 20:28:54,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:54,954 INFO L225 Difference]: With dead ends: 163 [2020-07-10 20:28:54,954 INFO L226 Difference]: Without dead ends: 158 [2020-07-10 20:28:54,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 6 SyntacticMatches, 36 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3443, Invalid=8989, Unknown=0, NotChecked=0, Total=12432 [2020-07-10 20:28:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-10 20:28:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2020-07-10 20:28:55,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:28:55,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 156 states. [2020-07-10 20:28:55,132 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 156 states. [2020-07-10 20:28:55,132 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 156 states. [2020-07-10 20:28:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:55,134 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2020-07-10 20:28:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2020-07-10 20:28:55,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:55,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:55,136 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 158 states. [2020-07-10 20:28:55,136 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 158 states. [2020-07-10 20:28:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:28:55,138 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2020-07-10 20:28:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2020-07-10 20:28:55,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:28:55,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:28:55,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:28:55,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:28:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-10 20:28:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2020-07-10 20:28:55,140 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 151 [2020-07-10 20:28:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:28:55,141 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2020-07-10 20:28:55,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 111 states. [2020-07-10 20:28:55,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states and 156 transitions. [2020-07-10 20:28:55,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:28:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2020-07-10 20:28:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-07-10 20:28:55,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:28:55,404 INFO L422 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:28:55,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-07-10 20:28:55,404 INFO L427 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:28:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:28:55,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1019091548, now seen corresponding path program 36 times [2020-07-10 20:28:55,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:28:55,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981366474] [2020-07-10 20:28:55,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:28:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:28:57,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {21559#true} assume true; {21559#true} is VALID [2020-07-10 20:28:57,567 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21559#true} {21559#true} #45#return; {21559#true} is VALID [2020-07-10 20:28:57,568 INFO L263 TraceCheckUtils]: 0: Hoare triple {21559#true} call ULTIMATE.init(); {21559#true} is VALID [2020-07-10 20:28:57,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {21559#true} assume true; {21559#true} is VALID [2020-07-10 20:28:57,568 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21559#true} {21559#true} #45#return; {21559#true} is VALID [2020-07-10 20:28:57,568 INFO L263 TraceCheckUtils]: 3: Hoare triple {21559#true} call #t~ret1 := main(); {21559#true} is VALID [2020-07-10 20:28:57,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {21559#true} havoc ~i~0; {21559#true} is VALID [2020-07-10 20:28:57,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {21559#true} ~i~0 := 0; {21563#(<= main_~i~0 0)} is VALID [2020-07-10 20:28:57,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {21563#(<= main_~i~0 0)} [121] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_36 2))) (or (and (<= v_oct_main_~i~0_out_36 1000000) (<= v_oct_main_~i~0_out_36 1000001) (<= .cse0 v_oct_main_~i~0_out_36) (<= v_oct_main_~i~0_in_36 999998) (<= v_oct_main_~i~0_in_36 999999)) (let ((.cse1 (+ v_oct_main_~i~0_in_36 1))) (and (or (< 999998 v_oct_main_~i~0_in_36) (< 1000000 v_oct_main_~i~0_out_36) (< 999999 v_oct_main_~i~0_in_36) (< v_oct_main_~i~0_out_36 .cse0) (< 1000001 v_oct_main_~i~0_out_36)) (<= v_oct_main_~i~0_out_36 .cse1) (<= (* 2 v_oct_main_~i~0_in_36) 1999998) (<= .cse1 v_oct_main_~i~0_out_36))))) InVars {main_~i~0=v_oct_main_~i~0_in_36} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_36|, main_~i~0=v_oct_main_~i~0_out_36} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {21564#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:28:57,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {21564#(<= main_~i~0 1000000)} [120] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {21565#(= main_~i~0 1000000)} is VALID [2020-07-10 20:28:57,582 INFO L263 TraceCheckUtils]: 8: Hoare triple {21565#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {21566#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:28:57,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {21566#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {21567#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:28:57,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {21567#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {21560#false} is VALID [2020-07-10 20:28:57,583 INFO L280 TraceCheckUtils]: 11: Hoare triple {21560#false} assume !false; {21560#false} is VALID [2020-07-10 20:28:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:29:07,458 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:29:07,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981366474] [2020-07-10 20:29:07,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:29:07,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [114] imperfect sequences [] total 114 [2020-07-10 20:29:07,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519871790] [2020-07-10 20:29:07,460 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 155 [2020-07-10 20:29:07,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:29:07,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 114 states. [2020-07-10 20:29:07,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:07,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2020-07-10 20:29:07,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:29:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2020-07-10 20:29:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3631, Invalid=9479, Unknown=0, NotChecked=0, Total=13110 [2020-07-10 20:29:07,731 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 114 states. [2020-07-10 20:29:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:10,016 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2020-07-10 20:29:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2020-07-10 20:29:10,016 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 155 [2020-07-10 20:29:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:29:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-10 20:29:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2020-07-10 20:29:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-10 20:29:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2020-07-10 20:29:10,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 111 states and 167 transitions. [2020-07-10 20:29:10,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:10,309 INFO L225 Difference]: With dead ends: 167 [2020-07-10 20:29:10,309 INFO L226 Difference]: Without dead ends: 162 [2020-07-10 20:29:10,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 6 SyntacticMatches, 37 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6452 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=3631, Invalid=9479, Unknown=0, NotChecked=0, Total=13110 [2020-07-10 20:29:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-10 20:29:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2020-07-10 20:29:10,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:29:10,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2020-07-10 20:29:10,500 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2020-07-10 20:29:10,500 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2020-07-10 20:29:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:10,502 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2020-07-10 20:29:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2020-07-10 20:29:10,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:29:10,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:29:10,503 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2020-07-10 20:29:10,503 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2020-07-10 20:29:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:10,505 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2020-07-10 20:29:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2020-07-10 20:29:10,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:29:10,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:29:10,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:29:10,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:29:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-10 20:29:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2020-07-10 20:29:10,508 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 155 [2020-07-10 20:29:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:29:10,509 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2020-07-10 20:29:10,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 114 states. [2020-07-10 20:29:10,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 160 states and 160 transitions. [2020-07-10 20:29:10,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2020-07-10 20:29:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-07-10 20:29:10,788 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:29:10,788 INFO L422 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:29:10,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-07-10 20:29:10,788 INFO L427 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:29:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:29:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1861126239, now seen corresponding path program 37 times [2020-07-10 20:29:10,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:29:10,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269654346] [2020-07-10 20:29:10,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:29:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:29:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:29:12,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {22656#true} assume true; {22656#true} is VALID [2020-07-10 20:29:12,949 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22656#true} {22656#true} #45#return; {22656#true} is VALID [2020-07-10 20:29:12,949 INFO L263 TraceCheckUtils]: 0: Hoare triple {22656#true} call ULTIMATE.init(); {22656#true} is VALID [2020-07-10 20:29:12,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {22656#true} assume true; {22656#true} is VALID [2020-07-10 20:29:12,949 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22656#true} {22656#true} #45#return; {22656#true} is VALID [2020-07-10 20:29:12,949 INFO L263 TraceCheckUtils]: 3: Hoare triple {22656#true} call #t~ret1 := main(); {22656#true} is VALID [2020-07-10 20:29:12,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {22656#true} havoc ~i~0; {22656#true} is VALID [2020-07-10 20:29:12,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {22656#true} ~i~0 := 0; {22660#(<= main_~i~0 0)} is VALID [2020-07-10 20:29:12,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {22660#(<= main_~i~0 0)} [123] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_37 2))) (or (and (<= v_oct_main_~i~0_in_37 999998) (<= v_oct_main_~i~0_out_37 1000001) (<= v_oct_main_~i~0_out_37 1000000) (<= .cse0 v_oct_main_~i~0_out_37) (<= v_oct_main_~i~0_in_37 999999)) (let ((.cse1 (+ v_oct_main_~i~0_in_37 1))) (and (<= .cse1 v_oct_main_~i~0_out_37) (<= v_oct_main_~i~0_out_37 .cse1) (<= (* 2 v_oct_main_~i~0_in_37) 1999998) (or (< 999999 v_oct_main_~i~0_in_37) (< 1000000 v_oct_main_~i~0_out_37) (< 1000001 v_oct_main_~i~0_out_37) (< 999998 v_oct_main_~i~0_in_37) (< v_oct_main_~i~0_out_37 .cse0)))))) InVars {main_~i~0=v_oct_main_~i~0_in_37} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_37|, main_~i~0=v_oct_main_~i~0_out_37} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {22661#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:29:12,952 INFO L280 TraceCheckUtils]: 7: Hoare triple {22661#(<= main_~i~0 1000000)} [122] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {22662#(= main_~i~0 1000000)} is VALID [2020-07-10 20:29:12,953 INFO L263 TraceCheckUtils]: 8: Hoare triple {22662#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {22663#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:29:12,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {22663#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {22664#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:29:12,954 INFO L280 TraceCheckUtils]: 10: Hoare triple {22664#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {22657#false} is VALID [2020-07-10 20:29:12,954 INFO L280 TraceCheckUtils]: 11: Hoare triple {22657#false} assume !false; {22657#false} is VALID [2020-07-10 20:29:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:29:23,577 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:29:23,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269654346] [2020-07-10 20:29:23,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:29:23,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [117] imperfect sequences [] total 117 [2020-07-10 20:29:23,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137262822] [2020-07-10 20:29:23,579 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 159 [2020-07-10 20:29:23,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:29:23,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states. [2020-07-10 20:29:23,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:23,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2020-07-10 20:29:23,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:29:23,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2020-07-10 20:29:23,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3824, Invalid=9982, Unknown=0, NotChecked=0, Total=13806 [2020-07-10 20:29:23,871 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 117 states. [2020-07-10 20:29:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:26,282 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2020-07-10 20:29:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2020-07-10 20:29:26,282 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 159 [2020-07-10 20:29:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:29:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-10 20:29:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2020-07-10 20:29:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-10 20:29:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2020-07-10 20:29:26,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 114 states and 171 transitions. [2020-07-10 20:29:26,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:26,593 INFO L225 Difference]: With dead ends: 171 [2020-07-10 20:29:26,593 INFO L226 Difference]: Without dead ends: 166 [2020-07-10 20:29:26,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 6 SyntacticMatches, 38 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3824, Invalid=9982, Unknown=0, NotChecked=0, Total=13806 [2020-07-10 20:29:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-10 20:29:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2020-07-10 20:29:26,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:29:26,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2020-07-10 20:29:26,782 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2020-07-10 20:29:26,782 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2020-07-10 20:29:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:26,784 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2020-07-10 20:29:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2020-07-10 20:29:26,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:29:26,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:29:26,785 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2020-07-10 20:29:26,785 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2020-07-10 20:29:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:26,788 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2020-07-10 20:29:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2020-07-10 20:29:26,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:29:26,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:29:26,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:29:26,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:29:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-10 20:29:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2020-07-10 20:29:26,791 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 159 [2020-07-10 20:29:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:29:26,791 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2020-07-10 20:29:26,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 117 states. [2020-07-10 20:29:26,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 164 transitions. [2020-07-10 20:29:27,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2020-07-10 20:29:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-07-10 20:29:27,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:29:27,087 INFO L422 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:29:27,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-07-10 20:29:27,087 INFO L427 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:29:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:29:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash -392314082, now seen corresponding path program 38 times [2020-07-10 20:29:27,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:29:27,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1634661790] [2020-07-10 20:29:27,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:29:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:29:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:29:29,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {23780#true} assume true; {23780#true} is VALID [2020-07-10 20:29:29,258 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23780#true} {23780#true} #45#return; {23780#true} is VALID [2020-07-10 20:29:29,259 INFO L263 TraceCheckUtils]: 0: Hoare triple {23780#true} call ULTIMATE.init(); {23780#true} is VALID [2020-07-10 20:29:29,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {23780#true} assume true; {23780#true} is VALID [2020-07-10 20:29:29,259 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23780#true} {23780#true} #45#return; {23780#true} is VALID [2020-07-10 20:29:29,259 INFO L263 TraceCheckUtils]: 3: Hoare triple {23780#true} call #t~ret1 := main(); {23780#true} is VALID [2020-07-10 20:29:29,259 INFO L280 TraceCheckUtils]: 4: Hoare triple {23780#true} havoc ~i~0; {23780#true} is VALID [2020-07-10 20:29:29,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {23780#true} ~i~0 := 0; {23784#(<= main_~i~0 0)} is VALID [2020-07-10 20:29:29,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {23784#(<= main_~i~0 0)} [125] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_38 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_38 1))) (and (<= (* 2 v_oct_main_~i~0_in_38) 1999998) (<= .cse0 v_oct_main_~i~0_out_38) (<= v_oct_main_~i~0_out_38 .cse0) (or (< 1000000 v_oct_main_~i~0_out_38) (< 999999 v_oct_main_~i~0_in_38) (< 999998 v_oct_main_~i~0_in_38) (< v_oct_main_~i~0_out_38 .cse1) (< 1000001 v_oct_main_~i~0_out_38)))) (and (<= v_oct_main_~i~0_out_38 1000001) (<= v_oct_main_~i~0_in_38 999998) (<= v_oct_main_~i~0_out_38 1000000) (<= v_oct_main_~i~0_in_38 999999) (<= .cse1 v_oct_main_~i~0_out_38)))) InVars {main_~i~0=v_oct_main_~i~0_in_38} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_38|, main_~i~0=v_oct_main_~i~0_out_38} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {23785#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:29:29,262 INFO L280 TraceCheckUtils]: 7: Hoare triple {23785#(<= main_~i~0 1000000)} [124] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {23786#(= main_~i~0 1000000)} is VALID [2020-07-10 20:29:29,263 INFO L263 TraceCheckUtils]: 8: Hoare triple {23786#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {23787#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:29:29,263 INFO L280 TraceCheckUtils]: 9: Hoare triple {23787#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {23788#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:29:29,264 INFO L280 TraceCheckUtils]: 10: Hoare triple {23788#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {23781#false} is VALID [2020-07-10 20:29:29,264 INFO L280 TraceCheckUtils]: 11: Hoare triple {23781#false} assume !false; {23781#false} is VALID [2020-07-10 20:29:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:29:40,722 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:29:40,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1634661790] [2020-07-10 20:29:40,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:29:40,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [120] imperfect sequences [] total 120 [2020-07-10 20:29:40,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286958648] [2020-07-10 20:29:40,723 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 163 [2020-07-10 20:29:40,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:29:40,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states. [2020-07-10 20:29:41,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:41,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2020-07-10 20:29:41,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:29:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2020-07-10 20:29:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4022, Invalid=10498, Unknown=0, NotChecked=0, Total=14520 [2020-07-10 20:29:41,027 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 120 states. [2020-07-10 20:29:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:43,339 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2020-07-10 20:29:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2020-07-10 20:29:43,339 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 163 [2020-07-10 20:29:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:29:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-10 20:29:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2020-07-10 20:29:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-10 20:29:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2020-07-10 20:29:43,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 175 transitions. [2020-07-10 20:29:43,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:43,676 INFO L225 Difference]: With dead ends: 175 [2020-07-10 20:29:43,676 INFO L226 Difference]: Without dead ends: 170 [2020-07-10 20:29:43,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 6 SyntacticMatches, 39 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7190 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=4022, Invalid=10498, Unknown=0, NotChecked=0, Total=14520 [2020-07-10 20:29:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-07-10 20:29:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2020-07-10 20:29:43,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:29:43,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 168 states. [2020-07-10 20:29:43,896 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 168 states. [2020-07-10 20:29:43,897 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 168 states. [2020-07-10 20:29:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:43,899 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2020-07-10 20:29:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2020-07-10 20:29:43,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:29:43,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:29:43,899 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 170 states. [2020-07-10 20:29:43,899 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 170 states. [2020-07-10 20:29:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:29:43,901 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2020-07-10 20:29:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2020-07-10 20:29:43,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:29:43,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:29:43,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:29:43,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:29:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-07-10 20:29:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2020-07-10 20:29:43,904 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 163 [2020-07-10 20:29:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:29:43,904 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2020-07-10 20:29:43,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 120 states. [2020-07-10 20:29:43,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 168 states and 168 transitions. [2020-07-10 20:29:44,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2020-07-10 20:29:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-07-10 20:29:44,210 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:29:44,210 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:29:44,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-07-10 20:29:44,210 INFO L427 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:29:44,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:29:44,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1041364965, now seen corresponding path program 39 times [2020-07-10 20:29:44,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:29:44,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1859688902] [2020-07-10 20:29:44,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:29:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:29:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:29:46,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {24931#true} assume true; {24931#true} is VALID [2020-07-10 20:29:46,389 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24931#true} {24931#true} #45#return; {24931#true} is VALID [2020-07-10 20:29:46,389 INFO L263 TraceCheckUtils]: 0: Hoare triple {24931#true} call ULTIMATE.init(); {24931#true} is VALID [2020-07-10 20:29:46,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {24931#true} assume true; {24931#true} is VALID [2020-07-10 20:29:46,390 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24931#true} {24931#true} #45#return; {24931#true} is VALID [2020-07-10 20:29:46,390 INFO L263 TraceCheckUtils]: 3: Hoare triple {24931#true} call #t~ret1 := main(); {24931#true} is VALID [2020-07-10 20:29:46,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {24931#true} havoc ~i~0; {24931#true} is VALID [2020-07-10 20:29:46,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {24931#true} ~i~0 := 0; {24935#(<= main_~i~0 0)} is VALID [2020-07-10 20:29:46,392 INFO L280 TraceCheckUtils]: 6: Hoare triple {24935#(<= main_~i~0 0)} [127] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_39 2))) (or (and (<= v_oct_main_~i~0_out_39 1000001) (<= .cse0 v_oct_main_~i~0_out_39) (<= v_oct_main_~i~0_out_39 1000000) (<= v_oct_main_~i~0_in_39 999999) (<= v_oct_main_~i~0_in_39 999998)) (let ((.cse1 (+ v_oct_main_~i~0_in_39 1))) (and (<= (* 2 v_oct_main_~i~0_in_39) 1999998) (<= .cse1 v_oct_main_~i~0_out_39) (<= v_oct_main_~i~0_out_39 .cse1) (or (< 999999 v_oct_main_~i~0_in_39) (< 1000000 v_oct_main_~i~0_out_39) (< 999998 v_oct_main_~i~0_in_39) (< v_oct_main_~i~0_out_39 .cse0) (< 1000001 v_oct_main_~i~0_out_39)))))) InVars {main_~i~0=v_oct_main_~i~0_in_39} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_39|, main_~i~0=v_oct_main_~i~0_out_39} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {24936#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:29:46,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {24936#(<= main_~i~0 1000000)} [126] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {24937#(= main_~i~0 1000000)} is VALID [2020-07-10 20:29:46,393 INFO L263 TraceCheckUtils]: 8: Hoare triple {24937#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {24938#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:29:46,394 INFO L280 TraceCheckUtils]: 9: Hoare triple {24938#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {24939#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:29:46,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {24939#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {24932#false} is VALID [2020-07-10 20:29:46,395 INFO L280 TraceCheckUtils]: 11: Hoare triple {24932#false} assume !false; {24932#false} is VALID [2020-07-10 20:29:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:29:58,733 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:29:58,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1859688902] [2020-07-10 20:29:58,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:29:58,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [123] imperfect sequences [] total 123 [2020-07-10 20:29:58,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098109189] [2020-07-10 20:29:58,734 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 167 [2020-07-10 20:29:58,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:29:58,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states. [2020-07-10 20:29:59,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:29:59,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2020-07-10 20:29:59,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:29:59,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2020-07-10 20:29:59,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4225, Invalid=11027, Unknown=0, NotChecked=0, Total=15252 [2020-07-10 20:29:59,058 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 123 states. [2020-07-10 20:30:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:01,856 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2020-07-10 20:30:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2020-07-10 20:30:01,857 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 167 [2020-07-10 20:30:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:30:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-10 20:30:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2020-07-10 20:30:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-10 20:30:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2020-07-10 20:30:01,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 179 transitions. [2020-07-10 20:30:02,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:30:02,225 INFO L225 Difference]: With dead ends: 179 [2020-07-10 20:30:02,226 INFO L226 Difference]: Without dead ends: 174 [2020-07-10 20:30:02,227 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 6 SyntacticMatches, 40 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7574 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=4225, Invalid=11027, Unknown=0, NotChecked=0, Total=15252 [2020-07-10 20:30:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-07-10 20:30:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2020-07-10 20:30:02,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:30:02,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 172 states. [2020-07-10 20:30:02,451 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 172 states. [2020-07-10 20:30:02,452 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 172 states. [2020-07-10 20:30:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:02,455 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2020-07-10 20:30:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2020-07-10 20:30:02,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:30:02,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:30:02,455 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 174 states. [2020-07-10 20:30:02,456 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 174 states. [2020-07-10 20:30:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:02,458 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2020-07-10 20:30:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2020-07-10 20:30:02,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:30:02,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:30:02,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:30:02,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:30:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-07-10 20:30:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2020-07-10 20:30:02,462 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 167 [2020-07-10 20:30:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:30:02,462 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2020-07-10 20:30:02,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 123 states. [2020-07-10 20:30:02,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 172 states and 172 transitions. [2020-07-10 20:30:02,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:30:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2020-07-10 20:30:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-07-10 20:30:02,831 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:30:02,832 INFO L422 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:30:02,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-07-10 20:30:02,832 INFO L427 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:30:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:30:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1063880344, now seen corresponding path program 40 times [2020-07-10 20:30:02,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:30:02,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59481055] [2020-07-10 20:30:02,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:30:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:30:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:30:05,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {26109#true} assume true; {26109#true} is VALID [2020-07-10 20:30:05,044 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26109#true} {26109#true} #45#return; {26109#true} is VALID [2020-07-10 20:30:05,044 INFO L263 TraceCheckUtils]: 0: Hoare triple {26109#true} call ULTIMATE.init(); {26109#true} is VALID [2020-07-10 20:30:05,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {26109#true} assume true; {26109#true} is VALID [2020-07-10 20:30:05,045 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26109#true} {26109#true} #45#return; {26109#true} is VALID [2020-07-10 20:30:05,045 INFO L263 TraceCheckUtils]: 3: Hoare triple {26109#true} call #t~ret1 := main(); {26109#true} is VALID [2020-07-10 20:30:05,045 INFO L280 TraceCheckUtils]: 4: Hoare triple {26109#true} havoc ~i~0; {26109#true} is VALID [2020-07-10 20:30:05,046 INFO L280 TraceCheckUtils]: 5: Hoare triple {26109#true} ~i~0 := 0; {26113#(<= main_~i~0 0)} is VALID [2020-07-10 20:30:05,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {26113#(<= main_~i~0 0)} [129] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_40 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_40 1))) (and (or (< 1000001 v_oct_main_~i~0_out_40) (< 999998 v_oct_main_~i~0_in_40) (< v_oct_main_~i~0_out_40 .cse0) (< 1000000 v_oct_main_~i~0_out_40) (< 999999 v_oct_main_~i~0_in_40)) (<= .cse1 v_oct_main_~i~0_out_40) (<= (* 2 v_oct_main_~i~0_in_40) 1999998) (<= v_oct_main_~i~0_out_40 .cse1))) (and (<= v_oct_main_~i~0_in_40 999999) (<= v_oct_main_~i~0_out_40 1000001) (<= .cse0 v_oct_main_~i~0_out_40) (<= v_oct_main_~i~0_in_40 999998) (<= v_oct_main_~i~0_out_40 1000000)))) InVars {main_~i~0=v_oct_main_~i~0_in_40} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_40|, main_~i~0=v_oct_main_~i~0_out_40} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {26114#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:30:05,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {26114#(<= main_~i~0 1000000)} [128] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {26115#(= main_~i~0 1000000)} is VALID [2020-07-10 20:30:05,051 INFO L263 TraceCheckUtils]: 8: Hoare triple {26115#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {26116#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:30:05,052 INFO L280 TraceCheckUtils]: 9: Hoare triple {26116#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {26117#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:30:05,053 INFO L280 TraceCheckUtils]: 10: Hoare triple {26117#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {26110#false} is VALID [2020-07-10 20:30:05,054 INFO L280 TraceCheckUtils]: 11: Hoare triple {26110#false} assume !false; {26110#false} is VALID [2020-07-10 20:30:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:30:19,085 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:30:19,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59481055] [2020-07-10 20:30:19,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:30:19,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [126] imperfect sequences [] total 126 [2020-07-10 20:30:19,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073275291] [2020-07-10 20:30:19,087 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 171 [2020-07-10 20:30:19,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:30:19,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states. [2020-07-10 20:30:19,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:30:19,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2020-07-10 20:30:19,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:30:19,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2020-07-10 20:30:19,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4433, Invalid=11569, Unknown=0, NotChecked=0, Total=16002 [2020-07-10 20:30:19,440 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 126 states. [2020-07-10 20:30:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:22,392 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2020-07-10 20:30:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2020-07-10 20:30:22,393 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 171 [2020-07-10 20:30:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:30:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-10 20:30:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2020-07-10 20:30:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-10 20:30:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2020-07-10 20:30:22,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states and 183 transitions. [2020-07-10 20:30:22,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:30:22,778 INFO L225 Difference]: With dead ends: 183 [2020-07-10 20:30:22,778 INFO L226 Difference]: Without dead ends: 178 [2020-07-10 20:30:22,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 6 SyntacticMatches, 41 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7968 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=4433, Invalid=11569, Unknown=0, NotChecked=0, Total=16002 [2020-07-10 20:30:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-10 20:30:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2020-07-10 20:30:23,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:30:23,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 176 states. [2020-07-10 20:30:23,024 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 176 states. [2020-07-10 20:30:23,024 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 176 states. [2020-07-10 20:30:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:23,027 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2020-07-10 20:30:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2020-07-10 20:30:23,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:30:23,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:30:23,027 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 178 states. [2020-07-10 20:30:23,027 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 178 states. [2020-07-10 20:30:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:23,029 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2020-07-10 20:30:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2020-07-10 20:30:23,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:30:23,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:30:23,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:30:23,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:30:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-10 20:30:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2020-07-10 20:30:23,036 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 171 [2020-07-10 20:30:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:30:23,036 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2020-07-10 20:30:23,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 126 states. [2020-07-10 20:30:23,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 176 states and 176 transitions. [2020-07-10 20:30:23,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:30:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2020-07-10 20:30:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-10 20:30:23,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:30:23,382 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:30:23,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-07-10 20:30:23,382 INFO L427 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:30:23,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:30:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2111274645, now seen corresponding path program 41 times [2020-07-10 20:30:23,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:30:23,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [22814148] [2020-07-10 20:30:23,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:30:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:30:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:30:25,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {27314#true} assume true; {27314#true} is VALID [2020-07-10 20:30:25,600 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27314#true} {27314#true} #45#return; {27314#true} is VALID [2020-07-10 20:30:25,600 INFO L263 TraceCheckUtils]: 0: Hoare triple {27314#true} call ULTIMATE.init(); {27314#true} is VALID [2020-07-10 20:30:25,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {27314#true} assume true; {27314#true} is VALID [2020-07-10 20:30:25,600 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27314#true} {27314#true} #45#return; {27314#true} is VALID [2020-07-10 20:30:25,600 INFO L263 TraceCheckUtils]: 3: Hoare triple {27314#true} call #t~ret1 := main(); {27314#true} is VALID [2020-07-10 20:30:25,601 INFO L280 TraceCheckUtils]: 4: Hoare triple {27314#true} havoc ~i~0; {27314#true} is VALID [2020-07-10 20:30:25,602 INFO L280 TraceCheckUtils]: 5: Hoare triple {27314#true} ~i~0 := 0; {27318#(<= main_~i~0 0)} is VALID [2020-07-10 20:30:25,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {27318#(<= main_~i~0 0)} [131] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_41 2))) (or (and (<= v_oct_main_~i~0_in_41 999999) (<= v_oct_main_~i~0_in_41 999998) (<= .cse0 v_oct_main_~i~0_out_41) (<= v_oct_main_~i~0_out_41 1000001) (<= v_oct_main_~i~0_out_41 1000000)) (let ((.cse1 (+ v_oct_main_~i~0_in_41 1))) (and (<= v_oct_main_~i~0_out_41 .cse1) (or (< 1000001 v_oct_main_~i~0_out_41) (< v_oct_main_~i~0_out_41 .cse0) (< 999998 v_oct_main_~i~0_in_41) (< 1000000 v_oct_main_~i~0_out_41) (< 999999 v_oct_main_~i~0_in_41)) (<= (* 2 v_oct_main_~i~0_in_41) 1999998) (<= .cse1 v_oct_main_~i~0_out_41))))) InVars {main_~i~0=v_oct_main_~i~0_in_41} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_41|, main_~i~0=v_oct_main_~i~0_out_41} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {27319#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:30:25,605 INFO L280 TraceCheckUtils]: 7: Hoare triple {27319#(<= main_~i~0 1000000)} [130] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {27320#(= main_~i~0 1000000)} is VALID [2020-07-10 20:30:25,606 INFO L263 TraceCheckUtils]: 8: Hoare triple {27320#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {27321#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:30:25,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {27321#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {27322#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:30:25,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {27322#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {27315#false} is VALID [2020-07-10 20:30:25,608 INFO L280 TraceCheckUtils]: 11: Hoare triple {27315#false} assume !false; {27315#false} is VALID [2020-07-10 20:30:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:30:40,335 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:30:40,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [22814148] [2020-07-10 20:30:40,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:30:40,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [129] imperfect sequences [] total 129 [2020-07-10 20:30:40,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015191054] [2020-07-10 20:30:40,337 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 175 [2020-07-10 20:30:40,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:30:40,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 129 states. [2020-07-10 20:30:40,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:30:40,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2020-07-10 20:30:40,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:30:40,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2020-07-10 20:30:40,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4646, Invalid=12124, Unknown=0, NotChecked=0, Total=16770 [2020-07-10 20:30:40,715 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 129 states. [2020-07-10 20:30:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:42,875 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2020-07-10 20:30:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2020-07-10 20:30:42,875 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 175 [2020-07-10 20:30:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:30:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-07-10 20:30:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2020-07-10 20:30:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-07-10 20:30:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2020-07-10 20:30:42,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 187 transitions. [2020-07-10 20:30:43,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:30:43,284 INFO L225 Difference]: With dead ends: 187 [2020-07-10 20:30:43,285 INFO L226 Difference]: Without dead ends: 182 [2020-07-10 20:30:43,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 6 SyntacticMatches, 42 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=4646, Invalid=12124, Unknown=0, NotChecked=0, Total=16770 [2020-07-10 20:30:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-07-10 20:30:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2020-07-10 20:30:43,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:30:43,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 180 states. [2020-07-10 20:30:43,541 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 180 states. [2020-07-10 20:30:43,541 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 180 states. [2020-07-10 20:30:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:43,543 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2020-07-10 20:30:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2020-07-10 20:30:43,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:30:43,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:30:43,544 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 182 states. [2020-07-10 20:30:43,544 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 182 states. [2020-07-10 20:30:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:30:43,546 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2020-07-10 20:30:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2020-07-10 20:30:43,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:30:43,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:30:43,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:30:43,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:30:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-07-10 20:30:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2020-07-10 20:30:43,549 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 175 [2020-07-10 20:30:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:30:43,549 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2020-07-10 20:30:43,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 129 states. [2020-07-10 20:30:43,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 180 states and 180 transitions. [2020-07-10 20:30:43,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:30:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2020-07-10 20:30:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-07-10 20:30:43,908 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:30:43,909 INFO L422 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:30:43,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-07-10 20:30:43,909 INFO L427 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:30:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:30:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1683959826, now seen corresponding path program 42 times [2020-07-10 20:30:43,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:30:43,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1422502555] [2020-07-10 20:30:43,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:30:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:30:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:30:46,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {28546#true} assume true; {28546#true} is VALID [2020-07-10 20:30:46,107 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28546#true} {28546#true} #45#return; {28546#true} is VALID [2020-07-10 20:30:46,108 INFO L263 TraceCheckUtils]: 0: Hoare triple {28546#true} call ULTIMATE.init(); {28546#true} is VALID [2020-07-10 20:30:46,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {28546#true} assume true; {28546#true} is VALID [2020-07-10 20:30:46,108 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28546#true} {28546#true} #45#return; {28546#true} is VALID [2020-07-10 20:30:46,108 INFO L263 TraceCheckUtils]: 3: Hoare triple {28546#true} call #t~ret1 := main(); {28546#true} is VALID [2020-07-10 20:30:46,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {28546#true} havoc ~i~0; {28546#true} is VALID [2020-07-10 20:30:46,109 INFO L280 TraceCheckUtils]: 5: Hoare triple {28546#true} ~i~0 := 0; {28550#(<= main_~i~0 0)} is VALID [2020-07-10 20:30:46,110 INFO L280 TraceCheckUtils]: 6: Hoare triple {28550#(<= main_~i~0 0)} [133] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_42 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_42 1))) (and (<= v_oct_main_~i~0_out_42 .cse0) (<= (* 2 v_oct_main_~i~0_in_42) 1999998) (<= .cse0 v_oct_main_~i~0_out_42) (or (< v_oct_main_~i~0_out_42 .cse1) (< 1000000 v_oct_main_~i~0_out_42) (< 999999 v_oct_main_~i~0_in_42) (< 999998 v_oct_main_~i~0_in_42) (< 1000001 v_oct_main_~i~0_out_42)))) (and (<= v_oct_main_~i~0_out_42 1000000) (<= .cse1 v_oct_main_~i~0_out_42) (<= v_oct_main_~i~0_in_42 999998) (<= v_oct_main_~i~0_in_42 999999) (<= v_oct_main_~i~0_out_42 1000001)))) InVars {main_~i~0=v_oct_main_~i~0_in_42} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_42|, main_~i~0=v_oct_main_~i~0_out_42} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {28551#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:30:46,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {28551#(<= main_~i~0 1000000)} [132] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {28552#(= main_~i~0 1000000)} is VALID [2020-07-10 20:30:46,112 INFO L263 TraceCheckUtils]: 8: Hoare triple {28552#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {28553#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:30:46,113 INFO L280 TraceCheckUtils]: 9: Hoare triple {28553#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {28554#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:30:46,114 INFO L280 TraceCheckUtils]: 10: Hoare triple {28554#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {28547#false} is VALID [2020-07-10 20:30:46,114 INFO L280 TraceCheckUtils]: 11: Hoare triple {28547#false} assume !false; {28547#false} is VALID [2020-07-10 20:30:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:31:02,243 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:31:02,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1422502555] [2020-07-10 20:31:02,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:31:02,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [132] imperfect sequences [] total 132 [2020-07-10 20:31:02,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138612409] [2020-07-10 20:31:02,245 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 179 [2020-07-10 20:31:02,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:31:02,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 132 states. [2020-07-10 20:31:02,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:02,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2020-07-10 20:31:02,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:31:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2020-07-10 20:31:02,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4864, Invalid=12692, Unknown=0, NotChecked=0, Total=17556 [2020-07-10 20:31:02,637 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 132 states. [2020-07-10 20:31:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:04,193 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2020-07-10 20:31:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2020-07-10 20:31:04,193 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 179 [2020-07-10 20:31:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:31:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-10 20:31:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2020-07-10 20:31:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-10 20:31:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2020-07-10 20:31:04,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 129 states and 191 transitions. [2020-07-10 20:31:04,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:04,617 INFO L225 Difference]: With dead ends: 191 [2020-07-10 20:31:04,617 INFO L226 Difference]: Without dead ends: 186 [2020-07-10 20:31:04,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 6 SyntacticMatches, 43 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8786 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=4864, Invalid=12692, Unknown=0, NotChecked=0, Total=17556 [2020-07-10 20:31:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-10 20:31:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2020-07-10 20:31:04,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:31:04,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 184 states. [2020-07-10 20:31:04,895 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 184 states. [2020-07-10 20:31:04,895 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 184 states. [2020-07-10 20:31:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:04,899 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2020-07-10 20:31:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2020-07-10 20:31:04,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:31:04,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:31:04,900 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 186 states. [2020-07-10 20:31:04,900 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 186 states. [2020-07-10 20:31:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:04,903 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2020-07-10 20:31:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2020-07-10 20:31:04,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:31:04,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:31:04,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:31:04,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:31:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-10 20:31:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2020-07-10 20:31:04,905 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 179 [2020-07-10 20:31:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:31:04,906 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2020-07-10 20:31:04,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 132 states. [2020-07-10 20:31:04,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 184 states and 184 transitions. [2020-07-10 20:31:05,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2020-07-10 20:31:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-07-10 20:31:05,281 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:31:05,281 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:31:05,282 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-07-10 20:31:05,282 INFO L427 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:31:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:31:05,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1955060495, now seen corresponding path program 43 times [2020-07-10 20:31:05,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:31:05,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584154904] [2020-07-10 20:31:05,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:31:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:31:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:31:07,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {29805#true} assume true; {29805#true} is VALID [2020-07-10 20:31:07,500 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29805#true} {29805#true} #45#return; {29805#true} is VALID [2020-07-10 20:31:07,500 INFO L263 TraceCheckUtils]: 0: Hoare triple {29805#true} call ULTIMATE.init(); {29805#true} is VALID [2020-07-10 20:31:07,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {29805#true} assume true; {29805#true} is VALID [2020-07-10 20:31:07,500 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29805#true} {29805#true} #45#return; {29805#true} is VALID [2020-07-10 20:31:07,500 INFO L263 TraceCheckUtils]: 3: Hoare triple {29805#true} call #t~ret1 := main(); {29805#true} is VALID [2020-07-10 20:31:07,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {29805#true} havoc ~i~0; {29805#true} is VALID [2020-07-10 20:31:07,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {29805#true} ~i~0 := 0; {29809#(<= main_~i~0 0)} is VALID [2020-07-10 20:31:07,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {29809#(<= main_~i~0 0)} [135] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_43 2))) (or (and (<= .cse0 v_oct_main_~i~0_out_43) (<= v_oct_main_~i~0_in_43 999999) (<= v_oct_main_~i~0_out_43 1000000) (<= v_oct_main_~i~0_in_43 999998) (<= v_oct_main_~i~0_out_43 1000001)) (let ((.cse1 (+ v_oct_main_~i~0_in_43 1))) (and (<= .cse1 v_oct_main_~i~0_out_43) (<= (* 2 v_oct_main_~i~0_in_43) 1999998) (<= v_oct_main_~i~0_out_43 .cse1) (or (< 1000000 v_oct_main_~i~0_out_43) (< 999999 v_oct_main_~i~0_in_43) (< 1000001 v_oct_main_~i~0_out_43) (< v_oct_main_~i~0_out_43 .cse0) (< 999998 v_oct_main_~i~0_in_43)))))) InVars {main_~i~0=v_oct_main_~i~0_in_43} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_43|, main_~i~0=v_oct_main_~i~0_out_43} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {29810#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:31:07,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {29810#(<= main_~i~0 1000000)} [134] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {29811#(= main_~i~0 1000000)} is VALID [2020-07-10 20:31:07,505 INFO L263 TraceCheckUtils]: 8: Hoare triple {29811#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {29812#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:31:07,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {29812#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {29813#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:31:07,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {29813#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {29806#false} is VALID [2020-07-10 20:31:07,508 INFO L280 TraceCheckUtils]: 11: Hoare triple {29806#false} assume !false; {29806#false} is VALID [2020-07-10 20:31:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:31:25,613 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:31:25,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584154904] [2020-07-10 20:31:25,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:31:25,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [135] imperfect sequences [] total 135 [2020-07-10 20:31:25,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938413760] [2020-07-10 20:31:25,614 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 183 [2020-07-10 20:31:25,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:31:25,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 135 states. [2020-07-10 20:31:26,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:26,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2020-07-10 20:31:26,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:31:26,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2020-07-10 20:31:26,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5087, Invalid=13273, Unknown=0, NotChecked=0, Total=18360 [2020-07-10 20:31:26,043 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 135 states. [2020-07-10 20:31:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:30,015 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2020-07-10 20:31:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2020-07-10 20:31:30,015 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 183 [2020-07-10 20:31:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:31:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-07-10 20:31:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2020-07-10 20:31:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-07-10 20:31:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2020-07-10 20:31:30,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 132 states and 195 transitions. [2020-07-10 20:31:30,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:30,476 INFO L225 Difference]: With dead ends: 195 [2020-07-10 20:31:30,477 INFO L226 Difference]: Without dead ends: 190 [2020-07-10 20:31:30,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 6 SyntacticMatches, 44 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9210 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=5087, Invalid=13273, Unknown=0, NotChecked=0, Total=18360 [2020-07-10 20:31:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-07-10 20:31:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2020-07-10 20:31:30,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:31:30,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 188 states. [2020-07-10 20:31:30,794 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 188 states. [2020-07-10 20:31:30,794 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 188 states. [2020-07-10 20:31:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:30,797 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2020-07-10 20:31:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2020-07-10 20:31:30,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:31:30,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:31:30,798 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 190 states. [2020-07-10 20:31:30,798 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 190 states. [2020-07-10 20:31:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:30,800 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2020-07-10 20:31:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2020-07-10 20:31:30,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:31:30,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:31:30,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:31:30,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:31:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-10 20:31:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2020-07-10 20:31:30,803 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 183 [2020-07-10 20:31:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:31:30,803 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2020-07-10 20:31:30,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 135 states. [2020-07-10 20:31:30,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 188 states and 188 transitions. [2020-07-10 20:31:31,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2020-07-10 20:31:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-07-10 20:31:31,221 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:31:31,221 INFO L422 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:31:31,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-07-10 20:31:31,222 INFO L427 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:31:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:31:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1707556980, now seen corresponding path program 44 times [2020-07-10 20:31:31,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:31:31,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2118880264] [2020-07-10 20:31:31,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:31:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:31:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:31:33,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {31091#true} assume true; {31091#true} is VALID [2020-07-10 20:31:33,448 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {31091#true} {31091#true} #45#return; {31091#true} is VALID [2020-07-10 20:31:33,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {31091#true} call ULTIMATE.init(); {31091#true} is VALID [2020-07-10 20:31:33,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {31091#true} assume true; {31091#true} is VALID [2020-07-10 20:31:33,449 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31091#true} {31091#true} #45#return; {31091#true} is VALID [2020-07-10 20:31:33,449 INFO L263 TraceCheckUtils]: 3: Hoare triple {31091#true} call #t~ret1 := main(); {31091#true} is VALID [2020-07-10 20:31:33,449 INFO L280 TraceCheckUtils]: 4: Hoare triple {31091#true} havoc ~i~0; {31091#true} is VALID [2020-07-10 20:31:33,450 INFO L280 TraceCheckUtils]: 5: Hoare triple {31091#true} ~i~0 := 0; {31095#(<= main_~i~0 0)} is VALID [2020-07-10 20:31:33,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {31095#(<= main_~i~0 0)} [137] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_44 2))) (or (and (<= v_oct_main_~i~0_in_44 999999) (<= v_oct_main_~i~0_out_44 1000001) (<= v_oct_main_~i~0_in_44 999998) (<= v_oct_main_~i~0_out_44 1000000) (<= .cse0 v_oct_main_~i~0_out_44)) (let ((.cse1 (+ v_oct_main_~i~0_in_44 1))) (and (<= (* 2 v_oct_main_~i~0_in_44) 1999998) (<= .cse1 v_oct_main_~i~0_out_44) (<= v_oct_main_~i~0_out_44 .cse1) (or (< 999999 v_oct_main_~i~0_in_44) (< 999998 v_oct_main_~i~0_in_44) (< v_oct_main_~i~0_out_44 .cse0) (< 1000000 v_oct_main_~i~0_out_44) (< 1000001 v_oct_main_~i~0_out_44)))))) InVars {main_~i~0=v_oct_main_~i~0_in_44} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_44|, main_~i~0=v_oct_main_~i~0_out_44} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {31096#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:31:33,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {31096#(<= main_~i~0 1000000)} [136] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {31097#(= main_~i~0 1000000)} is VALID [2020-07-10 20:31:33,454 INFO L263 TraceCheckUtils]: 8: Hoare triple {31097#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {31098#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:31:33,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {31098#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {31099#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:31:33,456 INFO L280 TraceCheckUtils]: 10: Hoare triple {31099#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {31092#false} is VALID [2020-07-10 20:31:33,456 INFO L280 TraceCheckUtils]: 11: Hoare triple {31092#false} assume !false; {31092#false} is VALID [2020-07-10 20:31:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:31:53,209 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:31:53,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2118880264] [2020-07-10 20:31:53,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:31:53,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [138] imperfect sequences [] total 138 [2020-07-10 20:31:53,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764877782] [2020-07-10 20:31:53,212 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 187 [2020-07-10 20:31:53,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:31:53,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 138 states. [2020-07-10 20:31:53,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:53,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2020-07-10 20:31:53,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:31:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2020-07-10 20:31:53,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5315, Invalid=13867, Unknown=0, NotChecked=0, Total=19182 [2020-07-10 20:31:53,680 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 138 states. [2020-07-10 20:31:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:57,946 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2020-07-10 20:31:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2020-07-10 20:31:57,947 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 187 [2020-07-10 20:31:57,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:31:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-10 20:31:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2020-07-10 20:31:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-10 20:31:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2020-07-10 20:31:57,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 135 states and 199 transitions. [2020-07-10 20:31:58,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:58,446 INFO L225 Difference]: With dead ends: 199 [2020-07-10 20:31:58,446 INFO L226 Difference]: Without dead ends: 194 [2020-07-10 20:31:58,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 6 SyntacticMatches, 45 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9644 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=5315, Invalid=13867, Unknown=0, NotChecked=0, Total=19182 [2020-07-10 20:31:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-10 20:31:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2020-07-10 20:31:58,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:31:58,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 192 states. [2020-07-10 20:31:58,790 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 192 states. [2020-07-10 20:31:58,790 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 192 states. [2020-07-10 20:31:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:58,794 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2020-07-10 20:31:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2020-07-10 20:31:58,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:31:58,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:31:58,794 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 194 states. [2020-07-10 20:31:58,794 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 194 states. [2020-07-10 20:31:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:31:58,797 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2020-07-10 20:31:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2020-07-10 20:31:58,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:31:58,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:31:58,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:31:58,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:31:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-07-10 20:31:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2020-07-10 20:31:58,800 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 187 [2020-07-10 20:31:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:31:58,800 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2020-07-10 20:31:58,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 138 states. [2020-07-10 20:31:58,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 192 states and 192 transitions. [2020-07-10 20:31:59,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:31:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2020-07-10 20:31:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-10 20:31:59,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:31:59,247 INFO L422 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:31:59,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-07-10 20:31:59,248 INFO L427 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:31:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:31:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash -71754359, now seen corresponding path program 45 times [2020-07-10 20:31:59,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:31:59,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1809909366] [2020-07-10 20:31:59,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:32:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:32:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:32:01,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {32404#true} assume true; {32404#true} is VALID [2020-07-10 20:32:01,468 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32404#true} {32404#true} #45#return; {32404#true} is VALID [2020-07-10 20:32:01,469 INFO L263 TraceCheckUtils]: 0: Hoare triple {32404#true} call ULTIMATE.init(); {32404#true} is VALID [2020-07-10 20:32:01,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {32404#true} assume true; {32404#true} is VALID [2020-07-10 20:32:01,469 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32404#true} {32404#true} #45#return; {32404#true} is VALID [2020-07-10 20:32:01,469 INFO L263 TraceCheckUtils]: 3: Hoare triple {32404#true} call #t~ret1 := main(); {32404#true} is VALID [2020-07-10 20:32:01,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {32404#true} havoc ~i~0; {32404#true} is VALID [2020-07-10 20:32:01,471 INFO L280 TraceCheckUtils]: 5: Hoare triple {32404#true} ~i~0 := 0; {32408#(<= main_~i~0 0)} is VALID [2020-07-10 20:32:01,472 INFO L280 TraceCheckUtils]: 6: Hoare triple {32408#(<= main_~i~0 0)} [139] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_45 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_45 1))) (and (<= v_oct_main_~i~0_out_45 .cse0) (<= (* 2 v_oct_main_~i~0_in_45) 1999998) (or (< 1000000 v_oct_main_~i~0_out_45) (< 999999 v_oct_main_~i~0_in_45) (< 999998 v_oct_main_~i~0_in_45) (< v_oct_main_~i~0_out_45 .cse1) (< 1000001 v_oct_main_~i~0_out_45)) (<= .cse0 v_oct_main_~i~0_out_45))) (and (<= v_oct_main_~i~0_out_45 1000000) (<= v_oct_main_~i~0_out_45 1000001) (<= v_oct_main_~i~0_in_45 999998) (<= .cse1 v_oct_main_~i~0_out_45) (<= v_oct_main_~i~0_in_45 999999)))) InVars {main_~i~0=v_oct_main_~i~0_in_45} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_45|, main_~i~0=v_oct_main_~i~0_out_45} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {32409#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:32:01,474 INFO L280 TraceCheckUtils]: 7: Hoare triple {32409#(<= main_~i~0 1000000)} [138] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {32410#(= main_~i~0 1000000)} is VALID [2020-07-10 20:32:01,475 INFO L263 TraceCheckUtils]: 8: Hoare triple {32410#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {32411#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:32:01,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {32411#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {32412#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:32:01,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {32412#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {32405#false} is VALID [2020-07-10 20:32:01,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {32405#false} assume !false; {32405#false} is VALID [2020-07-10 20:32:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:32:23,634 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:32:23,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1809909366] [2020-07-10 20:32:23,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:32:23,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [141] imperfect sequences [] total 141 [2020-07-10 20:32:23,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872650555] [2020-07-10 20:32:23,635 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 191 [2020-07-10 20:32:23,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:32:23,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 141 states. [2020-07-10 20:32:24,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:32:24,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2020-07-10 20:32:24,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:32:24,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2020-07-10 20:32:24,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5548, Invalid=14474, Unknown=0, NotChecked=0, Total=20022 [2020-07-10 20:32:24,137 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 141 states. [2020-07-10 20:32:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:32:26,841 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2020-07-10 20:32:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2020-07-10 20:32:26,841 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 191 [2020-07-10 20:32:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:32:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-07-10 20:32:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2020-07-10 20:32:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-07-10 20:32:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2020-07-10 20:32:26,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 138 states and 203 transitions. [2020-07-10 20:32:27,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:32:27,369 INFO L225 Difference]: With dead ends: 203 [2020-07-10 20:32:27,369 INFO L226 Difference]: Without dead ends: 198 [2020-07-10 20:32:27,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 6 SyntacticMatches, 46 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10088 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=5548, Invalid=14474, Unknown=0, NotChecked=0, Total=20022 [2020-07-10 20:32:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-07-10 20:32:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2020-07-10 20:32:27,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:32:27,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 196 states. [2020-07-10 20:32:27,747 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 196 states. [2020-07-10 20:32:27,747 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 196 states. [2020-07-10 20:32:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:32:27,750 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2020-07-10 20:32:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2020-07-10 20:32:27,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:32:27,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:32:27,750 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 198 states. [2020-07-10 20:32:27,750 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 198 states. [2020-07-10 20:32:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:32:27,753 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2020-07-10 20:32:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2020-07-10 20:32:27,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:32:27,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:32:27,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:32:27,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:32:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-07-10 20:32:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2020-07-10 20:32:27,756 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 191 [2020-07-10 20:32:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:32:27,756 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2020-07-10 20:32:27,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 141 states. [2020-07-10 20:32:27,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 196 states and 196 transitions. [2020-07-10 20:32:28,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:32:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2020-07-10 20:32:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-10 20:32:28,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:32:28,279 INFO L422 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:32:28,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-07-10 20:32:28,280 INFO L427 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:32:28,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:32:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash -911198970, now seen corresponding path program 46 times [2020-07-10 20:32:28,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:32:28,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19036219] [2020-07-10 20:32:28,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:32:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:32:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:32:30,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {33744#true} assume true; {33744#true} is VALID [2020-07-10 20:32:30,518 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33744#true} {33744#true} #45#return; {33744#true} is VALID [2020-07-10 20:32:30,518 INFO L263 TraceCheckUtils]: 0: Hoare triple {33744#true} call ULTIMATE.init(); {33744#true} is VALID [2020-07-10 20:32:30,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {33744#true} assume true; {33744#true} is VALID [2020-07-10 20:32:30,518 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33744#true} {33744#true} #45#return; {33744#true} is VALID [2020-07-10 20:32:30,519 INFO L263 TraceCheckUtils]: 3: Hoare triple {33744#true} call #t~ret1 := main(); {33744#true} is VALID [2020-07-10 20:32:30,519 INFO L280 TraceCheckUtils]: 4: Hoare triple {33744#true} havoc ~i~0; {33744#true} is VALID [2020-07-10 20:32:30,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {33744#true} ~i~0 := 0; {33748#(<= main_~i~0 0)} is VALID [2020-07-10 20:32:30,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {33748#(<= main_~i~0 0)} [141] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_46 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_46 1))) (and (or (< 1000001 v_oct_main_~i~0_out_46) (< 1000000 v_oct_main_~i~0_out_46) (< 999998 v_oct_main_~i~0_in_46) (< v_oct_main_~i~0_out_46 .cse0) (< 999999 v_oct_main_~i~0_in_46)) (<= .cse1 v_oct_main_~i~0_out_46) (<= (* 2 v_oct_main_~i~0_in_46) 1999998) (<= v_oct_main_~i~0_out_46 .cse1))) (and (<= v_oct_main_~i~0_in_46 999999) (<= .cse0 v_oct_main_~i~0_out_46) (<= v_oct_main_~i~0_out_46 1000000) (<= v_oct_main_~i~0_out_46 1000001) (<= v_oct_main_~i~0_in_46 999998)))) InVars {main_~i~0=v_oct_main_~i~0_in_46} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_46|, main_~i~0=v_oct_main_~i~0_out_46} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {33749#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:32:30,531 INFO L280 TraceCheckUtils]: 7: Hoare triple {33749#(<= main_~i~0 1000000)} [140] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {33750#(= main_~i~0 1000000)} is VALID [2020-07-10 20:32:30,533 INFO L263 TraceCheckUtils]: 8: Hoare triple {33750#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {33751#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:32:30,535 INFO L280 TraceCheckUtils]: 9: Hoare triple {33751#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {33752#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:32:30,537 INFO L280 TraceCheckUtils]: 10: Hoare triple {33752#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {33745#false} is VALID [2020-07-10 20:32:30,537 INFO L280 TraceCheckUtils]: 11: Hoare triple {33745#false} assume !false; {33745#false} is VALID [2020-07-10 20:32:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:32:54,845 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:32:54,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19036219] [2020-07-10 20:32:54,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:32:54,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [144] imperfect sequences [] total 144 [2020-07-10 20:32:54,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566216302] [2020-07-10 20:32:54,847 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 195 [2020-07-10 20:32:54,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:32:54,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states. [2020-07-10 20:32:55,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:32:55,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2020-07-10 20:32:55,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:32:55,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2020-07-10 20:32:55,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5786, Invalid=15094, Unknown=0, NotChecked=0, Total=20880 [2020-07-10 20:32:55,387 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 144 states. [2020-07-10 20:32:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:32:59,698 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2020-07-10 20:32:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2020-07-10 20:32:59,698 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 195 [2020-07-10 20:32:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:32:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-10 20:32:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2020-07-10 20:32:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-10 20:32:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2020-07-10 20:32:59,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 141 states and 207 transitions. [2020-07-10 20:33:00,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:33:00,274 INFO L225 Difference]: With dead ends: 207 [2020-07-10 20:33:00,274 INFO L226 Difference]: Without dead ends: 202 [2020-07-10 20:33:00,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 6 SyntacticMatches, 47 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10542 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=5786, Invalid=15094, Unknown=0, NotChecked=0, Total=20880 [2020-07-10 20:33:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-10 20:33:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2020-07-10 20:33:00,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:33:00,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 200 states. [2020-07-10 20:33:00,690 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 200 states. [2020-07-10 20:33:00,690 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 200 states. [2020-07-10 20:33:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:33:00,694 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2020-07-10 20:33:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2020-07-10 20:33:00,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:33:00,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:33:00,694 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 202 states. [2020-07-10 20:33:00,694 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 202 states. [2020-07-10 20:33:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:33:00,697 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2020-07-10 20:33:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2020-07-10 20:33:00,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:33:00,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:33:00,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:33:00,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:33:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-10 20:33:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2020-07-10 20:33:00,700 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 195 [2020-07-10 20:33:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:33:00,700 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2020-07-10 20:33:00,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 144 states. [2020-07-10 20:33:00,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 200 states and 200 transitions. [2020-07-10 20:33:01,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:33:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2020-07-10 20:33:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-07-10 20:33:01,262 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:33:01,268 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:33:01,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-07-10 20:33:01,268 INFO L427 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:33:01,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:33:01,268 INFO L82 PathProgramCache]: Analyzing trace with hash 254100995, now seen corresponding path program 47 times [2020-07-10 20:33:01,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:33:01,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [287579833] [2020-07-10 20:33:01,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:33:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:33:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:33:03,533 INFO L280 TraceCheckUtils]: 0: Hoare triple {35111#true} assume true; {35111#true} is VALID [2020-07-10 20:33:03,534 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35111#true} {35111#true} #45#return; {35111#true} is VALID [2020-07-10 20:33:03,534 INFO L263 TraceCheckUtils]: 0: Hoare triple {35111#true} call ULTIMATE.init(); {35111#true} is VALID [2020-07-10 20:33:03,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {35111#true} assume true; {35111#true} is VALID [2020-07-10 20:33:03,534 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35111#true} {35111#true} #45#return; {35111#true} is VALID [2020-07-10 20:33:03,534 INFO L263 TraceCheckUtils]: 3: Hoare triple {35111#true} call #t~ret1 := main(); {35111#true} is VALID [2020-07-10 20:33:03,535 INFO L280 TraceCheckUtils]: 4: Hoare triple {35111#true} havoc ~i~0; {35111#true} is VALID [2020-07-10 20:33:03,536 INFO L280 TraceCheckUtils]: 5: Hoare triple {35111#true} ~i~0 := 0; {35115#(<= main_~i~0 0)} is VALID [2020-07-10 20:33:03,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {35115#(<= main_~i~0 0)} [143] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_47 2))) (or (and (<= v_oct_main_~i~0_in_47 999999) (<= v_oct_main_~i~0_out_47 1000001) (<= .cse0 v_oct_main_~i~0_out_47) (<= v_oct_main_~i~0_in_47 999998) (<= v_oct_main_~i~0_out_47 1000000)) (let ((.cse1 (+ v_oct_main_~i~0_in_47 1))) (and (<= .cse1 v_oct_main_~i~0_out_47) (<= v_oct_main_~i~0_out_47 .cse1) (<= (* 2 v_oct_main_~i~0_in_47) 1999998) (or (< 999999 v_oct_main_~i~0_in_47) (< 999998 v_oct_main_~i~0_in_47) (< v_oct_main_~i~0_out_47 .cse0) (< 1000001 v_oct_main_~i~0_out_47) (< 1000000 v_oct_main_~i~0_out_47)))))) InVars {main_~i~0=v_oct_main_~i~0_in_47} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_47|, main_~i~0=v_oct_main_~i~0_out_47} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {35116#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:33:03,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {35116#(<= main_~i~0 1000000)} [142] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {35117#(= main_~i~0 1000000)} is VALID [2020-07-10 20:33:03,541 INFO L263 TraceCheckUtils]: 8: Hoare triple {35117#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {35118#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:33:03,542 INFO L280 TraceCheckUtils]: 9: Hoare triple {35118#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {35119#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:33:03,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {35119#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {35112#false} is VALID [2020-07-10 20:33:03,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {35112#false} assume !false; {35112#false} is VALID [2020-07-10 20:33:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:33:30,161 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:33:30,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [287579833] [2020-07-10 20:33:30,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:33:30,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [147] imperfect sequences [] total 147 [2020-07-10 20:33:30,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458968689] [2020-07-10 20:33:30,162 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 199 [2020-07-10 20:33:30,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:33:30,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 147 states. [2020-07-10 20:33:30,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:33:30,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2020-07-10 20:33:30,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:33:30,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2020-07-10 20:33:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6029, Invalid=15727, Unknown=0, NotChecked=0, Total=21756 [2020-07-10 20:33:30,750 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 147 states. [2020-07-10 20:33:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:33:36,417 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2020-07-10 20:33:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2020-07-10 20:33:36,417 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 199 [2020-07-10 20:33:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:33:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-10 20:33:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2020-07-10 20:33:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-10 20:33:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2020-07-10 20:33:36,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states and 211 transitions. [2020-07-10 20:33:37,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:33:37,011 INFO L225 Difference]: With dead ends: 211 [2020-07-10 20:33:37,012 INFO L226 Difference]: Without dead ends: 206 [2020-07-10 20:33:37,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 6 SyntacticMatches, 48 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11006 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=6029, Invalid=15727, Unknown=0, NotChecked=0, Total=21756 [2020-07-10 20:33:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-10 20:33:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2020-07-10 20:33:37,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:33:37,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 204 states. [2020-07-10 20:33:37,450 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 204 states. [2020-07-10 20:33:37,450 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 204 states. [2020-07-10 20:33:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:33:37,460 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2020-07-10 20:33:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2020-07-10 20:33:37,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:33:37,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:33:37,461 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 206 states. [2020-07-10 20:33:37,461 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 206 states. [2020-07-10 20:33:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:33:37,466 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2020-07-10 20:33:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2020-07-10 20:33:37,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:33:37,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:33:37,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:33:37,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:33:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-07-10 20:33:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2020-07-10 20:33:37,470 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 199 [2020-07-10 20:33:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:33:37,471 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2020-07-10 20:33:37,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 147 states. [2020-07-10 20:33:37,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 204 states and 204 transitions. [2020-07-10 20:33:38,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:33:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2020-07-10 20:33:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2020-07-10 20:33:38,095 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:33:38,095 INFO L422 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:33:38,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-07-10 20:33:38,096 INFO L427 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:33:38,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:33:38,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2122346368, now seen corresponding path program 48 times [2020-07-10 20:33:38,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:33:38,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999737327] [2020-07-10 20:33:38,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:33:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:33:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:33:40,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {36505#true} assume true; {36505#true} is VALID [2020-07-10 20:33:40,378 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36505#true} {36505#true} #45#return; {36505#true} is VALID [2020-07-10 20:33:40,378 INFO L263 TraceCheckUtils]: 0: Hoare triple {36505#true} call ULTIMATE.init(); {36505#true} is VALID [2020-07-10 20:33:40,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {36505#true} assume true; {36505#true} is VALID [2020-07-10 20:33:40,378 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36505#true} {36505#true} #45#return; {36505#true} is VALID [2020-07-10 20:33:40,379 INFO L263 TraceCheckUtils]: 3: Hoare triple {36505#true} call #t~ret1 := main(); {36505#true} is VALID [2020-07-10 20:33:40,379 INFO L280 TraceCheckUtils]: 4: Hoare triple {36505#true} havoc ~i~0; {36505#true} is VALID [2020-07-10 20:33:40,380 INFO L280 TraceCheckUtils]: 5: Hoare triple {36505#true} ~i~0 := 0; {36509#(<= main_~i~0 0)} is VALID [2020-07-10 20:33:40,382 INFO L280 TraceCheckUtils]: 6: Hoare triple {36509#(<= main_~i~0 0)} [145] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_48 2))) (or (and (<= v_oct_main_~i~0_out_48 1000001) (<= v_oct_main_~i~0_in_48 999999) (<= v_oct_main_~i~0_in_48 999998) (<= v_oct_main_~i~0_out_48 1000000) (<= .cse0 v_oct_main_~i~0_out_48)) (let ((.cse1 (+ v_oct_main_~i~0_in_48 1))) (and (<= (* 2 v_oct_main_~i~0_in_48) 1999998) (<= v_oct_main_~i~0_out_48 .cse1) (or (< 999998 v_oct_main_~i~0_in_48) (< 1000000 v_oct_main_~i~0_out_48) (< 1000001 v_oct_main_~i~0_out_48) (< 999999 v_oct_main_~i~0_in_48) (< v_oct_main_~i~0_out_48 .cse0)) (<= .cse1 v_oct_main_~i~0_out_48))))) InVars {main_~i~0=v_oct_main_~i~0_in_48} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_48|, main_~i~0=v_oct_main_~i~0_out_48} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {36510#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:33:40,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {36510#(<= main_~i~0 1000000)} [144] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {36511#(= main_~i~0 1000000)} is VALID [2020-07-10 20:33:40,384 INFO L263 TraceCheckUtils]: 8: Hoare triple {36511#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {36512#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:33:40,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {36512#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {36513#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:33:40,387 INFO L280 TraceCheckUtils]: 10: Hoare triple {36513#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {36506#false} is VALID [2020-07-10 20:33:40,387 INFO L280 TraceCheckUtils]: 11: Hoare triple {36506#false} assume !false; {36506#false} is VALID [2020-07-10 20:33:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:34:08,554 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:34:08,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999737327] [2020-07-10 20:34:08,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:34:08,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [150] imperfect sequences [] total 150 [2020-07-10 20:34:08,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491969423] [2020-07-10 20:34:08,556 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 203 [2020-07-10 20:34:08,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:34:08,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 150 states. [2020-07-10 20:34:09,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:34:09,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2020-07-10 20:34:09,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:34:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2020-07-10 20:34:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6277, Invalid=16373, Unknown=0, NotChecked=0, Total=22650 [2020-07-10 20:34:09,158 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 150 states. [2020-07-10 20:34:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:34:12,758 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2020-07-10 20:34:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2020-07-10 20:34:12,759 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 203 [2020-07-10 20:34:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:34:12,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-07-10 20:34:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2020-07-10 20:34:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-07-10 20:34:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2020-07-10 20:34:12,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 147 states and 215 transitions. [2020-07-10 20:34:13,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:34:13,447 INFO L225 Difference]: With dead ends: 215 [2020-07-10 20:34:13,447 INFO L226 Difference]: Without dead ends: 210 [2020-07-10 20:34:13,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 6 SyntacticMatches, 49 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11480 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=6277, Invalid=16373, Unknown=0, NotChecked=0, Total=22650 [2020-07-10 20:34:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-10 20:34:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2020-07-10 20:34:13,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:34:13,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 208 states. [2020-07-10 20:34:13,995 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 208 states. [2020-07-10 20:34:13,995 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 208 states. [2020-07-10 20:34:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:34:13,998 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2020-07-10 20:34:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2020-07-10 20:34:13,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:34:13,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:34:13,999 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 210 states. [2020-07-10 20:34:13,999 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 210 states. [2020-07-10 20:34:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:34:14,002 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2020-07-10 20:34:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2020-07-10 20:34:14,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:34:14,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:34:14,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:34:14,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:34:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-07-10 20:34:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2020-07-10 20:34:14,007 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 203 [2020-07-10 20:34:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:34:14,007 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2020-07-10 20:34:14,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 150 states. [2020-07-10 20:34:14,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 208 states and 208 transitions. [2020-07-10 20:34:14,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:34:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2020-07-10 20:34:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-07-10 20:34:14,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:34:14,660 INFO L422 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:34:14,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-07-10 20:34:14,660 INFO L427 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:34:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:34:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1350980733, now seen corresponding path program 49 times [2020-07-10 20:34:14,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:34:14,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356453045] [2020-07-10 20:34:14,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:34:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:34:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:34:16,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {37926#true} assume true; {37926#true} is VALID [2020-07-10 20:34:16,954 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37926#true} {37926#true} #45#return; {37926#true} is VALID [2020-07-10 20:34:16,955 INFO L263 TraceCheckUtils]: 0: Hoare triple {37926#true} call ULTIMATE.init(); {37926#true} is VALID [2020-07-10 20:34:16,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {37926#true} assume true; {37926#true} is VALID [2020-07-10 20:34:16,955 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37926#true} {37926#true} #45#return; {37926#true} is VALID [2020-07-10 20:34:16,955 INFO L263 TraceCheckUtils]: 3: Hoare triple {37926#true} call #t~ret1 := main(); {37926#true} is VALID [2020-07-10 20:34:16,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {37926#true} havoc ~i~0; {37926#true} is VALID [2020-07-10 20:34:16,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {37926#true} ~i~0 := 0; {37930#(<= main_~i~0 0)} is VALID [2020-07-10 20:34:16,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {37930#(<= main_~i~0 0)} [147] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_49 2))) (or (and (<= v_oct_main_~i~0_in_49 999998) (<= .cse0 v_oct_main_~i~0_out_49) (<= v_oct_main_~i~0_out_49 1000001) (<= v_oct_main_~i~0_in_49 999999) (<= v_oct_main_~i~0_out_49 1000000)) (let ((.cse1 (+ v_oct_main_~i~0_in_49 1))) (and (<= v_oct_main_~i~0_out_49 .cse1) (<= .cse1 v_oct_main_~i~0_out_49) (or (< v_oct_main_~i~0_out_49 .cse0) (< 1000001 v_oct_main_~i~0_out_49) (< 999998 v_oct_main_~i~0_in_49) (< 1000000 v_oct_main_~i~0_out_49) (< 999999 v_oct_main_~i~0_in_49)) (<= (* 2 v_oct_main_~i~0_in_49) 1999998))))) InVars {main_~i~0=v_oct_main_~i~0_in_49} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_49|, main_~i~0=v_oct_main_~i~0_out_49} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {37931#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:34:16,960 INFO L280 TraceCheckUtils]: 7: Hoare triple {37931#(<= main_~i~0 1000000)} [146] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {37932#(= main_~i~0 1000000)} is VALID [2020-07-10 20:34:16,961 INFO L263 TraceCheckUtils]: 8: Hoare triple {37932#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {37933#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:34:16,963 INFO L280 TraceCheckUtils]: 9: Hoare triple {37933#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {37934#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:34:16,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {37934#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {37927#false} is VALID [2020-07-10 20:34:16,964 INFO L280 TraceCheckUtils]: 11: Hoare triple {37927#false} assume !false; {37927#false} is VALID [2020-07-10 20:34:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:34:48,754 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:34:48,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356453045] [2020-07-10 20:34:48,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:34:48,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [153] imperfect sequences [] total 153 [2020-07-10 20:34:48,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828992943] [2020-07-10 20:34:48,756 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 207 [2020-07-10 20:34:48,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:34:48,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states. [2020-07-10 20:34:49,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:34:49,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2020-07-10 20:34:49,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:34:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2020-07-10 20:34:49,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6530, Invalid=17032, Unknown=0, NotChecked=0, Total=23562 [2020-07-10 20:34:49,464 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 153 states. [2020-07-10 20:34:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:34:56,262 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2020-07-10 20:34:56,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2020-07-10 20:34:56,262 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 207 [2020-07-10 20:34:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:34:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-10 20:34:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2020-07-10 20:34:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-10 20:34:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2020-07-10 20:34:56,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 150 states and 219 transitions. [2020-07-10 20:34:57,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:34:57,006 INFO L225 Difference]: With dead ends: 219 [2020-07-10 20:34:57,006 INFO L226 Difference]: Without dead ends: 214 [2020-07-10 20:34:57,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 6 SyntacticMatches, 50 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11964 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=6530, Invalid=17032, Unknown=0, NotChecked=0, Total=23562 [2020-07-10 20:34:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-10 20:34:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2020-07-10 20:34:57,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:34:57,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 212 states. [2020-07-10 20:34:57,554 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 212 states. [2020-07-10 20:34:57,554 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 212 states. [2020-07-10 20:34:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:34:57,558 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2020-07-10 20:34:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2020-07-10 20:34:57,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:34:57,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:34:57,559 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 214 states. [2020-07-10 20:34:57,559 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 214 states. [2020-07-10 20:34:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:34:57,561 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2020-07-10 20:34:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2020-07-10 20:34:57,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:34:57,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:34:57,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:34:57,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:34:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-07-10 20:34:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2020-07-10 20:34:57,564 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 207 [2020-07-10 20:34:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:34:57,564 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2020-07-10 20:34:57,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 153 states. [2020-07-10 20:34:57,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 212 states and 212 transitions. [2020-07-10 20:34:58,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:34:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2020-07-10 20:34:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-10 20:34:58,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:34:58,270 INFO L422 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:34:58,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-07-10 20:34:58,270 INFO L427 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:34:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:34:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash -161426950, now seen corresponding path program 50 times [2020-07-10 20:34:58,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:34:58,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028050440] [2020-07-10 20:34:58,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:35:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:35:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:35:00,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {39374#true} assume true; {39374#true} is VALID [2020-07-10 20:35:00,648 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {39374#true} {39374#true} #45#return; {39374#true} is VALID [2020-07-10 20:35:00,649 INFO L263 TraceCheckUtils]: 0: Hoare triple {39374#true} call ULTIMATE.init(); {39374#true} is VALID [2020-07-10 20:35:00,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {39374#true} assume true; {39374#true} is VALID [2020-07-10 20:35:00,649 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39374#true} {39374#true} #45#return; {39374#true} is VALID [2020-07-10 20:35:00,650 INFO L263 TraceCheckUtils]: 3: Hoare triple {39374#true} call #t~ret1 := main(); {39374#true} is VALID [2020-07-10 20:35:00,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {39374#true} havoc ~i~0; {39374#true} is VALID [2020-07-10 20:35:00,652 INFO L280 TraceCheckUtils]: 5: Hoare triple {39374#true} ~i~0 := 0; {39378#(<= main_~i~0 0)} is VALID [2020-07-10 20:35:00,655 INFO L280 TraceCheckUtils]: 6: Hoare triple {39378#(<= main_~i~0 0)} [149] L15-6-->L15-7_primed: Formula: (let ((.cse0 (+ v_oct_main_~i~0_in_50 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_50 1))) (and (or (< 1000001 v_oct_main_~i~0_out_50) (< v_oct_main_~i~0_out_50 .cse0) (< 1000000 v_oct_main_~i~0_out_50) (< 999999 v_oct_main_~i~0_in_50) (< 999998 v_oct_main_~i~0_in_50)) (<= (* 2 v_oct_main_~i~0_in_50) 1999998) (<= .cse1 v_oct_main_~i~0_out_50) (<= v_oct_main_~i~0_out_50 .cse1))) (and (<= v_oct_main_~i~0_out_50 1000001) (<= v_oct_main_~i~0_in_50 999998) (<= v_oct_main_~i~0_in_50 999999) (<= v_oct_main_~i~0_out_50 1000000) (<= .cse0 v_oct_main_~i~0_out_50)))) InVars {main_~i~0=v_oct_main_~i~0_in_50} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_50|, main_~i~0=v_oct_main_~i~0_out_50} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {39379#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:35:00,657 INFO L280 TraceCheckUtils]: 7: Hoare triple {39379#(<= main_~i~0 1000000)} [148] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {39380#(= main_~i~0 1000000)} is VALID [2020-07-10 20:35:00,660 INFO L263 TraceCheckUtils]: 8: Hoare triple {39380#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {39381#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:35:00,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {39381#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {39382#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:35:00,664 INFO L280 TraceCheckUtils]: 10: Hoare triple {39382#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {39375#false} is VALID [2020-07-10 20:35:00,664 INFO L280 TraceCheckUtils]: 11: Hoare triple {39375#false} assume !false; {39375#false} is VALID [2020-07-10 20:35:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:35:35,606 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:35:35,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028050440] [2020-07-10 20:35:35,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:35:35,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [156] imperfect sequences [] total 156 [2020-07-10 20:35:35,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397467454] [2020-07-10 20:35:35,608 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 211 [2020-07-10 20:35:35,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:35:35,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states. [2020-07-10 20:35:36,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:35:36,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2020-07-10 20:35:36,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:35:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2020-07-10 20:35:36,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6788, Invalid=17704, Unknown=0, NotChecked=0, Total=24492 [2020-07-10 20:35:36,329 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 156 states. [2020-07-10 20:35:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:35:42,004 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2020-07-10 20:35:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2020-07-10 20:35:42,005 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 211 [2020-07-10 20:35:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:35:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-10 20:35:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2020-07-10 20:35:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-10 20:35:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2020-07-10 20:35:42,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 223 transitions. [2020-07-10 20:35:42,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:35:42,763 INFO L225 Difference]: With dead ends: 223 [2020-07-10 20:35:42,763 INFO L226 Difference]: Without dead ends: 218 [2020-07-10 20:35:42,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 6 SyntacticMatches, 51 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12458 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=6788, Invalid=17704, Unknown=0, NotChecked=0, Total=24492 [2020-07-10 20:35:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-07-10 20:35:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2020-07-10 20:35:43,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:35:43,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand 216 states. [2020-07-10 20:35:43,311 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 216 states. [2020-07-10 20:35:43,311 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 216 states. [2020-07-10 20:35:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:35:43,316 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2020-07-10 20:35:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2020-07-10 20:35:43,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:35:43,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:35:43,316 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 218 states. [2020-07-10 20:35:43,316 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 218 states. [2020-07-10 20:35:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:35:43,319 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2020-07-10 20:35:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2020-07-10 20:35:43,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:35:43,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:35:43,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:35:43,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:35:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-07-10 20:35:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2020-07-10 20:35:43,323 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 211 [2020-07-10 20:35:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:35:43,323 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2020-07-10 20:35:43,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 156 states. [2020-07-10 20:35:43,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 216 states and 216 transitions. [2020-07-10 20:35:44,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:35:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2020-07-10 20:35:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-07-10 20:35:44,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:35:44,056 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:35:44,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-07-10 20:35:44,057 INFO L427 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:35:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:35:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash 127289591, now seen corresponding path program 51 times [2020-07-10 20:35:44,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:35:44,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [563353884] [2020-07-10 20:35:44,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:35:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:35:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:35:46,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {40849#true} assume true; {40849#true} is VALID [2020-07-10 20:35:46,358 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {40849#true} {40849#true} #45#return; {40849#true} is VALID [2020-07-10 20:35:46,358 INFO L263 TraceCheckUtils]: 0: Hoare triple {40849#true} call ULTIMATE.init(); {40849#true} is VALID [2020-07-10 20:35:46,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {40849#true} assume true; {40849#true} is VALID [2020-07-10 20:35:46,358 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40849#true} {40849#true} #45#return; {40849#true} is VALID [2020-07-10 20:35:46,358 INFO L263 TraceCheckUtils]: 3: Hoare triple {40849#true} call #t~ret1 := main(); {40849#true} is VALID [2020-07-10 20:35:46,358 INFO L280 TraceCheckUtils]: 4: Hoare triple {40849#true} havoc ~i~0; {40849#true} is VALID [2020-07-10 20:35:46,360 INFO L280 TraceCheckUtils]: 5: Hoare triple {40849#true} ~i~0 := 0; {40853#(<= main_~i~0 0)} is VALID [2020-07-10 20:35:46,362 INFO L280 TraceCheckUtils]: 6: Hoare triple {40853#(<= main_~i~0 0)} [151] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_51 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_51 1))) (and (<= .cse0 v_oct_main_~i~0_out_51) (<= v_oct_main_~i~0_out_51 .cse0) (<= (* 2 v_oct_main_~i~0_in_51) 1999998) (or (< v_oct_main_~i~0_out_51 .cse1) (< 1000001 v_oct_main_~i~0_out_51) (< 1000000 v_oct_main_~i~0_out_51) (< 999999 v_oct_main_~i~0_in_51) (< 999998 v_oct_main_~i~0_in_51)))) (and (<= v_oct_main_~i~0_out_51 1000001) (<= v_oct_main_~i~0_in_51 999998) (<= v_oct_main_~i~0_out_51 1000000) (<= .cse1 v_oct_main_~i~0_out_51) (<= v_oct_main_~i~0_in_51 999999)))) InVars {main_~i~0=v_oct_main_~i~0_in_51} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_51|, main_~i~0=v_oct_main_~i~0_out_51} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {40854#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:35:46,363 INFO L280 TraceCheckUtils]: 7: Hoare triple {40854#(<= main_~i~0 1000000)} [150] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {40855#(= main_~i~0 1000000)} is VALID [2020-07-10 20:35:46,365 INFO L263 TraceCheckUtils]: 8: Hoare triple {40855#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {40856#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:35:46,366 INFO L280 TraceCheckUtils]: 9: Hoare triple {40856#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {40857#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:35:46,368 INFO L280 TraceCheckUtils]: 10: Hoare triple {40857#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {40850#false} is VALID [2020-07-10 20:35:46,368 INFO L280 TraceCheckUtils]: 11: Hoare triple {40850#false} assume !false; {40850#false} is VALID [2020-07-10 20:35:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:36:23,708 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:36:23,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [563353884] [2020-07-10 20:36:23,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:36:23,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [159] imperfect sequences [] total 159 [2020-07-10 20:36:23,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979133922] [2020-07-10 20:36:23,709 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 215 [2020-07-10 20:36:23,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:36:23,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states. [2020-07-10 20:36:24,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:36:24,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2020-07-10 20:36:24,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:36:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2020-07-10 20:36:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7051, Invalid=18389, Unknown=0, NotChecked=0, Total=25440 [2020-07-10 20:36:24,546 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 159 states. [2020-07-10 20:36:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:36:29,485 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2020-07-10 20:36:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2020-07-10 20:36:29,485 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 215 [2020-07-10 20:36:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:36:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-10 20:36:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 227 transitions. [2020-07-10 20:36:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-10 20:36:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 227 transitions. [2020-07-10 20:36:29,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states and 227 transitions. [2020-07-10 20:36:30,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:36:30,402 INFO L225 Difference]: With dead ends: 227 [2020-07-10 20:36:30,402 INFO L226 Difference]: Without dead ends: 222 [2020-07-10 20:36:30,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 6 SyntacticMatches, 52 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12962 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=7051, Invalid=18389, Unknown=0, NotChecked=0, Total=25440 [2020-07-10 20:36:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-07-10 20:36:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2020-07-10 20:36:31,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:36:31,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand 220 states. [2020-07-10 20:36:31,074 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand 220 states. [2020-07-10 20:36:31,074 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 220 states. [2020-07-10 20:36:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:36:31,077 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2020-07-10 20:36:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2020-07-10 20:36:31,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:36:31,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:36:31,078 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 222 states. [2020-07-10 20:36:31,078 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 222 states. [2020-07-10 20:36:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:36:31,081 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2020-07-10 20:36:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2020-07-10 20:36:31,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:36:31,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:36:31,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:36:31,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:36:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-07-10 20:36:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2020-07-10 20:36:31,085 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 215 [2020-07-10 20:36:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:36:31,085 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2020-07-10 20:36:31,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 159 states. [2020-07-10 20:36:31,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 220 states and 220 transitions. [2020-07-10 20:36:32,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:36:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2020-07-10 20:36:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-07-10 20:36:32,026 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:36:32,026 INFO L422 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:36:32,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-07-10 20:36:32,026 INFO L427 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:36:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:36:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 51247476, now seen corresponding path program 52 times [2020-07-10 20:36:32,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:36:32,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218156829] [2020-07-10 20:36:32,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:36:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:36:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:36:34,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {42351#true} assume true; {42351#true} is VALID [2020-07-10 20:36:34,384 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {42351#true} {42351#true} #45#return; {42351#true} is VALID [2020-07-10 20:36:34,384 INFO L263 TraceCheckUtils]: 0: Hoare triple {42351#true} call ULTIMATE.init(); {42351#true} is VALID [2020-07-10 20:36:34,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {42351#true} assume true; {42351#true} is VALID [2020-07-10 20:36:34,384 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {42351#true} {42351#true} #45#return; {42351#true} is VALID [2020-07-10 20:36:34,384 INFO L263 TraceCheckUtils]: 3: Hoare triple {42351#true} call #t~ret1 := main(); {42351#true} is VALID [2020-07-10 20:36:34,385 INFO L280 TraceCheckUtils]: 4: Hoare triple {42351#true} havoc ~i~0; {42351#true} is VALID [2020-07-10 20:36:34,386 INFO L280 TraceCheckUtils]: 5: Hoare triple {42351#true} ~i~0 := 0; {42355#(<= main_~i~0 0)} is VALID [2020-07-10 20:36:34,388 INFO L280 TraceCheckUtils]: 6: Hoare triple {42355#(<= main_~i~0 0)} [153] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_52 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_52 1))) (and (<= v_oct_main_~i~0_out_52 .cse0) (or (< 999998 v_oct_main_~i~0_in_52) (< 1000001 v_oct_main_~i~0_out_52) (< 999999 v_oct_main_~i~0_in_52) (< 1000000 v_oct_main_~i~0_out_52) (< v_oct_main_~i~0_out_52 .cse1)) (<= (* 2 v_oct_main_~i~0_in_52) 1999998) (<= .cse0 v_oct_main_~i~0_out_52))) (and (<= v_oct_main_~i~0_in_52 999998) (<= v_oct_main_~i~0_in_52 999999) (<= v_oct_main_~i~0_out_52 1000001) (<= .cse1 v_oct_main_~i~0_out_52) (<= v_oct_main_~i~0_out_52 1000000)))) InVars {main_~i~0=v_oct_main_~i~0_in_52} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_52|, main_~i~0=v_oct_main_~i~0_out_52} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {42356#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:36:34,391 INFO L280 TraceCheckUtils]: 7: Hoare triple {42356#(<= main_~i~0 1000000)} [152] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {42357#(= main_~i~0 1000000)} is VALID [2020-07-10 20:36:34,392 INFO L263 TraceCheckUtils]: 8: Hoare triple {42357#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {42358#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:36:34,394 INFO L280 TraceCheckUtils]: 9: Hoare triple {42358#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {42359#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:36:34,396 INFO L280 TraceCheckUtils]: 10: Hoare triple {42359#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {42352#false} is VALID [2020-07-10 20:36:34,396 INFO L280 TraceCheckUtils]: 11: Hoare triple {42352#false} assume !false; {42352#false} is VALID [2020-07-10 20:36:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:37:17,998 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:37:17,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218156829] [2020-07-10 20:37:17,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:37:17,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [162] imperfect sequences [] total 162 [2020-07-10 20:37:18,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365223073] [2020-07-10 20:37:18,000 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 219 [2020-07-10 20:37:18,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:37:18,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 162 states. [2020-07-10 20:37:19,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:37:19,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2020-07-10 20:37:19,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:37:19,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2020-07-10 20:37:19,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7319, Invalid=19087, Unknown=0, NotChecked=0, Total=26406 [2020-07-10 20:37:19,010 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 162 states. [2020-07-10 20:37:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:37:23,509 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2020-07-10 20:37:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2020-07-10 20:37:23,509 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 219 [2020-07-10 20:37:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:37:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-10 20:37:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2020-07-10 20:37:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-10 20:37:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2020-07-10 20:37:23,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 231 transitions. [2020-07-10 20:37:24,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:37:24,567 INFO L225 Difference]: With dead ends: 231 [2020-07-10 20:37:24,567 INFO L226 Difference]: Without dead ends: 226 [2020-07-10 20:37:24,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 6 SyntacticMatches, 53 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13476 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=7319, Invalid=19087, Unknown=0, NotChecked=0, Total=26406 [2020-07-10 20:37:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-07-10 20:37:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2020-07-10 20:37:25,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:37:25,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 224 states. [2020-07-10 20:37:25,375 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 224 states. [2020-07-10 20:37:25,375 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 224 states. [2020-07-10 20:37:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:37:25,379 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2020-07-10 20:37:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2020-07-10 20:37:25,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:37:25,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:37:25,379 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 226 states. [2020-07-10 20:37:25,379 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 226 states. [2020-07-10 20:37:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:37:25,382 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2020-07-10 20:37:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2020-07-10 20:37:25,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:37:25,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:37:25,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:37:25,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:37:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-07-10 20:37:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2020-07-10 20:37:25,386 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 219 [2020-07-10 20:37:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:37:25,386 INFO L479 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2020-07-10 20:37:25,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 162 states. [2020-07-10 20:37:25,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 224 states and 224 transitions. [2020-07-10 20:37:26,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:37:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2020-07-10 20:37:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-07-10 20:37:26,426 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:37:26,426 INFO L422 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:37:26,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-07-10 20:37:26,426 INFO L427 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:37:26,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:37:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash 571417457, now seen corresponding path program 53 times [2020-07-10 20:37:26,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:37:26,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1081247283] [2020-07-10 20:37:26,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 7 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 7 to 13 Garbage collection #2: 13 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 13 to 23 [2020-07-10 20:37:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:37:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:37:28,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {43880#true} assume true; {43880#true} is VALID [2020-07-10 20:37:28,824 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {43880#true} {43880#true} #45#return; {43880#true} is VALID [2020-07-10 20:37:28,824 INFO L263 TraceCheckUtils]: 0: Hoare triple {43880#true} call ULTIMATE.init(); {43880#true} is VALID [2020-07-10 20:37:28,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {43880#true} assume true; {43880#true} is VALID [2020-07-10 20:37:28,824 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43880#true} {43880#true} #45#return; {43880#true} is VALID [2020-07-10 20:37:28,824 INFO L263 TraceCheckUtils]: 3: Hoare triple {43880#true} call #t~ret1 := main(); {43880#true} is VALID [2020-07-10 20:37:28,824 INFO L280 TraceCheckUtils]: 4: Hoare triple {43880#true} havoc ~i~0; {43880#true} is VALID [2020-07-10 20:37:28,826 INFO L280 TraceCheckUtils]: 5: Hoare triple {43880#true} ~i~0 := 0; {43884#(<= main_~i~0 0)} is VALID [2020-07-10 20:37:28,829 INFO L280 TraceCheckUtils]: 6: Hoare triple {43884#(<= main_~i~0 0)} [155] L15-6-->L15-7_primed: Formula: (let ((.cse1 (+ v_oct_main_~i~0_in_53 2))) (or (let ((.cse0 (+ v_oct_main_~i~0_in_53 1))) (and (<= .cse0 v_oct_main_~i~0_out_53) (<= (* 2 v_oct_main_~i~0_in_53) 1999998) (<= v_oct_main_~i~0_out_53 .cse0) (or (< 1000000 v_oct_main_~i~0_out_53) (< 999998 v_oct_main_~i~0_in_53) (< 999999 v_oct_main_~i~0_in_53) (< 1000001 v_oct_main_~i~0_out_53) (< v_oct_main_~i~0_out_53 .cse1)))) (and (<= v_oct_main_~i~0_in_53 999999) (<= v_oct_main_~i~0_in_53 999998) (<= v_oct_main_~i~0_out_53 1000000) (<= .cse1 v_oct_main_~i~0_out_53) (<= v_oct_main_~i~0_out_53 1000001)))) InVars {main_~i~0=v_oct_main_~i~0_in_53} OutVars{main_#t~post0=|v_oct_main_#t~post0_out_53|, main_~i~0=v_oct_main_~i~0_out_53} AuxVars[] AssignedVars[main_#t~post0, main_~i~0] {43885#(<= main_~i~0 1000000)} is VALID [2020-07-10 20:37:28,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {43885#(<= main_~i~0 1000000)} [154] L15-7_primed-->L15-7: Formula: (not (< v_main_~i~0_1 1000000)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {43886#(= main_~i~0 1000000)} is VALID [2020-07-10 20:37:28,833 INFO L263 TraceCheckUtils]: 8: Hoare triple {43886#(= main_~i~0 1000000)} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {43887#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:37:28,835 INFO L280 TraceCheckUtils]: 9: Hoare triple {43887#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {43888#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:37:28,837 INFO L280 TraceCheckUtils]: 10: Hoare triple {43888#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {43881#false} is VALID [2020-07-10 20:37:28,837 INFO L280 TraceCheckUtils]: 11: Hoare triple {43881#false} assume !false; {43881#false} is VALID [2020-07-10 20:37:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:38:16,944 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:38:16,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1081247283] [2020-07-10 20:38:16,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:38:16,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [165] imperfect sequences [] total 165 [2020-07-10 20:38:16,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141279859] [2020-07-10 20:38:16,946 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 223 [2020-07-10 20:38:16,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:38:16,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states. [2020-07-10 20:38:18,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:38:18,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2020-07-10 20:38:18,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:38:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2020-07-10 20:38:18,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7592, Invalid=19798, Unknown=0, NotChecked=0, Total=27390 [2020-07-10 20:38:18,012 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 165 states.