/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-267fbe0 [2020-07-18 00:49:42,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:49:42,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:49:42,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:49:42,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:49:42,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:49:42,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:49:42,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:49:42,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:49:42,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:49:42,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:49:42,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:49:42,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:49:42,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:49:42,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:49:42,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:49:42,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:49:42,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:49:42,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:49:42,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:49:42,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:49:42,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:49:42,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:49:42,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:49:42,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:49:42,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:49:42,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:49:42,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:49:42,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:49:42,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:49:42,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:49:42,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:49:42,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:49:42,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:49:42,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:49:42,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:49:42,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:49:42,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:49:42,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:49:42,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:49:42,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:49:42,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:49:42,862 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:49:42,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:49:42,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:49:42,865 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:49:42,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:49:42,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:49:42,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:49:42,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:49:42,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:49:42,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:49:42,867 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:49:42,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:49:42,868 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:49:42,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:49:42,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:49:42,870 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:49:42,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:49:42,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:49:42,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:49:42,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:49:42,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:49:42,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:49:42,871 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:49:43,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:49:43,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:49:43,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:49:43,165 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:49:43,166 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:49:43,166 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-18 00:49:43,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409a91b3d/176bbfe363b34dcf9d21e8086f0e520d/FLAG16886d409 [2020-07-18 00:49:43,716 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:49:43,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1.i [2020-07-18 00:49:43,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409a91b3d/176bbfe363b34dcf9d21e8086f0e520d/FLAG16886d409 [2020-07-18 00:49:44,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409a91b3d/176bbfe363b34dcf9d21e8086f0e520d [2020-07-18 00:49:44,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:49:44,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:49:44,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:44,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:49:44,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:49:44,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5070c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44, skipping insertion in model container [2020-07-18 00:49:44,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:49:44,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:49:44,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:44,351 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:49:44,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:44,383 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:49:44,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44 WrapperNode [2020-07-18 00:49:44,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:44,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:49:44,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:49:44,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:49:44,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (1/1) ... [2020-07-18 00:49:44,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:49:44,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:49:44,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:49:44,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:49:44,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (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-18 00:49:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:49:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:49:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:49:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:49:44,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:49:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:49:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:49:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:49:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:49:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:49:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:49:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:49:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:49:44,791 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:49:44,792 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:49:44,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:44 BoogieIcfgContainer [2020-07-18 00:49:44,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:49:44,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:49:44,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:49:44,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:49:44,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:49:44" (1/3) ... [2020-07-18 00:49:44,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3143a58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:44, skipping insertion in model container [2020-07-18 00:49:44,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:44" (2/3) ... [2020-07-18 00:49:44,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3143a58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:44, skipping insertion in model container [2020-07-18 00:49:44,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:44" (3/3) ... [2020-07-18 00:49:44,806 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_1.i [2020-07-18 00:49:44,821 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:49:44,830 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:49:44,850 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:49:44,899 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:49:44,899 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:49:44,899 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:49:44,899 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:49:44,900 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:49:44,900 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:49:44,900 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:49:44,900 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:49:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-18 00:49:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-18 00:49:44,955 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:44,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:44,957 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash 574813456, now seen corresponding path program 1 times [2020-07-18 00:49:44,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:44,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [292810296] [2020-07-18 00:49:44,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:45,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-18 00:49:45,154 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25#true} {25#true} #45#return; {25#true} is VALID [2020-07-18 00:49:45,156 INFO L263 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2020-07-18 00:49:45,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-18 00:49:45,157 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #45#return; {25#true} is VALID [2020-07-18 00:49:45,158 INFO L263 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret1 := main(); {25#true} is VALID [2020-07-18 00:49:45,158 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~i~0; {25#true} is VALID [2020-07-18 00:49:45,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#true} ~i~0 := 0; {29#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:45,162 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#(<= main_~i~0 0)} assume !(~i~0 < 1000000); {26#false} is VALID [2020-07-18 00:49:45,162 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-18 00:49:45,163 INFO L280 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2020-07-18 00:49:45,163 INFO L280 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2020-07-18 00:49:45,166 INFO L280 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-18 00:49:45,168 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-18 00:49:45,177 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:45,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [292810296] [2020-07-18 00:49:45,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:45,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:49:45,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129156263] [2020-07-18 00:49:45,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-18 00:49:45,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:45,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:49:45,229 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-18 00:49:45,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:49:45,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:45,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:49:45,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:49:45,243 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-07-18 00:49:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:45,429 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-18 00:49:45,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:49:45,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-18 00:49:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:49:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-18 00:49:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:49:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-18 00:49:45,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2020-07-18 00:49:45,573 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-18 00:49:45,594 INFO L225 Difference]: With dead ends: 37 [2020-07-18 00:49:45,595 INFO L226 Difference]: Without dead ends: 18 [2020-07-18 00:49:45,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:49:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-18 00:49:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-07-18 00:49:45,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:45,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 16 states. [2020-07-18 00:49:45,666 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 16 states. [2020-07-18 00:49:45,666 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 16 states. [2020-07-18 00:49:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:45,675 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-18 00:49:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-18 00:49:45,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:45,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:45,676 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 18 states. [2020-07-18 00:49:45,676 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 18 states. [2020-07-18 00:49:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:45,683 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-18 00:49:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-18 00:49:45,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:45,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:45,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:45,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:49:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-18 00:49:45,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2020-07-18 00:49:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:45,702 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-18 00:49:45,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:49:45,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2020-07-18 00:49:45,737 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-18 00:49:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-18 00:49:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 00:49:45,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:45,739 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:45,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:49:45,740 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1625616653, now seen corresponding path program 1 times [2020-07-18 00:49:45,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:45,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2098198916] [2020-07-18 00:49:45,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:48,121 INFO L280 TraceCheckUtils]: 0: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-18 00:49:48,121 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {174#true} {174#true} #45#return; {174#true} is VALID [2020-07-18 00:49:48,122 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2020-07-18 00:49:48,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-18 00:49:48,122 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {174#true} {174#true} #45#return; {174#true} is VALID [2020-07-18 00:49:48,123 INFO L263 TraceCheckUtils]: 3: Hoare triple {174#true} call #t~ret1 := main(); {174#true} is VALID [2020-07-18 00:49:48,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} havoc ~i~0; {174#true} is VALID [2020-07-18 00:49:48,137 INFO L280 TraceCheckUtils]: 5: Hoare triple {174#true} ~i~0 := 0; {178#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:48,142 INFO L280 TraceCheckUtils]: 6: Hoare triple {178#(<= main_~i~0 0)} [51] L15-6-->L15-7_primed: Formula: (or (and (<= (+ v_oct_main_~i~0_in_1 2) v_oct_main_~i~0_out_1) (<= v_oct_main_~i~0_in_1 999999) (<= v_oct_main_~i~0_out_1 1000000) (<= v_oct_main_~i~0_in_1 999998) (<= v_oct_main_~i~0_out_1 1000001)) (and (<= (* 2 v_oct_main_~i~0_in_1) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_1) v_oct_main_~i~0_in_1) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_1) v_oct_main_~i~0_out_1) 1))) 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-18 00:49:48,143 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-18 00:49:48,146 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-18 00:49:48,147 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-18 00:49:48,148 INFO L280 TraceCheckUtils]: 10: Hoare triple {182#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {175#false} is VALID [2020-07-18 00:49:48,149 INFO L280 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-18 00:49:48,150 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-18 00:49:48,227 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:48,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2098198916] [2020-07-18 00:49:48,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:48,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:49:48,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138281220] [2020-07-18 00:49:48,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-18 00:49:48,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:48,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:49:48,255 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-18 00:49:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:49:48,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:49:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:49:48,257 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2020-07-18 00:49:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:48,470 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-18 00:49:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:49:48,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-18 00:49:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-18 00:49:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-18 00:49:48,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2020-07-18 00:49:48,512 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-18 00:49:48,515 INFO L225 Difference]: With dead ends: 27 [2020-07-18 00:49:48,515 INFO L226 Difference]: Without dead ends: 22 [2020-07-18 00:49:48,517 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-18 00:49:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-18 00:49:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-18 00:49:48,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:48,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2020-07-18 00:49:48,539 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2020-07-18 00:49:48,539 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2020-07-18 00:49:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:48,544 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-18 00:49:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-18 00:49:48,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:48,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:48,546 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2020-07-18 00:49:48,546 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2020-07-18 00:49:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:48,549 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-18 00:49:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-18 00:49:48,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:48,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:48,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:48,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:49:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-18 00:49:48,554 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2020-07-18 00:49:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:48,554 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-18 00:49:48,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:49:48,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2020-07-18 00:49:48,577 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-18 00:49:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-18 00:49:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-18 00:49:48,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:48,579 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:48,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:49:48,580 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:48,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1174316682, now seen corresponding path program 2 times [2020-07-18 00:49:48,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:48,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1636078867] [2020-07-18 00:49:48,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:50,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-18 00:49:50,805 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {326#true} {326#true} #45#return; {326#true} is VALID [2020-07-18 00:49:50,805 INFO L263 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2020-07-18 00:49:50,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-18 00:49:50,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {326#true} {326#true} #45#return; {326#true} is VALID [2020-07-18 00:49:50,806 INFO L263 TraceCheckUtils]: 3: Hoare triple {326#true} call #t~ret1 := main(); {326#true} is VALID [2020-07-18 00:49:50,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {326#true} havoc ~i~0; {326#true} is VALID [2020-07-18 00:49:50,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#true} ~i~0 := 0; {330#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:50,809 INFO L280 TraceCheckUtils]: 6: Hoare triple {330#(<= main_~i~0 0)} [53] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_2 999999) (<= (+ v_oct_main_~i~0_in_2 2) 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)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_2) v_oct_main_~i~0_in_2) (- 1)) (<= (* 2 v_oct_main_~i~0_in_2) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_2) v_oct_main_~i~0_out_2) 1))) 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-18 00:49:50,810 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-18 00:49:50,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-18 00:49:50,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-18 00:49:50,814 INFO L280 TraceCheckUtils]: 10: Hoare triple {334#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {327#false} is VALID [2020-07-18 00:49:50,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-18 00:49:50,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-18 00:49:50,951 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:50,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1636078867] [2020-07-18 00:49:50,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:50,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:49:50,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897370230] [2020-07-18 00:49:50,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-07-18 00:49:50,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:50,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 00:49:50,980 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-18 00:49:50,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 00:49:50,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 00:49:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:49:50,982 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2020-07-18 00:49:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:51,213 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-18 00:49:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:49:51,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-07-18 00:49:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:49:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-18 00:49:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:49:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-18 00:49:51,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2020-07-18 00:49:51,269 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-18 00:49:51,270 INFO L225 Difference]: With dead ends: 31 [2020-07-18 00:49:51,271 INFO L226 Difference]: Without dead ends: 26 [2020-07-18 00:49:51,273 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-18 00:49:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-18 00:49:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-18 00:49:51,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:51,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-18 00:49:51,303 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-18 00:49:51,304 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-18 00:49:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:51,307 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-18 00:49:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-18 00:49:51,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:51,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:51,308 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-18 00:49:51,309 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-18 00:49:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:51,311 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-18 00:49:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-18 00:49:51,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:51,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:51,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:51,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-18 00:49:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2020-07-18 00:49:51,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2020-07-18 00:49:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:51,320 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2020-07-18 00:49:51,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 00:49:51,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2020-07-18 00:49:51,347 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-18 00:49:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-18 00:49:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-18 00:49:51,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:51,349 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:51,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:49:51,350 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:51,351 INFO L82 PathProgramCache]: Analyzing trace with hash -199797369, now seen corresponding path program 3 times [2020-07-18 00:49:51,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:51,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [855287428] [2020-07-18 00:49:51,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:53,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-18 00:49:53,570 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {505#true} {505#true} #45#return; {505#true} is VALID [2020-07-18 00:49:53,570 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2020-07-18 00:49:53,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-18 00:49:53,571 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {505#true} {505#true} #45#return; {505#true} is VALID [2020-07-18 00:49:53,571 INFO L263 TraceCheckUtils]: 3: Hoare triple {505#true} call #t~ret1 := main(); {505#true} is VALID [2020-07-18 00:49:53,571 INFO L280 TraceCheckUtils]: 4: Hoare triple {505#true} havoc ~i~0; {505#true} is VALID [2020-07-18 00:49:53,572 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} ~i~0 := 0; {509#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:53,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {509#(<= main_~i~0 0)} [55] L15-6-->L15-7_primed: Formula: (or (and (<= (+ v_oct_main_~i~0_in_3 2) 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)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_3) v_oct_main_~i~0_in_3) (- 1)) (<= (* 2 v_oct_main_~i~0_in_3) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_3) v_oct_main_~i~0_out_3) 1))) 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-18 00:49:53,576 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-18 00:49:53,577 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-18 00:49:53,578 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-18 00:49:53,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {513#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {506#false} is VALID [2020-07-18 00:49:53,579 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-18 00:49:53,580 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-18 00:49:53,813 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:53,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [855287428] [2020-07-18 00:49:53,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:53,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:49:53,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726821968] [2020-07-18 00:49:53,814 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-07-18 00:49:53,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:53,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:49:53,846 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-18 00:49:53,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:49:53,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:49:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:49:53,847 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 15 states. [2020-07-18 00:49:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:54,151 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-18 00:49:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:49:54,152 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-07-18 00:49:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:49:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2020-07-18 00:49:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:49:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2020-07-18 00:49:54,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 35 transitions. [2020-07-18 00:49:54,197 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-18 00:49:54,199 INFO L225 Difference]: With dead ends: 35 [2020-07-18 00:49:54,199 INFO L226 Difference]: Without dead ends: 30 [2020-07-18 00:49:54,200 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-18 00:49:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-18 00:49:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-18 00:49:54,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:54,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-18 00:49:54,231 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-18 00:49:54,231 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-18 00:49:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:54,234 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-07-18 00:49:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2020-07-18 00:49:54,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:54,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:54,235 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-18 00:49:54,235 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-18 00:49:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:54,238 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-07-18 00:49:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2020-07-18 00:49:54,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:54,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:54,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:54,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 00:49:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-18 00:49:54,241 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 23 [2020-07-18 00:49:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:54,241 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-18 00:49:54,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:49:54,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-18 00:49:54,278 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-18 00:49:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-18 00:49:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:49:54,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:54,281 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:54,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:49:54,281 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2014723588, now seen corresponding path program 4 times [2020-07-18 00:49:54,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:54,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099575545] [2020-07-18 00:49:54,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:56,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-18 00:49:56,472 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {711#true} {711#true} #45#return; {711#true} is VALID [2020-07-18 00:49:56,472 INFO L263 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {711#true} is VALID [2020-07-18 00:49:56,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-18 00:49:56,473 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {711#true} {711#true} #45#return; {711#true} is VALID [2020-07-18 00:49:56,473 INFO L263 TraceCheckUtils]: 3: Hoare triple {711#true} call #t~ret1 := main(); {711#true} is VALID [2020-07-18 00:49:56,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {711#true} havoc ~i~0; {711#true} is VALID [2020-07-18 00:49:56,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {711#true} ~i~0 := 0; {715#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:56,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {715#(<= main_~i~0 0)} [57] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_out_4) v_oct_main_~i~0_in_4) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_4) v_oct_main_~i~0_out_4) 1) (<= (* 2 v_oct_main_~i~0_in_4) 1999998)) (and (<= (+ v_oct_main_~i~0_in_4 2) 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-18 00:49:56,476 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-18 00:49:56,477 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-18 00:49:56,478 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-18 00:49:56,478 INFO L280 TraceCheckUtils]: 10: Hoare triple {719#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {712#false} is VALID [2020-07-18 00:49:56,478 INFO L280 TraceCheckUtils]: 11: Hoare triple {712#false} assume !false; {712#false} is VALID [2020-07-18 00:49:56,479 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-18 00:49:56,774 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:56,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099575545] [2020-07-18 00:49:56,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:56,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-18 00:49:56,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113516335] [2020-07-18 00:49:56,776 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-07-18 00:49:56,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:56,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-18 00:49:56,825 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-18 00:49:56,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-18 00:49:56,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-18 00:49:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-07-18 00:49:56,827 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 18 states. [2020-07-18 00:49:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:57,156 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-18 00:49:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-18 00:49:57,156 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-07-18 00:49:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-18 00:49:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2020-07-18 00:49:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-18 00:49:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2020-07-18 00:49:57,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 39 transitions. [2020-07-18 00:49:57,200 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-18 00:49:57,202 INFO L225 Difference]: With dead ends: 39 [2020-07-18 00:49:57,203 INFO L226 Difference]: Without dead ends: 34 [2020-07-18 00:49:57,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-07-18 00:49:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-18 00:49:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-18 00:49:57,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:57,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-18 00:49:57,242 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-18 00:49:57,242 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-18 00:49:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:57,248 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-18 00:49:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-18 00:49:57,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:57,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:57,250 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-18 00:49:57,250 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-18 00:49:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:57,255 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-18 00:49:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-18 00:49:57,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:57,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:57,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:57,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 00:49:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-07-18 00:49:57,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 27 [2020-07-18 00:49:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:57,260 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-07-18 00:49:57,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-18 00:49:57,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2020-07-18 00:49:57,294 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-18 00:49:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-18 00:49:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 00:49:57,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:57,295 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:57,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:49:57,296 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1723686911, now seen corresponding path program 5 times [2020-07-18 00:49:57,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:57,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370214538] [2020-07-18 00:49:57,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:59,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {944#true} assume true; {944#true} is VALID [2020-07-18 00:49:59,501 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {944#true} {944#true} #45#return; {944#true} is VALID [2020-07-18 00:49:59,502 INFO L263 TraceCheckUtils]: 0: Hoare triple {944#true} call ULTIMATE.init(); {944#true} is VALID [2020-07-18 00:49:59,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {944#true} assume true; {944#true} is VALID [2020-07-18 00:49:59,502 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {944#true} {944#true} #45#return; {944#true} is VALID [2020-07-18 00:49:59,503 INFO L263 TraceCheckUtils]: 3: Hoare triple {944#true} call #t~ret1 := main(); {944#true} is VALID [2020-07-18 00:49:59,503 INFO L280 TraceCheckUtils]: 4: Hoare triple {944#true} havoc ~i~0; {944#true} is VALID [2020-07-18 00:49:59,504 INFO L280 TraceCheckUtils]: 5: Hoare triple {944#true} ~i~0 := 0; {948#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:59,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {948#(<= main_~i~0 0)} [59] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_out_5 1000001) (<= (+ v_oct_main_~i~0_in_5 2) 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)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_5) v_oct_main_~i~0_in_5) (- 1)) (<= (* 2 v_oct_main_~i~0_in_5) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_5) v_oct_main_~i~0_out_5) 1))) 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-18 00:49:59,506 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-18 00:49:59,507 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-18 00:49:59,508 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-18 00:49:59,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {952#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {945#false} is VALID [2020-07-18 00:49:59,509 INFO L280 TraceCheckUtils]: 11: Hoare triple {945#false} assume !false; {945#false} is VALID [2020-07-18 00:49:59,509 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-18 00:49:59,861 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:59,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370214538] [2020-07-18 00:49:59,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:59,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-07-18 00:49:59,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631296378] [2020-07-18 00:49:59,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2020-07-18 00:49:59,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:59,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-18 00:49:59,904 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-18 00:49:59,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-18 00:49:59,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-18 00:49:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2020-07-18 00:49:59,905 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 21 states. [2020-07-18 00:50:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:00,190 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-18 00:50:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 00:50:00,190 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2020-07-18 00:50:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-18 00:50:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-18 00:50:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-18 00:50:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-18 00:50:00,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 43 transitions. [2020-07-18 00:50:00,246 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-18 00:50:00,248 INFO L225 Difference]: With dead ends: 43 [2020-07-18 00:50:00,249 INFO L226 Difference]: Without dead ends: 38 [2020-07-18 00:50:00,250 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-18 00:50:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-18 00:50:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-18 00:50:00,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:00,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-18 00:50:00,289 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-18 00:50:00,289 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-18 00:50:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:00,291 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-18 00:50:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-18 00:50:00,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:00,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:00,292 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-18 00:50:00,292 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-18 00:50:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:00,295 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-18 00:50:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-18 00:50:00,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:00,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:00,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:00,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-18 00:50:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-07-18 00:50:00,298 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2020-07-18 00:50:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:00,298 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-07-18 00:50:00,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-18 00:50:00,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2020-07-18 00:50:00,333 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-18 00:50:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-18 00:50:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:50:00,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:00,334 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:00,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:50:00,335 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:00,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1455178882, now seen corresponding path program 6 times [2020-07-18 00:50:00,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:00,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1431741912] [2020-07-18 00:50:00,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:02,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {1204#true} assume true; {1204#true} is VALID [2020-07-18 00:50:02,522 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1204#true} {1204#true} #45#return; {1204#true} is VALID [2020-07-18 00:50:02,522 INFO L263 TraceCheckUtils]: 0: Hoare triple {1204#true} call ULTIMATE.init(); {1204#true} is VALID [2020-07-18 00:50:02,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {1204#true} assume true; {1204#true} is VALID [2020-07-18 00:50:02,522 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1204#true} {1204#true} #45#return; {1204#true} is VALID [2020-07-18 00:50:02,523 INFO L263 TraceCheckUtils]: 3: Hoare triple {1204#true} call #t~ret1 := main(); {1204#true} is VALID [2020-07-18 00:50:02,523 INFO L280 TraceCheckUtils]: 4: Hoare triple {1204#true} havoc ~i~0; {1204#true} is VALID [2020-07-18 00:50:02,524 INFO L280 TraceCheckUtils]: 5: Hoare triple {1204#true} ~i~0 := 0; {1208#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:02,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {1208#(<= main_~i~0 0)} [61] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_out_6) v_oct_main_~i~0_in_6) (- 1)) (<= (* 2 v_oct_main_~i~0_in_6) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_6) v_oct_main_~i~0_out_6) 1)) (and (<= v_oct_main_~i~0_in_6 999998) (<= (+ v_oct_main_~i~0_in_6 2) 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-18 00:50:02,526 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-18 00:50:02,527 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-18 00:50:02,528 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-18 00:50:02,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {1212#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1205#false} is VALID [2020-07-18 00:50:02,529 INFO L280 TraceCheckUtils]: 11: Hoare triple {1205#false} assume !false; {1205#false} is VALID [2020-07-18 00:50:02,529 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-18 00:50:02,990 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:02,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1431741912] [2020-07-18 00:50:02,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:02,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-07-18 00:50:02,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978217530] [2020-07-18 00:50:02,991 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2020-07-18 00:50:02,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:02,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-18 00:50:03,053 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-18 00:50:03,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-18 00:50:03,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-18 00:50:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2020-07-18 00:50:03,055 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 24 states. [2020-07-18 00:50:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:03,462 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-18 00:50:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 00:50:03,463 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2020-07-18 00:50:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-18 00:50:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 47 transitions. [2020-07-18 00:50:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-18 00:50:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 47 transitions. [2020-07-18 00:50:03,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 47 transitions. [2020-07-18 00:50:03,521 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-18 00:50:03,523 INFO L225 Difference]: With dead ends: 47 [2020-07-18 00:50:03,523 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 00:50:03,526 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-18 00:50:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 00:50:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-18 00:50:03,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:03,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-18 00:50:03,569 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-18 00:50:03,569 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-18 00:50:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:03,572 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-18 00:50:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-18 00:50:03,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:03,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:03,573 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-18 00:50:03,573 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-18 00:50:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:03,576 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-18 00:50:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-18 00:50:03,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:03,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:03,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:03,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-18 00:50:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2020-07-18 00:50:03,579 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 35 [2020-07-18 00:50:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:03,579 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2020-07-18 00:50:03,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-18 00:50:03,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2020-07-18 00:50:03,618 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-18 00:50:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2020-07-18 00:50:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 00:50:03,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:03,619 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:03,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:50:03,620 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1411436667, now seen corresponding path program 7 times [2020-07-18 00:50:03,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:03,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907978063] [2020-07-18 00:50:03,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:05,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {1491#true} assume true; {1491#true} is VALID [2020-07-18 00:50:05,796 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1491#true} {1491#true} #45#return; {1491#true} is VALID [2020-07-18 00:50:05,796 INFO L263 TraceCheckUtils]: 0: Hoare triple {1491#true} call ULTIMATE.init(); {1491#true} is VALID [2020-07-18 00:50:05,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {1491#true} assume true; {1491#true} is VALID [2020-07-18 00:50:05,797 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1491#true} {1491#true} #45#return; {1491#true} is VALID [2020-07-18 00:50:05,797 INFO L263 TraceCheckUtils]: 3: Hoare triple {1491#true} call #t~ret1 := main(); {1491#true} is VALID [2020-07-18 00:50:05,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {1491#true} havoc ~i~0; {1491#true} is VALID [2020-07-18 00:50:05,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {1491#true} ~i~0 := 0; {1495#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:05,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {1495#(<= main_~i~0 0)} [63] L15-6-->L15-7_primed: Formula: (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) (<= (+ v_oct_main_~i~0_in_7 2) v_oct_main_~i~0_out_7)) (and (<= (* 2 v_oct_main_~i~0_in_7) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_7) v_oct_main_~i~0_out_7) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_7) v_oct_main_~i~0_in_7) (- 1)))) 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-18 00:50:05,804 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-18 00:50:05,805 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-18 00:50:05,805 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-18 00:50:05,806 INFO L280 TraceCheckUtils]: 10: Hoare triple {1499#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1492#false} is VALID [2020-07-18 00:50:05,806 INFO L280 TraceCheckUtils]: 11: Hoare triple {1492#false} assume !false; {1492#false} is VALID [2020-07-18 00:50:05,806 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-18 00:50:06,422 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:06,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907978063] [2020-07-18 00:50:06,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:06,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-07-18 00:50:06,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607226886] [2020-07-18 00:50:06,424 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2020-07-18 00:50:06,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:06,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2020-07-18 00:50:06,473 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-18 00:50:06,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-18 00:50:06,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:06,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-18 00:50:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2020-07-18 00:50:06,475 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 27 states. [2020-07-18 00:50:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:06,923 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-18 00:50:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-18 00:50:06,923 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2020-07-18 00:50:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-18 00:50:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2020-07-18 00:50:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-18 00:50:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2020-07-18 00:50:06,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 51 transitions. [2020-07-18 00:50:07,000 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-18 00:50:07,002 INFO L225 Difference]: With dead ends: 51 [2020-07-18 00:50:07,002 INFO L226 Difference]: Without dead ends: 46 [2020-07-18 00:50:07,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2020-07-18 00:50:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-18 00:50:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-18 00:50:07,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:07,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-18 00:50:07,043 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-18 00:50:07,043 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-18 00:50:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:07,046 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-18 00:50:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-18 00:50:07,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:07,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:07,047 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-18 00:50:07,047 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-18 00:50:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:07,049 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-18 00:50:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-18 00:50:07,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:07,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:07,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:07,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-18 00:50:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2020-07-18 00:50:07,051 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 39 [2020-07-18 00:50:07,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:07,052 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2020-07-18 00:50:07,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-18 00:50:07,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2020-07-18 00:50:07,109 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-18 00:50:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-18 00:50:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 00:50:07,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:07,111 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:07,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:50:07,112 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1883315960, now seen corresponding path program 8 times [2020-07-18 00:50:07,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:07,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5132137] [2020-07-18 00:50:07,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:09,247 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-07-18 00:50:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:09,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {1805#true} assume true; {1805#true} is VALID [2020-07-18 00:50:09,360 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1805#true} {1805#true} #45#return; {1805#true} is VALID [2020-07-18 00:50:09,360 INFO L263 TraceCheckUtils]: 0: Hoare triple {1805#true} call ULTIMATE.init(); {1805#true} is VALID [2020-07-18 00:50:09,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {1805#true} assume true; {1805#true} is VALID [2020-07-18 00:50:09,361 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1805#true} {1805#true} #45#return; {1805#true} is VALID [2020-07-18 00:50:09,361 INFO L263 TraceCheckUtils]: 3: Hoare triple {1805#true} call #t~ret1 := main(); {1805#true} is VALID [2020-07-18 00:50:09,361 INFO L280 TraceCheckUtils]: 4: Hoare triple {1805#true} havoc ~i~0; {1805#true} is VALID [2020-07-18 00:50:09,362 INFO L280 TraceCheckUtils]: 5: Hoare triple {1805#true} ~i~0 := 0; {1809#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:09,364 INFO L280 TraceCheckUtils]: 6: Hoare triple {1809#(<= main_~i~0 0)} [65] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_8) v_oct_main_~i~0_out_8) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_8) v_oct_main_~i~0_in_8) (- 1)) (<= (* 2 v_oct_main_~i~0_in_8) 1999998)) (and (<= (+ v_oct_main_~i~0_in_8 2) 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-18 00:50:09,364 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-18 00:50:09,373 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-18 00:50:09,374 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-18 00:50:09,374 INFO L280 TraceCheckUtils]: 10: Hoare triple {1813#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1806#false} is VALID [2020-07-18 00:50:09,375 INFO L280 TraceCheckUtils]: 11: Hoare triple {1806#false} assume !false; {1806#false} is VALID [2020-07-18 00:50:09,375 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-18 00:50:10,083 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:10,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5132137] [2020-07-18 00:50:10,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:10,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-07-18 00:50:10,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685254545] [2020-07-18 00:50:10,084 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2020-07-18 00:50:10,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:10,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2020-07-18 00:50:10,126 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-18 00:50:10,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-18 00:50:10,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:10,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-18 00:50:10,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2020-07-18 00:50:10,128 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 30 states. [2020-07-18 00:50:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:10,616 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-18 00:50:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-18 00:50:10,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2020-07-18 00:50:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 00:50:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. [2020-07-18 00:50:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 00:50:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. [2020-07-18 00:50:10,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 55 transitions. [2020-07-18 00:50:10,691 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-18 00:50:10,693 INFO L225 Difference]: With dead ends: 55 [2020-07-18 00:50:10,693 INFO L226 Difference]: Without dead ends: 50 [2020-07-18 00:50:10,697 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-18 00:50:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-18 00:50:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-18 00:50:10,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:10,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2020-07-18 00:50:10,742 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2020-07-18 00:50:10,742 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2020-07-18 00:50:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:10,745 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-18 00:50:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2020-07-18 00:50:10,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:10,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:10,745 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2020-07-18 00:50:10,745 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2020-07-18 00:50:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:10,747 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-18 00:50:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2020-07-18 00:50:10,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:10,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:10,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:10,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 00:50:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-07-18 00:50:10,749 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 43 [2020-07-18 00:50:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:10,750 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-07-18 00:50:10,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-18 00:50:10,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2020-07-18 00:50:10,800 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-18 00:50:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-18 00:50:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 00:50:10,801 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:10,802 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:10,802 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:50:10,802 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:10,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash -831789323, now seen corresponding path program 9 times [2020-07-18 00:50:10,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:10,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [385015286] [2020-07-18 00:50:10,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:12,955 INFO L280 TraceCheckUtils]: 0: Hoare triple {2146#true} assume true; {2146#true} is VALID [2020-07-18 00:50:12,956 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2146#true} {2146#true} #45#return; {2146#true} is VALID [2020-07-18 00:50:12,956 INFO L263 TraceCheckUtils]: 0: Hoare triple {2146#true} call ULTIMATE.init(); {2146#true} is VALID [2020-07-18 00:50:12,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {2146#true} assume true; {2146#true} is VALID [2020-07-18 00:50:12,956 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2146#true} {2146#true} #45#return; {2146#true} is VALID [2020-07-18 00:50:12,957 INFO L263 TraceCheckUtils]: 3: Hoare triple {2146#true} call #t~ret1 := main(); {2146#true} is VALID [2020-07-18 00:50:12,957 INFO L280 TraceCheckUtils]: 4: Hoare triple {2146#true} havoc ~i~0; {2146#true} is VALID [2020-07-18 00:50:12,959 INFO L280 TraceCheckUtils]: 5: Hoare triple {2146#true} ~i~0 := 0; {2150#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:12,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {2150#(<= main_~i~0 0)} [67] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_out_9) v_oct_main_~i~0_in_9) (- 1)) (<= (* 2 v_oct_main_~i~0_in_9) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_9) v_oct_main_~i~0_out_9) 1)) (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) (<= (+ v_oct_main_~i~0_in_9 2) 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-18 00:50:12,961 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-18 00:50:12,961 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-18 00:50:12,962 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-18 00:50:12,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {2154#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2147#false} is VALID [2020-07-18 00:50:12,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2020-07-18 00:50:12,963 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-18 00:50:13,788 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:13,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [385015286] [2020-07-18 00:50:13,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:13,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2020-07-18 00:50:13,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155956112] [2020-07-18 00:50:13,790 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2020-07-18 00:50:13,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:13,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2020-07-18 00:50:13,848 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-18 00:50:13,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-18 00:50:13,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:13,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-18 00:50:13,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2020-07-18 00:50:13,850 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2020-07-18 00:50:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:14,175 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-18 00:50:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-18 00:50:14,176 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2020-07-18 00:50:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-18 00:50:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2020-07-18 00:50:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-18 00:50:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2020-07-18 00:50:14,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 59 transitions. [2020-07-18 00:50:14,245 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-18 00:50:14,246 INFO L225 Difference]: With dead ends: 59 [2020-07-18 00:50:14,247 INFO L226 Difference]: Without dead ends: 54 [2020-07-18 00:50:14,249 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-18 00:50:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-18 00:50:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-07-18 00:50:14,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:14,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2020-07-18 00:50:14,300 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2020-07-18 00:50:14,301 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2020-07-18 00:50:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:14,303 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-18 00:50:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-07-18 00:50:14,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:14,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:14,303 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2020-07-18 00:50:14,304 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2020-07-18 00:50:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:14,305 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-18 00:50:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-07-18 00:50:14,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:14,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:14,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:14,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-18 00:50:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2020-07-18 00:50:14,308 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 47 [2020-07-18 00:50:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:14,308 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2020-07-18 00:50:14,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-18 00:50:14,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2020-07-18 00:50:14,362 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-18 00:50:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2020-07-18 00:50:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 00:50:14,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:14,364 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:14,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:50:14,364 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash 164128882, now seen corresponding path program 10 times [2020-07-18 00:50:14,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:14,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1783013627] [2020-07-18 00:50:14,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:16,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {2514#true} assume true; {2514#true} is VALID [2020-07-18 00:50:16,503 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2514#true} {2514#true} #45#return; {2514#true} is VALID [2020-07-18 00:50:16,503 INFO L263 TraceCheckUtils]: 0: Hoare triple {2514#true} call ULTIMATE.init(); {2514#true} is VALID [2020-07-18 00:50:16,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {2514#true} assume true; {2514#true} is VALID [2020-07-18 00:50:16,504 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2514#true} {2514#true} #45#return; {2514#true} is VALID [2020-07-18 00:50:16,504 INFO L263 TraceCheckUtils]: 3: Hoare triple {2514#true} call #t~ret1 := main(); {2514#true} is VALID [2020-07-18 00:50:16,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {2514#true} havoc ~i~0; {2514#true} is VALID [2020-07-18 00:50:16,504 INFO L280 TraceCheckUtils]: 5: Hoare triple {2514#true} ~i~0 := 0; {2518#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:16,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {2518#(<= main_~i~0 0)} [69] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_10) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_10) v_oct_main_~i~0_out_10) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_10) v_oct_main_~i~0_in_10) (- 1))) (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) (<= (+ v_oct_main_~i~0_in_10 2) v_oct_main_~i~0_out_10) (<= v_oct_main_~i~0_in_10 999998))) 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-18 00:50:16,506 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-18 00:50:16,507 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-18 00:50:16,507 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-18 00:50:16,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {2522#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2515#false} is VALID [2020-07-18 00:50:16,508 INFO L280 TraceCheckUtils]: 11: Hoare triple {2515#false} assume !false; {2515#false} is VALID [2020-07-18 00:50:16,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-18 00:50:17,455 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:17,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1783013627] [2020-07-18 00:50:17,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:17,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2020-07-18 00:50:17,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362020302] [2020-07-18 00:50:17,457 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2020-07-18 00:50:17,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:17,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2020-07-18 00:50:17,515 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-18 00:50:17,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-07-18 00:50:17,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-07-18 00:50:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=964, Unknown=0, NotChecked=0, Total=1332 [2020-07-18 00:50:17,517 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2020-07-18 00:50:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:18,063 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2020-07-18 00:50:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-18 00:50:18,063 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2020-07-18 00:50:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-18 00:50:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2020-07-18 00:50:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-18 00:50:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2020-07-18 00:50:18,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 63 transitions. [2020-07-18 00:50:18,138 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-18 00:50:18,139 INFO L225 Difference]: With dead ends: 63 [2020-07-18 00:50:18,139 INFO L226 Difference]: Without dead ends: 58 [2020-07-18 00:50:18,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=964, Unknown=0, NotChecked=0, Total=1332 [2020-07-18 00:50:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-18 00:50:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-07-18 00:50:18,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:18,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2020-07-18 00:50:18,200 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2020-07-18 00:50:18,200 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2020-07-18 00:50:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:18,202 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-18 00:50:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2020-07-18 00:50:18,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:18,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:18,203 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2020-07-18 00:50:18,203 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2020-07-18 00:50:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:18,205 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-18 00:50:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2020-07-18 00:50:18,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:18,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:18,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:18,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-18 00:50:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2020-07-18 00:50:18,207 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 51 [2020-07-18 00:50:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:18,207 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2020-07-18 00:50:18,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-07-18 00:50:18,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2020-07-18 00:50:18,267 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-18 00:50:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-07-18 00:50:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-18 00:50:18,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:18,269 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:18,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 00:50:18,270 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1474159471, now seen corresponding path program 11 times [2020-07-18 00:50:18,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:18,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872796847] [2020-07-18 00:50:18,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:20,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {2909#true} assume true; {2909#true} is VALID [2020-07-18 00:50:20,455 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2909#true} {2909#true} #45#return; {2909#true} is VALID [2020-07-18 00:50:20,455 INFO L263 TraceCheckUtils]: 0: Hoare triple {2909#true} call ULTIMATE.init(); {2909#true} is VALID [2020-07-18 00:50:20,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {2909#true} assume true; {2909#true} is VALID [2020-07-18 00:50:20,455 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2909#true} {2909#true} #45#return; {2909#true} is VALID [2020-07-18 00:50:20,456 INFO L263 TraceCheckUtils]: 3: Hoare triple {2909#true} call #t~ret1 := main(); {2909#true} is VALID [2020-07-18 00:50:20,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {2909#true} havoc ~i~0; {2909#true} is VALID [2020-07-18 00:50:20,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {2909#true} ~i~0 := 0; {2913#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:20,463 INFO L280 TraceCheckUtils]: 6: Hoare triple {2913#(<= main_~i~0 0)} [71] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_11 999999) (<= (+ v_oct_main_~i~0_in_11 2) 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)) (and (<= (+ (* (- 1) v_oct_main_~i~0_in_11) v_oct_main_~i~0_out_11) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_11) v_oct_main_~i~0_in_11) (- 1)) (<= (* 2 v_oct_main_~i~0_in_11) 1999998))) 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-18 00:50:20,463 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-18 00:50:20,464 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-18 00:50:20,465 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-18 00:50:20,466 INFO L280 TraceCheckUtils]: 10: Hoare triple {2917#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2910#false} is VALID [2020-07-18 00:50:20,466 INFO L280 TraceCheckUtils]: 11: Hoare triple {2910#false} assume !false; {2910#false} is VALID [2020-07-18 00:50:20,466 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-18 00:50:21,546 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:21,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872796847] [2020-07-18 00:50:21,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:21,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2020-07-18 00:50:21,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666542845] [2020-07-18 00:50:21,548 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 55 [2020-07-18 00:50:21,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:21,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2020-07-18 00:50:21,615 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-18 00:50:21,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-07-18 00:50:21,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:21,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-07-18 00:50:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=1129, Unknown=0, NotChecked=0, Total=1560 [2020-07-18 00:50:21,617 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 39 states. [2020-07-18 00:50:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:21,954 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2020-07-18 00:50:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-18 00:50:21,954 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 55 [2020-07-18 00:50:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-18 00:50:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 67 transitions. [2020-07-18 00:50:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-18 00:50:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 67 transitions. [2020-07-18 00:50:21,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 67 transitions. [2020-07-18 00:50:22,031 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-18 00:50:22,032 INFO L225 Difference]: With dead ends: 67 [2020-07-18 00:50:22,032 INFO L226 Difference]: Without dead ends: 62 [2020-07-18 00:50:22,033 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-18 00:50:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-18 00:50:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2020-07-18 00:50:22,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:22,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2020-07-18 00:50:22,097 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2020-07-18 00:50:22,097 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2020-07-18 00:50:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:22,099 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2020-07-18 00:50:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2020-07-18 00:50:22,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:22,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:22,099 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2020-07-18 00:50:22,099 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2020-07-18 00:50:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:22,101 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2020-07-18 00:50:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2020-07-18 00:50:22,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:22,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:22,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:22,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-18 00:50:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2020-07-18 00:50:22,103 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 55 [2020-07-18 00:50:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:22,103 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2020-07-18 00:50:22,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-07-18 00:50:22,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2020-07-18 00:50:22,186 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-18 00:50:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2020-07-18 00:50:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-18 00:50:22,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:22,187 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:22,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 00:50:22,187 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:22,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:22,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1486067692, now seen corresponding path program 12 times [2020-07-18 00:50:22,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:22,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [694212063] [2020-07-18 00:50:22,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:24,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {3331#true} assume true; {3331#true} is VALID [2020-07-18 00:50:24,328 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3331#true} {3331#true} #45#return; {3331#true} is VALID [2020-07-18 00:50:24,328 INFO L263 TraceCheckUtils]: 0: Hoare triple {3331#true} call ULTIMATE.init(); {3331#true} is VALID [2020-07-18 00:50:24,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {3331#true} assume true; {3331#true} is VALID [2020-07-18 00:50:24,329 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3331#true} {3331#true} #45#return; {3331#true} is VALID [2020-07-18 00:50:24,329 INFO L263 TraceCheckUtils]: 3: Hoare triple {3331#true} call #t~ret1 := main(); {3331#true} is VALID [2020-07-18 00:50:24,329 INFO L280 TraceCheckUtils]: 4: Hoare triple {3331#true} havoc ~i~0; {3331#true} is VALID [2020-07-18 00:50:24,330 INFO L280 TraceCheckUtils]: 5: Hoare triple {3331#true} ~i~0 := 0; {3335#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:24,331 INFO L280 TraceCheckUtils]: 6: Hoare triple {3335#(<= main_~i~0 0)} [73] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_out_12) v_oct_main_~i~0_in_12) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_12) v_oct_main_~i~0_out_12) 1) (<= (* 2 v_oct_main_~i~0_in_12) 1999998)) (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) (<= (+ v_oct_main_~i~0_in_12 2) 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-18 00:50:24,332 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-18 00:50:24,333 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-18 00:50:24,333 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-18 00:50:24,333 INFO L280 TraceCheckUtils]: 10: Hoare triple {3339#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3332#false} is VALID [2020-07-18 00:50:24,334 INFO L280 TraceCheckUtils]: 11: Hoare triple {3332#false} assume !false; {3332#false} is VALID [2020-07-18 00:50:24,334 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-18 00:50:25,550 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:25,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [694212063] [2020-07-18 00:50:25,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:25,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2020-07-18 00:50:25,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224734000] [2020-07-18 00:50:25,551 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 59 [2020-07-18 00:50:25,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:25,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2020-07-18 00:50:25,623 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-18 00:50:25,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-07-18 00:50:25,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:25,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-07-18 00:50:25,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1307, Unknown=0, NotChecked=0, Total=1806 [2020-07-18 00:50:25,625 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 42 states. [2020-07-18 00:50:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:26,250 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2020-07-18 00:50:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-18 00:50:26,250 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 59 [2020-07-18 00:50:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 00:50:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2020-07-18 00:50:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 00:50:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2020-07-18 00:50:26,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 71 transitions. [2020-07-18 00:50:26,336 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-18 00:50:26,338 INFO L225 Difference]: With dead ends: 71 [2020-07-18 00:50:26,338 INFO L226 Difference]: Without dead ends: 66 [2020-07-18 00:50:26,339 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-18 00:50:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-18 00:50:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-18 00:50:26,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:26,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-18 00:50:26,413 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-18 00:50:26,413 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-18 00:50:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:26,415 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2020-07-18 00:50:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2020-07-18 00:50:26,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:26,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:26,416 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-18 00:50:26,416 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-18 00:50:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:26,418 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2020-07-18 00:50:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2020-07-18 00:50:26,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:26,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:26,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:26,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-18 00:50:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2020-07-18 00:50:26,421 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 59 [2020-07-18 00:50:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:26,421 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2020-07-18 00:50:26,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-07-18 00:50:26,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2020-07-18 00:50:26,499 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-18 00:50:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2020-07-18 00:50:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 00:50:26,500 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:26,500 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:26,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 00:50:26,500 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:26,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:26,501 INFO L82 PathProgramCache]: Analyzing trace with hash -433011223, now seen corresponding path program 13 times [2020-07-18 00:50:26,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:26,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [7443822] [2020-07-18 00:50:26,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:28,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {3780#true} assume true; {3780#true} is VALID [2020-07-18 00:50:28,672 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3780#true} {3780#true} #45#return; {3780#true} is VALID [2020-07-18 00:50:28,672 INFO L263 TraceCheckUtils]: 0: Hoare triple {3780#true} call ULTIMATE.init(); {3780#true} is VALID [2020-07-18 00:50:28,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {3780#true} assume true; {3780#true} is VALID [2020-07-18 00:50:28,672 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3780#true} {3780#true} #45#return; {3780#true} is VALID [2020-07-18 00:50:28,672 INFO L263 TraceCheckUtils]: 3: Hoare triple {3780#true} call #t~ret1 := main(); {3780#true} is VALID [2020-07-18 00:50:28,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {3780#true} havoc ~i~0; {3780#true} is VALID [2020-07-18 00:50:28,673 INFO L280 TraceCheckUtils]: 5: Hoare triple {3780#true} ~i~0 := 0; {3784#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:28,674 INFO L280 TraceCheckUtils]: 6: Hoare triple {3784#(<= main_~i~0 0)} [75] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_13) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_13) v_oct_main_~i~0_out_13) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_13) v_oct_main_~i~0_in_13) (- 1))) (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) (<= (+ v_oct_main_~i~0_in_13 2) v_oct_main_~i~0_out_13) (<= v_oct_main_~i~0_in_13 999999))) 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-18 00:50:28,674 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-18 00:50:28,675 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-18 00:50:28,676 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-18 00:50:28,677 INFO L280 TraceCheckUtils]: 10: Hoare triple {3788#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3781#false} is VALID [2020-07-18 00:50:28,677 INFO L280 TraceCheckUtils]: 11: Hoare triple {3781#false} assume !false; {3781#false} is VALID [2020-07-18 00:50:28,677 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-18 00:50:30,156 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:30,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [7443822] [2020-07-18 00:50:30,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:30,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2020-07-18 00:50:30,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548803974] [2020-07-18 00:50:30,157 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 63 [2020-07-18 00:50:30,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:30,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2020-07-18 00:50:30,245 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-18 00:50:30,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-07-18 00:50:30,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-07-18 00:50:30,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2020-07-18 00:50:30,247 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 45 states. [2020-07-18 00:50:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:30,966 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2020-07-18 00:50:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-18 00:50:30,967 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 63 [2020-07-18 00:50:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-18 00:50:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 75 transitions. [2020-07-18 00:50:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-18 00:50:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 75 transitions. [2020-07-18 00:50:30,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 75 transitions. [2020-07-18 00:50:31,068 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-18 00:50:31,069 INFO L225 Difference]: With dead ends: 75 [2020-07-18 00:50:31,070 INFO L226 Difference]: Without dead ends: 70 [2020-07-18 00:50:31,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2020-07-18 00:50:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-18 00:50:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2020-07-18 00:50:31,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:31,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 68 states. [2020-07-18 00:50:31,138 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 68 states. [2020-07-18 00:50:31,138 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 68 states. [2020-07-18 00:50:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:31,140 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2020-07-18 00:50:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-18 00:50:31,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:31,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:31,141 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 70 states. [2020-07-18 00:50:31,141 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 70 states. [2020-07-18 00:50:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:31,142 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2020-07-18 00:50:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-18 00:50:31,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:31,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:31,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:31,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-18 00:50:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2020-07-18 00:50:31,145 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 63 [2020-07-18 00:50:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:31,145 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2020-07-18 00:50:31,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-07-18 00:50:31,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 68 transitions. [2020-07-18 00:50:31,218 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-18 00:50:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2020-07-18 00:50:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 00:50:31,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:31,219 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:31,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 00:50:31,220 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash -446911130, now seen corresponding path program 14 times [2020-07-18 00:50:31,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:31,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [952313765] [2020-07-18 00:50:31,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:33,715 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-07-18 00:50:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:33,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {4256#true} assume true; {4256#true} is VALID [2020-07-18 00:50:33,831 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4256#true} {4256#true} #45#return; {4256#true} is VALID [2020-07-18 00:50:33,831 INFO L263 TraceCheckUtils]: 0: Hoare triple {4256#true} call ULTIMATE.init(); {4256#true} is VALID [2020-07-18 00:50:33,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {4256#true} assume true; {4256#true} is VALID [2020-07-18 00:50:33,831 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4256#true} {4256#true} #45#return; {4256#true} is VALID [2020-07-18 00:50:33,832 INFO L263 TraceCheckUtils]: 3: Hoare triple {4256#true} call #t~ret1 := main(); {4256#true} is VALID [2020-07-18 00:50:33,832 INFO L280 TraceCheckUtils]: 4: Hoare triple {4256#true} havoc ~i~0; {4256#true} is VALID [2020-07-18 00:50:33,833 INFO L280 TraceCheckUtils]: 5: Hoare triple {4256#true} ~i~0 := 0; {4260#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:33,834 INFO L280 TraceCheckUtils]: 6: Hoare triple {4260#(<= main_~i~0 0)} [77] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_14 999999) (<= (+ v_oct_main_~i~0_in_14 2) v_oct_main_~i~0_out_14) (<= v_oct_main_~i~0_out_14 1000000) (<= v_oct_main_~i~0_in_14 999998) (<= v_oct_main_~i~0_out_14 1000001)) (and (<= (+ (* (- 1) v_oct_main_~i~0_in_14) v_oct_main_~i~0_out_14) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_14) v_oct_main_~i~0_in_14) (- 1)) (<= (* 2 v_oct_main_~i~0_in_14) 1999998))) 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-18 00:50:33,834 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-18 00:50:33,835 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-18 00:50:33,836 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-18 00:50:33,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {4264#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4257#false} is VALID [2020-07-18 00:50:33,838 INFO L280 TraceCheckUtils]: 11: Hoare triple {4257#false} assume !false; {4257#false} is VALID [2020-07-18 00:50:33,838 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-18 00:50:35,531 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:35,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [952313765] [2020-07-18 00:50:35,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:35,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2020-07-18 00:50:35,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620945870] [2020-07-18 00:50:35,533 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 67 [2020-07-18 00:50:35,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:35,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2020-07-18 00:50:35,624 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-18 00:50:35,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-07-18 00:50:35,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:35,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-07-18 00:50:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=1702, Unknown=0, NotChecked=0, Total=2352 [2020-07-18 00:50:35,626 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 48 states. [2020-07-18 00:50:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:36,151 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2020-07-18 00:50:36,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-07-18 00:50:36,151 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 67 [2020-07-18 00:50:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 00:50:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 79 transitions. [2020-07-18 00:50:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 00:50:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 79 transitions. [2020-07-18 00:50:36,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 79 transitions. [2020-07-18 00:50:36,261 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-18 00:50:36,263 INFO L225 Difference]: With dead ends: 79 [2020-07-18 00:50:36,263 INFO L226 Difference]: Without dead ends: 74 [2020-07-18 00:50:36,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=650, Invalid=1702, Unknown=0, NotChecked=0, Total=2352 [2020-07-18 00:50:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-18 00:50:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2020-07-18 00:50:36,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:36,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2020-07-18 00:50:36,351 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2020-07-18 00:50:36,351 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2020-07-18 00:50:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:36,354 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2020-07-18 00:50:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2020-07-18 00:50:36,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:36,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:36,355 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2020-07-18 00:50:36,355 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2020-07-18 00:50:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:36,359 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2020-07-18 00:50:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2020-07-18 00:50:36,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:36,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:36,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:36,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-18 00:50:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2020-07-18 00:50:36,362 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 67 [2020-07-18 00:50:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:36,363 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2020-07-18 00:50:36,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-07-18 00:50:36,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 72 transitions. [2020-07-18 00:50:36,450 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-18 00:50:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2020-07-18 00:50:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-18 00:50:36,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:36,452 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:36,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-18 00:50:36,452 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:36,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:36,453 INFO L82 PathProgramCache]: Analyzing trace with hash 354324067, now seen corresponding path program 15 times [2020-07-18 00:50:36,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:36,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [670897318] [2020-07-18 00:50:36,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:38,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {4759#true} assume true; {4759#true} is VALID [2020-07-18 00:50:38,647 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4759#true} {4759#true} #45#return; {4759#true} is VALID [2020-07-18 00:50:38,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {4759#true} call ULTIMATE.init(); {4759#true} is VALID [2020-07-18 00:50:38,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {4759#true} assume true; {4759#true} is VALID [2020-07-18 00:50:38,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4759#true} {4759#true} #45#return; {4759#true} is VALID [2020-07-18 00:50:38,648 INFO L263 TraceCheckUtils]: 3: Hoare triple {4759#true} call #t~ret1 := main(); {4759#true} is VALID [2020-07-18 00:50:38,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {4759#true} havoc ~i~0; {4759#true} is VALID [2020-07-18 00:50:38,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {4759#true} ~i~0 := 0; {4763#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:38,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {4763#(<= main_~i~0 0)} [79] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_15 999999) (<= v_oct_main_~i~0_out_15 1000000) (<= (+ v_oct_main_~i~0_in_15 2) v_oct_main_~i~0_out_15) (<= v_oct_main_~i~0_out_15 1000001) (<= v_oct_main_~i~0_in_15 999998)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_15) v_oct_main_~i~0_in_15) (- 1)) (<= (* 2 v_oct_main_~i~0_in_15) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_15) v_oct_main_~i~0_out_15) 1))) 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-18 00:50:38,650 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-18 00:50:38,651 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-18 00:50:38,652 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-18 00:50:38,652 INFO L280 TraceCheckUtils]: 10: Hoare triple {4767#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4760#false} is VALID [2020-07-18 00:50:38,652 INFO L280 TraceCheckUtils]: 11: Hoare triple {4760#false} assume !false; {4760#false} is VALID [2020-07-18 00:50:38,653 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-18 00:50:40,503 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:40,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [670897318] [2020-07-18 00:50:40,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:40,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2020-07-18 00:50:40,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070750055] [2020-07-18 00:50:40,505 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 71 [2020-07-18 00:50:40,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:40,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2020-07-18 00:50:40,595 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-18 00:50:40,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2020-07-18 00:50:40,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:40,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2020-07-18 00:50:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=1919, Unknown=0, NotChecked=0, Total=2652 [2020-07-18 00:50:40,597 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 51 states. [2020-07-18 00:50:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:41,412 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2020-07-18 00:50:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-07-18 00:50:41,412 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 71 [2020-07-18 00:50:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-18 00:50:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 83 transitions. [2020-07-18 00:50:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-18 00:50:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 83 transitions. [2020-07-18 00:50:41,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 83 transitions. [2020-07-18 00:50:41,511 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-18 00:50:41,512 INFO L225 Difference]: With dead ends: 83 [2020-07-18 00:50:41,513 INFO L226 Difference]: Without dead ends: 78 [2020-07-18 00:50:41,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=733, Invalid=1919, Unknown=0, NotChecked=0, Total=2652 [2020-07-18 00:50:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-18 00:50:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-18 00:50:41,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:41,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-18 00:50:41,615 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-18 00:50:41,615 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-18 00:50:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:41,617 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2020-07-18 00:50:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2020-07-18 00:50:41,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:41,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:41,618 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-18 00:50:41,618 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-18 00:50:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:41,620 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2020-07-18 00:50:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2020-07-18 00:50:41,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:41,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:41,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:41,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-18 00:50:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2020-07-18 00:50:41,623 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 71 [2020-07-18 00:50:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:41,623 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2020-07-18 00:50:41,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 51 states. [2020-07-18 00:50:41,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 76 transitions. [2020-07-18 00:50:41,716 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-18 00:50:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2020-07-18 00:50:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-18 00:50:41,718 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:41,718 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:41,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-18 00:50:41,718 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash -555898656, now seen corresponding path program 16 times [2020-07-18 00:50:41,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:41,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78465840] [2020-07-18 00:50:41,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:43,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {5289#true} assume true; {5289#true} is VALID [2020-07-18 00:50:43,884 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5289#true} {5289#true} #45#return; {5289#true} is VALID [2020-07-18 00:50:43,885 INFO L263 TraceCheckUtils]: 0: Hoare triple {5289#true} call ULTIMATE.init(); {5289#true} is VALID [2020-07-18 00:50:43,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {5289#true} assume true; {5289#true} is VALID [2020-07-18 00:50:43,885 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5289#true} {5289#true} #45#return; {5289#true} is VALID [2020-07-18 00:50:43,885 INFO L263 TraceCheckUtils]: 3: Hoare triple {5289#true} call #t~ret1 := main(); {5289#true} is VALID [2020-07-18 00:50:43,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {5289#true} havoc ~i~0; {5289#true} is VALID [2020-07-18 00:50:43,886 INFO L280 TraceCheckUtils]: 5: Hoare triple {5289#true} ~i~0 := 0; {5293#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:43,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {5293#(<= main_~i~0 0)} [81] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_out_16) v_oct_main_~i~0_in_16) (- 1)) (<= (* 2 v_oct_main_~i~0_in_16) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_16) v_oct_main_~i~0_out_16) 1)) (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) (<= (+ v_oct_main_~i~0_in_16 2) 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-18 00:50:43,888 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-18 00:50:43,888 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-18 00:50:43,889 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-18 00:50:43,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {5297#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5290#false} is VALID [2020-07-18 00:50:43,890 INFO L280 TraceCheckUtils]: 11: Hoare triple {5290#false} assume !false; {5290#false} is VALID [2020-07-18 00:50:43,890 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-18 00:50:45,885 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:45,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78465840] [2020-07-18 00:50:45,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:45,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2020-07-18 00:50:45,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20030611] [2020-07-18 00:50:45,887 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 75 [2020-07-18 00:50:45,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:45,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2020-07-18 00:50:45,982 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-18 00:50:45,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2020-07-18 00:50:45,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2020-07-18 00:50:45,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=2149, Unknown=0, NotChecked=0, Total=2970 [2020-07-18 00:50:45,985 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 54 states. [2020-07-18 00:50:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:46,913 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-07-18 00:50:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-07-18 00:50:46,913 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 75 [2020-07-18 00:50:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-18 00:50:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2020-07-18 00:50:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-18 00:50:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2020-07-18 00:50:46,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 87 transitions. [2020-07-18 00:50:47,025 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-18 00:50:47,027 INFO L225 Difference]: With dead ends: 87 [2020-07-18 00:50:47,028 INFO L226 Difference]: Without dead ends: 82 [2020-07-18 00:50:47,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=821, Invalid=2149, Unknown=0, NotChecked=0, Total=2970 [2020-07-18 00:50:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-18 00:50:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2020-07-18 00:50:47,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:47,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 80 states. [2020-07-18 00:50:47,099 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 80 states. [2020-07-18 00:50:47,100 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 80 states. [2020-07-18 00:50:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:47,102 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2020-07-18 00:50:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2020-07-18 00:50:47,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:47,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:47,103 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 82 states. [2020-07-18 00:50:47,103 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 82 states. [2020-07-18 00:50:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:47,106 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2020-07-18 00:50:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2020-07-18 00:50:47,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:47,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:47,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:47,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-18 00:50:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2020-07-18 00:50:47,110 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 75 [2020-07-18 00:50:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:47,110 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2020-07-18 00:50:47,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 54 states. [2020-07-18 00:50:47,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 80 transitions. [2020-07-18 00:50:47,213 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-18 00:50:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2020-07-18 00:50:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-18 00:50:47,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:47,214 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:47,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-18 00:50:47,215 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:47,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:47,215 INFO L82 PathProgramCache]: Analyzing trace with hash 643906781, now seen corresponding path program 17 times [2020-07-18 00:50:47,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:47,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [834842844] [2020-07-18 00:50:47,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:49,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {5846#true} assume true; {5846#true} is VALID [2020-07-18 00:50:49,374 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5846#true} {5846#true} #45#return; {5846#true} is VALID [2020-07-18 00:50:49,375 INFO L263 TraceCheckUtils]: 0: Hoare triple {5846#true} call ULTIMATE.init(); {5846#true} is VALID [2020-07-18 00:50:49,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {5846#true} assume true; {5846#true} is VALID [2020-07-18 00:50:49,375 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5846#true} {5846#true} #45#return; {5846#true} is VALID [2020-07-18 00:50:49,375 INFO L263 TraceCheckUtils]: 3: Hoare triple {5846#true} call #t~ret1 := main(); {5846#true} is VALID [2020-07-18 00:50:49,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {5846#true} havoc ~i~0; {5846#true} is VALID [2020-07-18 00:50:49,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {5846#true} ~i~0 := 0; {5850#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:49,377 INFO L280 TraceCheckUtils]: 6: Hoare triple {5850#(<= main_~i~0 0)} [83] L15-6-->L15-7_primed: Formula: (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) (<= (+ v_oct_main_~i~0_in_17 2) v_oct_main_~i~0_out_17)) (and (<= (+ (* (- 1) v_oct_main_~i~0_in_17) v_oct_main_~i~0_out_17) 1) (<= (* 2 v_oct_main_~i~0_in_17) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_17) v_oct_main_~i~0_in_17) (- 1)))) 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-18 00:50:49,377 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-18 00:50:49,378 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-18 00:50:49,379 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-18 00:50:49,380 INFO L280 TraceCheckUtils]: 10: Hoare triple {5854#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5847#false} is VALID [2020-07-18 00:50:49,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {5847#false} assume !false; {5847#false} is VALID [2020-07-18 00:50:49,381 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-18 00:50:51,601 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:51,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [834842844] [2020-07-18 00:50:51,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:51,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2020-07-18 00:50:51,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105261350] [2020-07-18 00:50:51,604 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2020-07-18 00:50:51,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:51,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2020-07-18 00:50:51,711 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-18 00:50:51,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2020-07-18 00:50:51,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:51,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2020-07-18 00:50:51,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=2392, Unknown=0, NotChecked=0, Total=3306 [2020-07-18 00:50:51,714 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 57 states. [2020-07-18 00:50:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:52,322 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2020-07-18 00:50:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-07-18 00:50:52,322 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2020-07-18 00:50:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-18 00:50:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-07-18 00:50:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-18 00:50:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-07-18 00:50:52,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 91 transitions. [2020-07-18 00:50:52,450 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-18 00:50:52,452 INFO L225 Difference]: With dead ends: 91 [2020-07-18 00:50:52,452 INFO L226 Difference]: Without dead ends: 86 [2020-07-18 00:50:52,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=914, Invalid=2392, Unknown=0, NotChecked=0, Total=3306 [2020-07-18 00:50:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-18 00:50:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2020-07-18 00:50:52,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:52,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2020-07-18 00:50:52,545 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2020-07-18 00:50:52,545 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2020-07-18 00:50:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:52,548 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2020-07-18 00:50:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2020-07-18 00:50:52,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:52,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:52,549 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2020-07-18 00:50:52,549 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2020-07-18 00:50:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:52,551 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2020-07-18 00:50:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2020-07-18 00:50:52,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:52,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:52,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:52,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-18 00:50:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2020-07-18 00:50:52,555 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 79 [2020-07-18 00:50:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:52,555 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2020-07-18 00:50:52,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 57 states. [2020-07-18 00:50:52,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 84 transitions. [2020-07-18 00:50:52,655 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-18 00:50:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2020-07-18 00:50:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-18 00:50:52,656 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:52,656 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:52,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-18 00:50:52,657 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash 433097306, now seen corresponding path program 18 times [2020-07-18 00:50:52,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:52,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1058175640] [2020-07-18 00:50:52,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:50:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:50:54,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {6430#true} assume true; {6430#true} is VALID [2020-07-18 00:50:54,807 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6430#true} {6430#true} #45#return; {6430#true} is VALID [2020-07-18 00:50:54,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {6430#true} call ULTIMATE.init(); {6430#true} is VALID [2020-07-18 00:50:54,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {6430#true} assume true; {6430#true} is VALID [2020-07-18 00:50:54,808 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6430#true} {6430#true} #45#return; {6430#true} is VALID [2020-07-18 00:50:54,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {6430#true} call #t~ret1 := main(); {6430#true} is VALID [2020-07-18 00:50:54,808 INFO L280 TraceCheckUtils]: 4: Hoare triple {6430#true} havoc ~i~0; {6430#true} is VALID [2020-07-18 00:50:54,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {6430#true} ~i~0 := 0; {6434#(<= main_~i~0 0)} is VALID [2020-07-18 00:50:54,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {6434#(<= main_~i~0 0)} [85] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_18) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_18) v_oct_main_~i~0_out_18) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_18) v_oct_main_~i~0_in_18) (- 1))) (and (<= v_oct_main_~i~0_in_18 999999) (<= v_oct_main_~i~0_in_18 999998) (<= v_oct_main_~i~0_out_18 1000000) (<= (+ v_oct_main_~i~0_in_18 2) 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-18 00:50:54,821 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-18 00:50:54,822 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-18 00:50:54,822 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-18 00:50:54,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {6438#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6431#false} is VALID [2020-07-18 00:50:54,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {6431#false} assume !false; {6431#false} is VALID [2020-07-18 00:50:54,824 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-18 00:50:57,275 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:50:57,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1058175640] [2020-07-18 00:50:57,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:50:57,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2020-07-18 00:50:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327489441] [2020-07-18 00:50:57,277 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 83 [2020-07-18 00:50:57,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:50:57,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2020-07-18 00:50:57,379 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-18 00:50:57,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-07-18 00:50:57,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:50:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-07-18 00:50:57,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=2648, Unknown=0, NotChecked=0, Total=3660 [2020-07-18 00:50:57,382 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 60 states. [2020-07-18 00:50:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:58,563 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2020-07-18 00:50:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2020-07-18 00:50:58,564 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 83 [2020-07-18 00:50:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:50:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-18 00:50:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 95 transitions. [2020-07-18 00:50:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-18 00:50:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 95 transitions. [2020-07-18 00:50:58,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 95 transitions. [2020-07-18 00:50:58,725 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-18 00:50:58,728 INFO L225 Difference]: With dead ends: 95 [2020-07-18 00:50:58,728 INFO L226 Difference]: Without dead ends: 90 [2020-07-18 00:50:58,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1012, Invalid=2648, Unknown=0, NotChecked=0, Total=3660 [2020-07-18 00:50:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-18 00:50:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2020-07-18 00:50:58,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:50:58,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2020-07-18 00:50:58,841 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2020-07-18 00:50:58,841 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2020-07-18 00:50:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:58,844 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2020-07-18 00:50:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2020-07-18 00:50:58,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:58,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:58,846 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2020-07-18 00:50:58,846 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2020-07-18 00:50:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:50:58,853 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2020-07-18 00:50:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2020-07-18 00:50:58,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:50:58,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:50:58,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:50:58,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:50:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-18 00:50:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2020-07-18 00:50:58,859 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 83 [2020-07-18 00:50:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:50:58,860 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2020-07-18 00:50:58,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-07-18 00:50:58,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 88 transitions. [2020-07-18 00:50:58,997 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-18 00:50:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2020-07-18 00:50:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-18 00:50:58,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:50:58,999 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:50:58,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-18 00:50:58,999 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:50:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:50:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash 28496215, now seen corresponding path program 19 times [2020-07-18 00:50:59,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:50:59,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [23332407] [2020-07-18 00:50:59,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:51:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:01,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {7041#true} assume true; {7041#true} is VALID [2020-07-18 00:51:01,164 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7041#true} {7041#true} #45#return; {7041#true} is VALID [2020-07-18 00:51:01,165 INFO L263 TraceCheckUtils]: 0: Hoare triple {7041#true} call ULTIMATE.init(); {7041#true} is VALID [2020-07-18 00:51:01,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {7041#true} assume true; {7041#true} is VALID [2020-07-18 00:51:01,165 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7041#true} {7041#true} #45#return; {7041#true} is VALID [2020-07-18 00:51:01,165 INFO L263 TraceCheckUtils]: 3: Hoare triple {7041#true} call #t~ret1 := main(); {7041#true} is VALID [2020-07-18 00:51:01,165 INFO L280 TraceCheckUtils]: 4: Hoare triple {7041#true} havoc ~i~0; {7041#true} is VALID [2020-07-18 00:51:01,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {7041#true} ~i~0 := 0; {7045#(<= main_~i~0 0)} is VALID [2020-07-18 00:51:01,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {7045#(<= main_~i~0 0)} [87] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_19) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_19) v_oct_main_~i~0_out_19) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_19) v_oct_main_~i~0_in_19) (- 1))) (and (<= v_oct_main_~i~0_in_19 999998) (<= (+ v_oct_main_~i~0_in_19 2) 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))) 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-18 00:51:01,167 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-18 00:51:01,168 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-18 00:51:01,169 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-18 00:51:01,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {7049#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7042#false} is VALID [2020-07-18 00:51:01,169 INFO L280 TraceCheckUtils]: 11: Hoare triple {7042#false} assume !false; {7042#false} is VALID [2020-07-18 00:51:01,169 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-18 00:51:03,766 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:51:03,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [23332407] [2020-07-18 00:51:03,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:51:03,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2020-07-18 00:51:03,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996391470] [2020-07-18 00:51:03,768 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 87 [2020-07-18 00:51:03,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:51:03,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2020-07-18 00:51:03,874 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-18 00:51:03,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2020-07-18 00:51:03,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:51:03,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2020-07-18 00:51:03,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1115, Invalid=2917, Unknown=0, NotChecked=0, Total=4032 [2020-07-18 00:51:03,877 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 63 states. [2020-07-18 00:51:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:04,889 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2020-07-18 00:51:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2020-07-18 00:51:04,889 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 87 [2020-07-18 00:51:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:51:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-18 00:51:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 99 transitions. [2020-07-18 00:51:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-18 00:51:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 99 transitions. [2020-07-18 00:51:04,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 99 transitions. [2020-07-18 00:51:05,016 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-18 00:51:05,018 INFO L225 Difference]: With dead ends: 99 [2020-07-18 00:51:05,018 INFO L226 Difference]: Without dead ends: 94 [2020-07-18 00:51:05,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1115, Invalid=2917, Unknown=0, NotChecked=0, Total=4032 [2020-07-18 00:51:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-18 00:51:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2020-07-18 00:51:05,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:51:05,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2020-07-18 00:51:05,110 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2020-07-18 00:51:05,110 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2020-07-18 00:51:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:05,113 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2020-07-18 00:51:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2020-07-18 00:51:05,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:05,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:05,114 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2020-07-18 00:51:05,114 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2020-07-18 00:51:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:05,116 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2020-07-18 00:51:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2020-07-18 00:51:05,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:05,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:05,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:51:05,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:51:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-18 00:51:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2020-07-18 00:51:05,118 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 87 [2020-07-18 00:51:05,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:51:05,119 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2020-07-18 00:51:05,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 63 states. [2020-07-18 00:51:05,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states and 92 transitions. [2020-07-18 00:51:05,227 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-18 00:51:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2020-07-18 00:51:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-18 00:51:05,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:51:05,228 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:51:05,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-18 00:51:05,228 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:51:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:51:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash 284119508, now seen corresponding path program 20 times [2020-07-18 00:51:05,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:51:05,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347518829] [2020-07-18 00:51:05,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:51:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:07,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {7679#true} assume true; {7679#true} is VALID [2020-07-18 00:51:07,447 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7679#true} {7679#true} #45#return; {7679#true} is VALID [2020-07-18 00:51:07,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {7679#true} call ULTIMATE.init(); {7679#true} is VALID [2020-07-18 00:51:07,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {7679#true} assume true; {7679#true} is VALID [2020-07-18 00:51:07,448 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7679#true} {7679#true} #45#return; {7679#true} is VALID [2020-07-18 00:51:07,448 INFO L263 TraceCheckUtils]: 3: Hoare triple {7679#true} call #t~ret1 := main(); {7679#true} is VALID [2020-07-18 00:51:07,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {7679#true} havoc ~i~0; {7679#true} is VALID [2020-07-18 00:51:07,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {7679#true} ~i~0 := 0; {7683#(<= main_~i~0 0)} is VALID [2020-07-18 00:51:07,450 INFO L280 TraceCheckUtils]: 6: Hoare triple {7683#(<= main_~i~0 0)} [89] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_20 999998) (<= (+ v_oct_main_~i~0_in_20 2) v_oct_main_~i~0_out_20) (<= v_oct_main_~i~0_out_20 1000001) (<= v_oct_main_~i~0_out_20 1000000) (<= v_oct_main_~i~0_in_20 999999)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_20) v_oct_main_~i~0_in_20) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_20) v_oct_main_~i~0_out_20) 1) (<= (* 2 v_oct_main_~i~0_in_20) 1999998))) 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-18 00:51:07,451 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-18 00:51:07,452 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-18 00:51:07,453 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-18 00:51:07,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {7687#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7680#false} is VALID [2020-07-18 00:51:07,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {7680#false} assume !false; {7680#false} is VALID [2020-07-18 00:51:07,454 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-18 00:51:10,325 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:51:10,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347518829] [2020-07-18 00:51:10,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:51:10,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2020-07-18 00:51:10,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953314410] [2020-07-18 00:51:10,327 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 91 [2020-07-18 00:51:10,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:51:10,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2020-07-18 00:51:10,448 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-18 00:51:10,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2020-07-18 00:51:10,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:51:10,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2020-07-18 00:51:10,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1223, Invalid=3199, Unknown=0, NotChecked=0, Total=4422 [2020-07-18 00:51:10,451 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 66 states. [2020-07-18 00:51:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:11,552 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2020-07-18 00:51:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-07-18 00:51:11,552 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 91 [2020-07-18 00:51:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:51:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-18 00:51:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 103 transitions. [2020-07-18 00:51:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-18 00:51:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 103 transitions. [2020-07-18 00:51:11,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 103 transitions. [2020-07-18 00:51:11,691 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-18 00:51:11,693 INFO L225 Difference]: With dead ends: 103 [2020-07-18 00:51:11,694 INFO L226 Difference]: Without dead ends: 98 [2020-07-18 00:51:11,694 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-18 00:51:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-18 00:51:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2020-07-18 00:51:11,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:51:11,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2020-07-18 00:51:11,793 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2020-07-18 00:51:11,793 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2020-07-18 00:51:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:11,795 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2020-07-18 00:51:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2020-07-18 00:51:11,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:11,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:11,796 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2020-07-18 00:51:11,796 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2020-07-18 00:51:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:11,797 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2020-07-18 00:51:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2020-07-18 00:51:11,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:11,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:11,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:51:11,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:51:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-18 00:51:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2020-07-18 00:51:11,799 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 91 [2020-07-18 00:51:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:51:11,800 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2020-07-18 00:51:11,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 66 states. [2020-07-18 00:51:11,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 96 transitions. [2020-07-18 00:51:11,905 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-18 00:51:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2020-07-18 00:51:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-07-18 00:51:11,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:51:11,907 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:51:11,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-18 00:51:11,907 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:51:11,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:51:11,907 INFO L82 PathProgramCache]: Analyzing trace with hash 885869521, now seen corresponding path program 21 times [2020-07-18 00:51:11,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:51:11,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931623534] [2020-07-18 00:51:11,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:51:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:14,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {8344#true} assume true; {8344#true} is VALID [2020-07-18 00:51:14,087 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8344#true} {8344#true} #45#return; {8344#true} is VALID [2020-07-18 00:51:14,087 INFO L263 TraceCheckUtils]: 0: Hoare triple {8344#true} call ULTIMATE.init(); {8344#true} is VALID [2020-07-18 00:51:14,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {8344#true} assume true; {8344#true} is VALID [2020-07-18 00:51:14,088 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8344#true} {8344#true} #45#return; {8344#true} is VALID [2020-07-18 00:51:14,088 INFO L263 TraceCheckUtils]: 3: Hoare triple {8344#true} call #t~ret1 := main(); {8344#true} is VALID [2020-07-18 00:51:14,088 INFO L280 TraceCheckUtils]: 4: Hoare triple {8344#true} havoc ~i~0; {8344#true} is VALID [2020-07-18 00:51:14,089 INFO L280 TraceCheckUtils]: 5: Hoare triple {8344#true} ~i~0 := 0; {8348#(<= main_~i~0 0)} is VALID [2020-07-18 00:51:14,090 INFO L280 TraceCheckUtils]: 6: Hoare triple {8348#(<= main_~i~0 0)} [91] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_out_21 1000001) (<= v_oct_main_~i~0_in_21 999998) (<= (+ v_oct_main_~i~0_in_21 2) v_oct_main_~i~0_out_21) (<= v_oct_main_~i~0_out_21 1000000) (<= v_oct_main_~i~0_in_21 999999)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_21) v_oct_main_~i~0_in_21) (- 1)) (<= (* 2 v_oct_main_~i~0_in_21) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_21) v_oct_main_~i~0_out_21) 1))) 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-18 00:51:14,090 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-18 00:51:14,091 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-18 00:51:14,092 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-18 00:51:14,092 INFO L280 TraceCheckUtils]: 10: Hoare triple {8352#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8345#false} is VALID [2020-07-18 00:51:14,092 INFO L280 TraceCheckUtils]: 11: Hoare triple {8345#false} assume !false; {8345#false} is VALID [2020-07-18 00:51:14,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-18 00:51:17,383 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:51:17,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931623534] [2020-07-18 00:51:17,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:51:17,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2020-07-18 00:51:17,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830123770] [2020-07-18 00:51:17,384 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 95 [2020-07-18 00:51:17,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:51:17,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states. [2020-07-18 00:51:17,513 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-18 00:51:17,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2020-07-18 00:51:17,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:51:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2020-07-18 00:51:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=3494, Unknown=0, NotChecked=0, Total=4830 [2020-07-18 00:51:17,515 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 69 states. [2020-07-18 00:51:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:18,754 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2020-07-18 00:51:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2020-07-18 00:51:18,754 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 95 [2020-07-18 00:51:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:51:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-18 00:51:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 107 transitions. [2020-07-18 00:51:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-18 00:51:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 107 transitions. [2020-07-18 00:51:18,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 107 transitions. [2020-07-18 00:51:18,889 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-18 00:51:18,891 INFO L225 Difference]: With dead ends: 107 [2020-07-18 00:51:18,891 INFO L226 Difference]: Without dead ends: 102 [2020-07-18 00:51:18,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1336, Invalid=3494, Unknown=0, NotChecked=0, Total=4830 [2020-07-18 00:51:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-18 00:51:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2020-07-18 00:51:18,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:51:18,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2020-07-18 00:51:18,996 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2020-07-18 00:51:18,996 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2020-07-18 00:51:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:18,998 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2020-07-18 00:51:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2020-07-18 00:51:18,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:18,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:18,999 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2020-07-18 00:51:18,999 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2020-07-18 00:51:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:19,001 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2020-07-18 00:51:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2020-07-18 00:51:19,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:19,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:19,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:51:19,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:51:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-18 00:51:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2020-07-18 00:51:19,004 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 95 [2020-07-18 00:51:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:51:19,004 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2020-07-18 00:51:19,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 69 states. [2020-07-18 00:51:19,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 100 transitions. [2020-07-18 00:51:19,147 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-18 00:51:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2020-07-18 00:51:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-18 00:51:19,148 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:51:19,148 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:51:19,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-18 00:51:19,149 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:51:19,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:51:19,149 INFO L82 PathProgramCache]: Analyzing trace with hash -453771442, now seen corresponding path program 22 times [2020-07-18 00:51:19,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:51:19,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966725329] [2020-07-18 00:51:19,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:51:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:21,310 INFO L280 TraceCheckUtils]: 0: Hoare triple {9036#true} assume true; {9036#true} is VALID [2020-07-18 00:51:21,310 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9036#true} {9036#true} #45#return; {9036#true} is VALID [2020-07-18 00:51:21,310 INFO L263 TraceCheckUtils]: 0: Hoare triple {9036#true} call ULTIMATE.init(); {9036#true} is VALID [2020-07-18 00:51:21,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {9036#true} assume true; {9036#true} is VALID [2020-07-18 00:51:21,311 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9036#true} {9036#true} #45#return; {9036#true} is VALID [2020-07-18 00:51:21,311 INFO L263 TraceCheckUtils]: 3: Hoare triple {9036#true} call #t~ret1 := main(); {9036#true} is VALID [2020-07-18 00:51:21,311 INFO L280 TraceCheckUtils]: 4: Hoare triple {9036#true} havoc ~i~0; {9036#true} is VALID [2020-07-18 00:51:21,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {9036#true} ~i~0 := 0; {9040#(<= main_~i~0 0)} is VALID [2020-07-18 00:51:21,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {9040#(<= main_~i~0 0)} [93] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_22) v_oct_main_~i~0_out_22) 1) (<= (* 2 v_oct_main_~i~0_in_22) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_22) v_oct_main_~i~0_in_22) (- 1))) (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) (<= (+ v_oct_main_~i~0_in_22 2) 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-18 00:51:21,313 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-18 00:51:21,314 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-18 00:51:21,314 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-18 00:51:21,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {9044#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {9037#false} is VALID [2020-07-18 00:51:21,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {9037#false} assume !false; {9037#false} is VALID [2020-07-18 00:51:21,315 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-18 00:51:24,755 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:51:24,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966725329] [2020-07-18 00:51:24,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:51:24,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2020-07-18 00:51:24,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696463019] [2020-07-18 00:51:24,756 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 99 [2020-07-18 00:51:24,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:51:24,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states. [2020-07-18 00:51:24,888 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-18 00:51:24,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2020-07-18 00:51:24,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:51:24,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2020-07-18 00:51:24,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1454, Invalid=3802, Unknown=0, NotChecked=0, Total=5256 [2020-07-18 00:51:24,890 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 72 states. [2020-07-18 00:51:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:25,625 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2020-07-18 00:51:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2020-07-18 00:51:25,625 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 99 [2020-07-18 00:51:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:51:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-18 00:51:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 111 transitions. [2020-07-18 00:51:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-18 00:51:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 111 transitions. [2020-07-18 00:51:25,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 111 transitions. [2020-07-18 00:51:25,770 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-18 00:51:25,773 INFO L225 Difference]: With dead ends: 111 [2020-07-18 00:51:25,773 INFO L226 Difference]: Without dead ends: 106 [2020-07-18 00:51:25,774 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2406 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1454, Invalid=3802, Unknown=0, NotChecked=0, Total=5256 [2020-07-18 00:51:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-07-18 00:51:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2020-07-18 00:51:25,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:51:25,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 104 states. [2020-07-18 00:51:25,874 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 104 states. [2020-07-18 00:51:25,874 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 104 states. [2020-07-18 00:51:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:25,875 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2020-07-18 00:51:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2020-07-18 00:51:25,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:25,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:25,876 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 106 states. [2020-07-18 00:51:25,876 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 106 states. [2020-07-18 00:51:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:25,877 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2020-07-18 00:51:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2020-07-18 00:51:25,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:25,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:25,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:51:25,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:51:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-18 00:51:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2020-07-18 00:51:25,879 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 99 [2020-07-18 00:51:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:51:25,879 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2020-07-18 00:51:25,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 72 states. [2020-07-18 00:51:25,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 104 states and 104 transitions. [2020-07-18 00:51:26,029 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-18 00:51:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2020-07-18 00:51:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-07-18 00:51:26,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:51:26,031 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:51:26,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-18 00:51:26,031 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:51:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:51:26,032 INFO L82 PathProgramCache]: Analyzing trace with hash -211112885, now seen corresponding path program 23 times [2020-07-18 00:51:26,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:51:26,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510606518] [2020-07-18 00:51:26,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:51:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:28,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {9755#true} assume true; {9755#true} is VALID [2020-07-18 00:51:28,267 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9755#true} {9755#true} #45#return; {9755#true} is VALID [2020-07-18 00:51:28,267 INFO L263 TraceCheckUtils]: 0: Hoare triple {9755#true} call ULTIMATE.init(); {9755#true} is VALID [2020-07-18 00:51:28,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {9755#true} assume true; {9755#true} is VALID [2020-07-18 00:51:28,267 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9755#true} {9755#true} #45#return; {9755#true} is VALID [2020-07-18 00:51:28,267 INFO L263 TraceCheckUtils]: 3: Hoare triple {9755#true} call #t~ret1 := main(); {9755#true} is VALID [2020-07-18 00:51:28,267 INFO L280 TraceCheckUtils]: 4: Hoare triple {9755#true} havoc ~i~0; {9755#true} is VALID [2020-07-18 00:51:28,268 INFO L280 TraceCheckUtils]: 5: Hoare triple {9755#true} ~i~0 := 0; {9759#(<= main_~i~0 0)} is VALID [2020-07-18 00:51:28,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {9759#(<= main_~i~0 0)} [95] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_23) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_23) v_oct_main_~i~0_in_23) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_23) v_oct_main_~i~0_out_23) 1)) (and (<= v_oct_main_~i~0_in_23 999999) (<= (+ v_oct_main_~i~0_in_23 2) v_oct_main_~i~0_out_23) (<= v_oct_main_~i~0_out_23 1000000) (<= v_oct_main_~i~0_out_23 1000001) (<= 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-18 00:51:28,270 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-18 00:51:28,270 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-18 00:51:28,271 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-18 00:51:28,271 INFO L280 TraceCheckUtils]: 10: Hoare triple {9763#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {9756#false} is VALID [2020-07-18 00:51:28,271 INFO L280 TraceCheckUtils]: 11: Hoare triple {9756#false} assume !false; {9756#false} is VALID [2020-07-18 00:51:28,272 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-18 00:51:31,968 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:51:31,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510606518] [2020-07-18 00:51:31,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:51:31,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2020-07-18 00:51:31,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469123835] [2020-07-18 00:51:31,970 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 103 [2020-07-18 00:51:31,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:51:31,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states. [2020-07-18 00:51:32,111 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-18 00:51:32,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2020-07-18 00:51:32,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:51:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2020-07-18 00:51:32,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1577, Invalid=4123, Unknown=0, NotChecked=0, Total=5700 [2020-07-18 00:51:32,113 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 75 states. [2020-07-18 00:51:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:33,378 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2020-07-18 00:51:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2020-07-18 00:51:33,378 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 103 [2020-07-18 00:51:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:51:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-18 00:51:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 115 transitions. [2020-07-18 00:51:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-18 00:51:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 115 transitions. [2020-07-18 00:51:33,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 115 transitions. [2020-07-18 00:51:33,521 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-18 00:51:33,523 INFO L225 Difference]: With dead ends: 115 [2020-07-18 00:51:33,523 INFO L226 Difference]: Without dead ends: 110 [2020-07-18 00:51:33,526 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-18 00:51:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-18 00:51:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2020-07-18 00:51:33,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:51:33,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2020-07-18 00:51:33,640 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2020-07-18 00:51:33,640 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2020-07-18 00:51:33,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:33,643 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2020-07-18 00:51:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2020-07-18 00:51:33,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:33,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:33,645 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2020-07-18 00:51:33,645 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2020-07-18 00:51:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:33,647 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2020-07-18 00:51:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2020-07-18 00:51:33,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:33,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:33,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:51:33,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:51:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-18 00:51:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2020-07-18 00:51:33,650 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 103 [2020-07-18 00:51:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:51:33,650 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2020-07-18 00:51:33,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 75 states. [2020-07-18 00:51:33,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 108 transitions. [2020-07-18 00:51:33,797 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-18 00:51:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2020-07-18 00:51:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-07-18 00:51:33,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:51:33,799 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:51:33,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-18 00:51:33,799 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:51:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:51:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1553502920, now seen corresponding path program 24 times [2020-07-18 00:51:33,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:51:33,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894274115] [2020-07-18 00:51:33,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:51:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:35,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {10501#true} assume true; {10501#true} is VALID [2020-07-18 00:51:35,974 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10501#true} {10501#true} #45#return; {10501#true} is VALID [2020-07-18 00:51:35,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {10501#true} call ULTIMATE.init(); {10501#true} is VALID [2020-07-18 00:51:35,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {10501#true} assume true; {10501#true} is VALID [2020-07-18 00:51:35,975 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10501#true} {10501#true} #45#return; {10501#true} is VALID [2020-07-18 00:51:35,976 INFO L263 TraceCheckUtils]: 3: Hoare triple {10501#true} call #t~ret1 := main(); {10501#true} is VALID [2020-07-18 00:51:35,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {10501#true} havoc ~i~0; {10501#true} is VALID [2020-07-18 00:51:35,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {10501#true} ~i~0 := 0; {10505#(<= main_~i~0 0)} is VALID [2020-07-18 00:51:35,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {10505#(<= main_~i~0 0)} [97] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_24) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_24) v_oct_main_~i~0_in_24) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_24) v_oct_main_~i~0_out_24) 1)) (and (<= v_oct_main_~i~0_in_24 999998) (<= v_oct_main_~i~0_out_24 1000001) (<= (+ v_oct_main_~i~0_in_24 2) 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-18 00:51:35,978 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-18 00:51:35,979 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-18 00:51:35,979 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-18 00:51:35,980 INFO L280 TraceCheckUtils]: 10: Hoare triple {10509#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {10502#false} is VALID [2020-07-18 00:51:35,980 INFO L280 TraceCheckUtils]: 11: Hoare triple {10502#false} assume !false; {10502#false} is VALID [2020-07-18 00:51:35,980 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-18 00:51:40,058 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:51:40,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894274115] [2020-07-18 00:51:40,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:51:40,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2020-07-18 00:51:40,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789219424] [2020-07-18 00:51:40,060 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 107 [2020-07-18 00:51:40,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:51:40,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states. [2020-07-18 00:51:40,219 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-18 00:51:40,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2020-07-18 00:51:40,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:51:40,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2020-07-18 00:51:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1705, Invalid=4457, Unknown=0, NotChecked=0, Total=6162 [2020-07-18 00:51:40,221 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 78 states. [2020-07-18 00:51:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:41,549 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2020-07-18 00:51:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2020-07-18 00:51:41,549 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 107 [2020-07-18 00:51:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:51:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-18 00:51:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 119 transitions. [2020-07-18 00:51:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-18 00:51:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 119 transitions. [2020-07-18 00:51:41,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 119 transitions. [2020-07-18 00:51:41,718 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-18 00:51:41,720 INFO L225 Difference]: With dead ends: 119 [2020-07-18 00:51:41,720 INFO L226 Difference]: Without dead ends: 114 [2020-07-18 00:51:41,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 6 SyntacticMatches, 25 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2864 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1705, Invalid=4457, Unknown=0, NotChecked=0, Total=6162 [2020-07-18 00:51:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-18 00:51:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2020-07-18 00:51:41,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:51:41,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2020-07-18 00:51:41,846 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2020-07-18 00:51:41,846 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2020-07-18 00:51:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:41,848 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2020-07-18 00:51:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2020-07-18 00:51:41,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:41,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:41,848 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2020-07-18 00:51:41,848 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2020-07-18 00:51:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:41,850 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2020-07-18 00:51:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2020-07-18 00:51:41,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:41,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:41,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:51:41,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:51:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-18 00:51:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2020-07-18 00:51:41,852 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 107 [2020-07-18 00:51:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:51:41,852 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2020-07-18 00:51:41,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 78 states. [2020-07-18 00:51:41,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 112 states and 112 transitions. [2020-07-18 00:51:42,007 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-18 00:51:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2020-07-18 00:51:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-18 00:51:42,009 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:51:42,009 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:51:42,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-18 00:51:42,009 INFO L427 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:51:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:51:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash 390394565, now seen corresponding path program 25 times [2020-07-18 00:51:42,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:51:42,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286681322] [2020-07-18 00:51:42,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:51:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:44,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {11274#true} assume true; {11274#true} is VALID [2020-07-18 00:51:44,180 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11274#true} {11274#true} #45#return; {11274#true} is VALID [2020-07-18 00:51:44,181 INFO L263 TraceCheckUtils]: 0: Hoare triple {11274#true} call ULTIMATE.init(); {11274#true} is VALID [2020-07-18 00:51:44,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {11274#true} assume true; {11274#true} is VALID [2020-07-18 00:51:44,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11274#true} {11274#true} #45#return; {11274#true} is VALID [2020-07-18 00:51:44,182 INFO L263 TraceCheckUtils]: 3: Hoare triple {11274#true} call #t~ret1 := main(); {11274#true} is VALID [2020-07-18 00:51:44,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {11274#true} havoc ~i~0; {11274#true} is VALID [2020-07-18 00:51:44,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {11274#true} ~i~0 := 0; {11278#(<= main_~i~0 0)} is VALID [2020-07-18 00:51:44,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {11278#(<= main_~i~0 0)} [99] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_25 999999) (<= v_oct_main_~i~0_out_25 1000000) (<= v_oct_main_~i~0_out_25 1000001) (<= v_oct_main_~i~0_in_25 999998) (<= (+ v_oct_main_~i~0_in_25 2) v_oct_main_~i~0_out_25)) (and (<= (+ (* (- 1) v_oct_main_~i~0_in_25) v_oct_main_~i~0_out_25) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_25) v_oct_main_~i~0_in_25) (- 1)) (<= (* 2 v_oct_main_~i~0_in_25) 1999998))) 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-18 00:51:44,185 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-18 00:51:44,187 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-18 00:51:44,187 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-18 00:51:44,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {11282#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {11275#false} is VALID [2020-07-18 00:51:44,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {11275#false} assume !false; {11275#false} is VALID [2020-07-18 00:51:44,189 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-18 00:51:48,607 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:51:48,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286681322] [2020-07-18 00:51:48,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:51:48,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2020-07-18 00:51:48,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510780856] [2020-07-18 00:51:48,609 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 111 [2020-07-18 00:51:48,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:51:48,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states. [2020-07-18 00:51:48,771 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-18 00:51:48,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2020-07-18 00:51:48,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:51:48,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2020-07-18 00:51:48,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1838, Invalid=4804, Unknown=0, NotChecked=0, Total=6642 [2020-07-18 00:51:48,773 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 81 states. [2020-07-18 00:51:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:50,152 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2020-07-18 00:51:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2020-07-18 00:51:50,152 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 111 [2020-07-18 00:51:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:51:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-18 00:51:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2020-07-18 00:51:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-18 00:51:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2020-07-18 00:51:50,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 123 transitions. [2020-07-18 00:51:50,328 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-18 00:51:50,330 INFO L225 Difference]: With dead ends: 123 [2020-07-18 00:51:50,330 INFO L226 Difference]: Without dead ends: 118 [2020-07-18 00:51:50,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3108 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1838, Invalid=4804, Unknown=0, NotChecked=0, Total=6642 [2020-07-18 00:51:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-18 00:51:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2020-07-18 00:51:50,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:51:50,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 116 states. [2020-07-18 00:51:50,446 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 116 states. [2020-07-18 00:51:50,446 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 116 states. [2020-07-18 00:51:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:50,448 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2020-07-18 00:51:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2020-07-18 00:51:50,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:50,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:50,449 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 118 states. [2020-07-18 00:51:50,449 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 118 states. [2020-07-18 00:51:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:50,451 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2020-07-18 00:51:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2020-07-18 00:51:50,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:50,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:50,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:51:50,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:51:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-07-18 00:51:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2020-07-18 00:51:50,454 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 111 [2020-07-18 00:51:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:51:50,454 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2020-07-18 00:51:50,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 81 states. [2020-07-18 00:51:50,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 116 states and 116 transitions. [2020-07-18 00:51:50,611 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-18 00:51:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2020-07-18 00:51:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-07-18 00:51:50,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:51:50,613 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:51:50,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-18 00:51:50,613 INFO L427 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:51:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:51:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash -459862974, now seen corresponding path program 26 times [2020-07-18 00:51:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:51:50,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1024526064] [2020-07-18 00:51:50,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:51:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:51:52,769 INFO L280 TraceCheckUtils]: 0: Hoare triple {12074#true} assume true; {12074#true} is VALID [2020-07-18 00:51:52,769 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12074#true} {12074#true} #45#return; {12074#true} is VALID [2020-07-18 00:51:52,770 INFO L263 TraceCheckUtils]: 0: Hoare triple {12074#true} call ULTIMATE.init(); {12074#true} is VALID [2020-07-18 00:51:52,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {12074#true} assume true; {12074#true} is VALID [2020-07-18 00:51:52,770 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12074#true} {12074#true} #45#return; {12074#true} is VALID [2020-07-18 00:51:52,770 INFO L263 TraceCheckUtils]: 3: Hoare triple {12074#true} call #t~ret1 := main(); {12074#true} is VALID [2020-07-18 00:51:52,770 INFO L280 TraceCheckUtils]: 4: Hoare triple {12074#true} havoc ~i~0; {12074#true} is VALID [2020-07-18 00:51:52,771 INFO L280 TraceCheckUtils]: 5: Hoare triple {12074#true} ~i~0 := 0; {12078#(<= main_~i~0 0)} is VALID [2020-07-18 00:51:52,772 INFO L280 TraceCheckUtils]: 6: Hoare triple {12078#(<= main_~i~0 0)} [101] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_out_26) v_oct_main_~i~0_in_26) (- 1)) (<= (* 2 v_oct_main_~i~0_in_26) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_26) v_oct_main_~i~0_out_26) 1)) (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) (<= (+ v_oct_main_~i~0_in_26 2) 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-18 00:51:52,773 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-18 00:51:52,774 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-18 00:51:52,774 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-18 00:51:52,775 INFO L280 TraceCheckUtils]: 10: Hoare triple {12082#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12075#false} is VALID [2020-07-18 00:51:52,775 INFO L280 TraceCheckUtils]: 11: Hoare triple {12075#false} assume !false; {12075#false} is VALID [2020-07-18 00:51:52,775 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-18 00:51:57,491 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:51:57,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1024526064] [2020-07-18 00:51:57,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:51:57,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2020-07-18 00:51:57,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743559070] [2020-07-18 00:51:57,492 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 115 [2020-07-18 00:51:57,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:51:57,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states. [2020-07-18 00:51:57,648 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-18 00:51:57,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2020-07-18 00:51:57,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:51:57,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2020-07-18 00:51:57,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1976, Invalid=5164, Unknown=0, NotChecked=0, Total=7140 [2020-07-18 00:51:57,650 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 84 states. [2020-07-18 00:51:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:58,767 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2020-07-18 00:51:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-07-18 00:51:58,767 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 115 [2020-07-18 00:51:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:51:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-18 00:51:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2020-07-18 00:51:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-18 00:51:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2020-07-18 00:51:58,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 127 transitions. [2020-07-18 00:51:58,947 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-18 00:51:58,949 INFO L225 Difference]: With dead ends: 127 [2020-07-18 00:51:58,950 INFO L226 Difference]: Without dead ends: 122 [2020-07-18 00:51:58,950 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-18 00:51:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-18 00:51:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2020-07-18 00:51:59,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:51:59,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2020-07-18 00:51:59,078 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2020-07-18 00:51:59,079 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2020-07-18 00:51:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:59,081 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2020-07-18 00:51:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2020-07-18 00:51:59,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:59,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:59,081 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2020-07-18 00:51:59,081 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2020-07-18 00:51:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:51:59,083 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2020-07-18 00:51:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2020-07-18 00:51:59,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:51:59,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:51:59,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:51:59,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:51:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-18 00:51:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2020-07-18 00:51:59,086 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 115 [2020-07-18 00:51:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:51:59,086 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2020-07-18 00:51:59,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 84 states. [2020-07-18 00:51:59,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 120 transitions. [2020-07-18 00:51:59,248 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-18 00:51:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2020-07-18 00:51:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-07-18 00:51:59,249 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:51:59,249 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:51:59,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-18 00:51:59,250 INFO L427 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:51:59,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:51:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash 538320703, now seen corresponding path program 27 times [2020-07-18 00:51:59,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:51:59,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [702936606] [2020-07-18 00:51:59,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:52:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:01,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {12901#true} assume true; {12901#true} is VALID [2020-07-18 00:52:01,423 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12901#true} {12901#true} #45#return; {12901#true} is VALID [2020-07-18 00:52:01,424 INFO L263 TraceCheckUtils]: 0: Hoare triple {12901#true} call ULTIMATE.init(); {12901#true} is VALID [2020-07-18 00:52:01,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {12901#true} assume true; {12901#true} is VALID [2020-07-18 00:52:01,424 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12901#true} {12901#true} #45#return; {12901#true} is VALID [2020-07-18 00:52:01,424 INFO L263 TraceCheckUtils]: 3: Hoare triple {12901#true} call #t~ret1 := main(); {12901#true} is VALID [2020-07-18 00:52:01,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {12901#true} havoc ~i~0; {12901#true} is VALID [2020-07-18 00:52:01,427 INFO L280 TraceCheckUtils]: 5: Hoare triple {12901#true} ~i~0 := 0; {12905#(<= main_~i~0 0)} is VALID [2020-07-18 00:52:01,430 INFO L280 TraceCheckUtils]: 6: Hoare triple {12905#(<= main_~i~0 0)} [103] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_out_27 1000000) (<= v_oct_main_~i~0_in_27 999999) (<= (+ v_oct_main_~i~0_in_27 2) v_oct_main_~i~0_out_27) (<= v_oct_main_~i~0_out_27 1000001) (<= v_oct_main_~i~0_in_27 999998)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_27) v_oct_main_~i~0_in_27) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_27) v_oct_main_~i~0_out_27) 1) (<= (* 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-18 00:52:01,431 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-18 00:52:01,431 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-18 00:52:01,432 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-18 00:52:01,432 INFO L280 TraceCheckUtils]: 10: Hoare triple {12909#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12902#false} is VALID [2020-07-18 00:52:01,432 INFO L280 TraceCheckUtils]: 11: Hoare triple {12902#false} assume !false; {12902#false} is VALID [2020-07-18 00:52:01,433 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-18 00:52:06,540 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:52:06,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [702936606] [2020-07-18 00:52:06,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:52:06,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2020-07-18 00:52:06,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836580042] [2020-07-18 00:52:06,542 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 119 [2020-07-18 00:52:06,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:52:06,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states. [2020-07-18 00:52:06,702 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-18 00:52:06,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2020-07-18 00:52:06,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:52:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2020-07-18 00:52:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2119, Invalid=5537, Unknown=0, NotChecked=0, Total=7656 [2020-07-18 00:52:06,704 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 87 states. [2020-07-18 00:52:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:07,990 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2020-07-18 00:52:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2020-07-18 00:52:07,990 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 119 [2020-07-18 00:52:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:52:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-18 00:52:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2020-07-18 00:52:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-18 00:52:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2020-07-18 00:52:07,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 131 transitions. [2020-07-18 00:52:08,168 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-18 00:52:08,170 INFO L225 Difference]: With dead ends: 131 [2020-07-18 00:52:08,171 INFO L226 Difference]: Without dead ends: 126 [2020-07-18 00:52:08,171 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-18 00:52:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-18 00:52:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2020-07-18 00:52:08,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:52:08,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 124 states. [2020-07-18 00:52:08,307 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 124 states. [2020-07-18 00:52:08,307 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 124 states. [2020-07-18 00:52:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:08,309 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2020-07-18 00:52:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2020-07-18 00:52:08,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:08,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:08,310 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 126 states. [2020-07-18 00:52:08,310 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 126 states. [2020-07-18 00:52:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:08,312 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2020-07-18 00:52:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2020-07-18 00:52:08,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:08,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:08,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:52:08,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:52:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-07-18 00:52:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2020-07-18 00:52:08,315 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 119 [2020-07-18 00:52:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:52:08,315 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2020-07-18 00:52:08,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 87 states. [2020-07-18 00:52:08,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 124 states and 124 transitions. [2020-07-18 00:52:08,481 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-18 00:52:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2020-07-18 00:52:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-18 00:52:08,482 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:52:08,482 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:52:08,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-18 00:52:08,483 INFO L427 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:52:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:52:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1884722244, now seen corresponding path program 28 times [2020-07-18 00:52:08,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:52:08,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [50301934] [2020-07-18 00:52:08,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:52:10,643 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-07-18 00:52:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:10,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {13755#true} assume true; {13755#true} is VALID [2020-07-18 00:52:10,760 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13755#true} {13755#true} #45#return; {13755#true} is VALID [2020-07-18 00:52:10,760 INFO L263 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13755#true} is VALID [2020-07-18 00:52:10,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {13755#true} assume true; {13755#true} is VALID [2020-07-18 00:52:10,761 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13755#true} {13755#true} #45#return; {13755#true} is VALID [2020-07-18 00:52:10,761 INFO L263 TraceCheckUtils]: 3: Hoare triple {13755#true} call #t~ret1 := main(); {13755#true} is VALID [2020-07-18 00:52:10,761 INFO L280 TraceCheckUtils]: 4: Hoare triple {13755#true} havoc ~i~0; {13755#true} is VALID [2020-07-18 00:52:10,766 INFO L280 TraceCheckUtils]: 5: Hoare triple {13755#true} ~i~0 := 0; {13759#(<= main_~i~0 0)} is VALID [2020-07-18 00:52:10,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {13759#(<= main_~i~0 0)} [105] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_28 999998) (<= v_oct_main_~i~0_out_28 1000000) (<= (+ v_oct_main_~i~0_in_28 2) v_oct_main_~i~0_out_28) (<= v_oct_main_~i~0_in_28 999999) (<= v_oct_main_~i~0_out_28 1000001)) (and (<= (+ (* (- 1) v_oct_main_~i~0_in_28) v_oct_main_~i~0_out_28) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_28) v_oct_main_~i~0_in_28) (- 1)) (<= (* 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-18 00:52:10,768 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-18 00:52:10,768 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-18 00:52:10,769 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-18 00:52:10,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {13763#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {13756#false} is VALID [2020-07-18 00:52:10,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2020-07-18 00:52:10,770 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-18 00:52:16,280 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:52:16,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [50301934] [2020-07-18 00:52:16,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:52:16,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2020-07-18 00:52:16,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54600418] [2020-07-18 00:52:16,282 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 123 [2020-07-18 00:52:16,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:52:16,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states. [2020-07-18 00:52:16,460 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-18 00:52:16,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2020-07-18 00:52:16,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:52:16,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2020-07-18 00:52:16,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2267, Invalid=5923, Unknown=0, NotChecked=0, Total=8190 [2020-07-18 00:52:16,462 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 90 states. [2020-07-18 00:52:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:17,386 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2020-07-18 00:52:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-07-18 00:52:17,387 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 123 [2020-07-18 00:52:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:52:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-18 00:52:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2020-07-18 00:52:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-18 00:52:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2020-07-18 00:52:17,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states and 135 transitions. [2020-07-18 00:52:17,582 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-18 00:52:17,584 INFO L225 Difference]: With dead ends: 135 [2020-07-18 00:52:17,584 INFO L226 Difference]: Without dead ends: 130 [2020-07-18 00:52:17,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 29 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3900 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2267, Invalid=5923, Unknown=0, NotChecked=0, Total=8190 [2020-07-18 00:52:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-18 00:52:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2020-07-18 00:52:17,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:52:17,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 128 states. [2020-07-18 00:52:17,717 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 128 states. [2020-07-18 00:52:17,717 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 128 states. [2020-07-18 00:52:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:17,719 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2020-07-18 00:52:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2020-07-18 00:52:17,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:17,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:17,720 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 130 states. [2020-07-18 00:52:17,720 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 130 states. [2020-07-18 00:52:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:17,722 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2020-07-18 00:52:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2020-07-18 00:52:17,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:17,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:17,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:52:17,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:52:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-07-18 00:52:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2020-07-18 00:52:17,725 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 123 [2020-07-18 00:52:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:52:17,726 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2020-07-18 00:52:17,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 90 states. [2020-07-18 00:52:17,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 128 states and 128 transitions. [2020-07-18 00:52:17,913 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-18 00:52:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2020-07-18 00:52:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-07-18 00:52:17,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:52:17,915 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:52:17,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-07-18 00:52:17,915 INFO L427 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:52:17,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:52:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash 865612217, now seen corresponding path program 29 times [2020-07-18 00:52:17,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:52:17,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1553313080] [2020-07-18 00:52:17,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:52:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:20,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {14636#true} assume true; {14636#true} is VALID [2020-07-18 00:52:20,068 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14636#true} {14636#true} #45#return; {14636#true} is VALID [2020-07-18 00:52:20,068 INFO L263 TraceCheckUtils]: 0: Hoare triple {14636#true} call ULTIMATE.init(); {14636#true} is VALID [2020-07-18 00:52:20,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {14636#true} assume true; {14636#true} is VALID [2020-07-18 00:52:20,069 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14636#true} {14636#true} #45#return; {14636#true} is VALID [2020-07-18 00:52:20,069 INFO L263 TraceCheckUtils]: 3: Hoare triple {14636#true} call #t~ret1 := main(); {14636#true} is VALID [2020-07-18 00:52:20,069 INFO L280 TraceCheckUtils]: 4: Hoare triple {14636#true} havoc ~i~0; {14636#true} is VALID [2020-07-18 00:52:20,070 INFO L280 TraceCheckUtils]: 5: Hoare triple {14636#true} ~i~0 := 0; {14640#(<= main_~i~0 0)} is VALID [2020-07-18 00:52:20,072 INFO L280 TraceCheckUtils]: 6: Hoare triple {14640#(<= main_~i~0 0)} [107] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_out_29) v_oct_main_~i~0_in_29) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_29) v_oct_main_~i~0_out_29) 1) (<= (* 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) (<= (+ v_oct_main_~i~0_in_29 2) 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-18 00:52:20,073 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-18 00:52:20,074 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-18 00:52:20,075 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-18 00:52:20,075 INFO L280 TraceCheckUtils]: 10: Hoare triple {14644#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {14637#false} is VALID [2020-07-18 00:52:20,075 INFO L280 TraceCheckUtils]: 11: Hoare triple {14637#false} assume !false; {14637#false} is VALID [2020-07-18 00:52:20,076 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-18 00:52:26,080 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:52:26,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1553313080] [2020-07-18 00:52:26,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:52:26,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [93] imperfect sequences [] total 93 [2020-07-18 00:52:26,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072269131] [2020-07-18 00:52:26,082 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 127 [2020-07-18 00:52:26,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:52:26,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states. [2020-07-18 00:52:26,275 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-18 00:52:26,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2020-07-18 00:52:26,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:52:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2020-07-18 00:52:26,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2420, Invalid=6322, Unknown=0, NotChecked=0, Total=8742 [2020-07-18 00:52:26,276 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 93 states. [2020-07-18 00:52:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:27,105 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2020-07-18 00:52:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2020-07-18 00:52:27,105 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 127 [2020-07-18 00:52:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:52:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-18 00:52:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2020-07-18 00:52:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-18 00:52:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2020-07-18 00:52:27,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states and 139 transitions. [2020-07-18 00:52:27,312 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-18 00:52:27,314 INFO L225 Difference]: With dead ends: 139 [2020-07-18 00:52:27,314 INFO L226 Difference]: Without dead ends: 134 [2020-07-18 00:52:27,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4184 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2420, Invalid=6322, Unknown=0, NotChecked=0, Total=8742 [2020-07-18 00:52:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-18 00:52:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2020-07-18 00:52:27,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:52:27,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 132 states. [2020-07-18 00:52:27,440 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 132 states. [2020-07-18 00:52:27,440 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 132 states. [2020-07-18 00:52:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:27,442 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2020-07-18 00:52:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2020-07-18 00:52:27,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:27,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:27,442 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 134 states. [2020-07-18 00:52:27,442 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 134 states. [2020-07-18 00:52:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:27,445 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2020-07-18 00:52:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2020-07-18 00:52:27,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:27,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:27,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:52:27,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:52:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-18 00:52:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2020-07-18 00:52:27,447 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 127 [2020-07-18 00:52:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:52:27,448 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2020-07-18 00:52:27,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 93 states. [2020-07-18 00:52:27,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 132 states and 132 transitions. [2020-07-18 00:52:27,641 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-18 00:52:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2020-07-18 00:52:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-07-18 00:52:27,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:52:27,643 INFO L422 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:52:27,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-07-18 00:52:27,644 INFO L427 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:52:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:52:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash 378122550, now seen corresponding path program 30 times [2020-07-18 00:52:27,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:52:27,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [381995305] [2020-07-18 00:52:27,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:52:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:29,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {15544#true} assume true; {15544#true} is VALID [2020-07-18 00:52:29,873 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15544#true} {15544#true} #45#return; {15544#true} is VALID [2020-07-18 00:52:29,874 INFO L263 TraceCheckUtils]: 0: Hoare triple {15544#true} call ULTIMATE.init(); {15544#true} is VALID [2020-07-18 00:52:29,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {15544#true} assume true; {15544#true} is VALID [2020-07-18 00:52:29,874 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15544#true} {15544#true} #45#return; {15544#true} is VALID [2020-07-18 00:52:29,874 INFO L263 TraceCheckUtils]: 3: Hoare triple {15544#true} call #t~ret1 := main(); {15544#true} is VALID [2020-07-18 00:52:29,875 INFO L280 TraceCheckUtils]: 4: Hoare triple {15544#true} havoc ~i~0; {15544#true} is VALID [2020-07-18 00:52:29,875 INFO L280 TraceCheckUtils]: 5: Hoare triple {15544#true} ~i~0 := 0; {15548#(<= main_~i~0 0)} is VALID [2020-07-18 00:52:29,876 INFO L280 TraceCheckUtils]: 6: Hoare triple {15548#(<= main_~i~0 0)} [109] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_30) v_oct_main_~i~0_out_30) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_30) v_oct_main_~i~0_in_30) (- 1)) (<= (* 2 v_oct_main_~i~0_in_30) 1999998)) (and (<= v_oct_main_~i~0_out_30 1000001) (<= (+ v_oct_main_~i~0_in_30 2) 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))) 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-18 00:52:29,877 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-18 00:52:29,878 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-18 00:52:29,878 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-18 00:52:29,879 INFO L280 TraceCheckUtils]: 10: Hoare triple {15552#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {15545#false} is VALID [2020-07-18 00:52:29,879 INFO L280 TraceCheckUtils]: 11: Hoare triple {15545#false} assume !false; {15545#false} is VALID [2020-07-18 00:52:29,880 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-18 00:52:36,394 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:52:36,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [381995305] [2020-07-18 00:52:36,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:52:36,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2020-07-18 00:52:36,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010112382] [2020-07-18 00:52:36,395 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 131 [2020-07-18 00:52:36,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:52:36,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2020-07-18 00:52:36,587 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-18 00:52:36,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2020-07-18 00:52:36,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:52:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2020-07-18 00:52:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2578, Invalid=6734, Unknown=0, NotChecked=0, Total=9312 [2020-07-18 00:52:36,588 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 96 states. [2020-07-18 00:52:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:37,628 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2020-07-18 00:52:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2020-07-18 00:52:37,628 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 131 [2020-07-18 00:52:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:52:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-18 00:52:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2020-07-18 00:52:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-18 00:52:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2020-07-18 00:52:37,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 143 transitions. [2020-07-18 00:52:37,837 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-18 00:52:37,839 INFO L225 Difference]: With dead ends: 143 [2020-07-18 00:52:37,839 INFO L226 Difference]: Without dead ends: 138 [2020-07-18 00:52:37,840 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-18 00:52:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-18 00:52:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-18 00:52:37,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:52:37,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2020-07-18 00:52:37,971 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2020-07-18 00:52:37,971 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2020-07-18 00:52:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:37,973 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2020-07-18 00:52:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2020-07-18 00:52:37,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:37,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:37,974 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2020-07-18 00:52:37,974 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2020-07-18 00:52:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:37,977 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2020-07-18 00:52:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2020-07-18 00:52:37,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:37,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:37,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:52:37,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:52:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-18 00:52:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2020-07-18 00:52:37,979 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 131 [2020-07-18 00:52:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:52:37,980 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2020-07-18 00:52:37,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 96 states. [2020-07-18 00:52:37,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 136 states and 136 transitions. [2020-07-18 00:52:38,190 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-18 00:52:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2020-07-18 00:52:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-07-18 00:52:38,191 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:52:38,192 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:52:38,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-07-18 00:52:38,192 INFO L427 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:52:38,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:52:38,193 INFO L82 PathProgramCache]: Analyzing trace with hash 495266355, now seen corresponding path program 31 times [2020-07-18 00:52:38,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:52:38,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [648750885] [2020-07-18 00:52:38,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:52:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:40,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {16479#true} assume true; {16479#true} is VALID [2020-07-18 00:52:40,350 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {16479#true} {16479#true} #45#return; {16479#true} is VALID [2020-07-18 00:52:40,350 INFO L263 TraceCheckUtils]: 0: Hoare triple {16479#true} call ULTIMATE.init(); {16479#true} is VALID [2020-07-18 00:52:40,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {16479#true} assume true; {16479#true} is VALID [2020-07-18 00:52:40,351 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {16479#true} {16479#true} #45#return; {16479#true} is VALID [2020-07-18 00:52:40,351 INFO L263 TraceCheckUtils]: 3: Hoare triple {16479#true} call #t~ret1 := main(); {16479#true} is VALID [2020-07-18 00:52:40,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {16479#true} havoc ~i~0; {16479#true} is VALID [2020-07-18 00:52:40,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {16479#true} ~i~0 := 0; {16483#(<= main_~i~0 0)} is VALID [2020-07-18 00:52:40,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {16483#(<= main_~i~0 0)} [111] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_31) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_31) v_oct_main_~i~0_in_31) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_31) v_oct_main_~i~0_out_31) 1)) (and (<= v_oct_main_~i~0_out_31 1000000) (<= (+ v_oct_main_~i~0_in_31 2) v_oct_main_~i~0_out_31) (<= v_oct_main_~i~0_in_31 999999) (<= v_oct_main_~i~0_in_31 999998) (<= v_oct_main_~i~0_out_31 1000001))) 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-18 00:52:40,353 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-18 00:52:40,354 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-18 00:52:40,355 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-18 00:52:40,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {16487#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {16480#false} is VALID [2020-07-18 00:52:40,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {16480#false} assume !false; {16480#false} is VALID [2020-07-18 00:52:40,356 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-18 00:52:47,294 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:52:47,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [648750885] [2020-07-18 00:52:47,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:52:47,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [99] imperfect sequences [] total 99 [2020-07-18 00:52:47,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395222017] [2020-07-18 00:52:47,296 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 135 [2020-07-18 00:52:47,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:52:47,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states. [2020-07-18 00:52:47,500 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-18 00:52:47,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2020-07-18 00:52:47,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:52:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2020-07-18 00:52:47,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2741, Invalid=7159, Unknown=0, NotChecked=0, Total=9900 [2020-07-18 00:52:47,502 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 99 states. [2020-07-18 00:52:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:49,269 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2020-07-18 00:52:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2020-07-18 00:52:49,269 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 135 [2020-07-18 00:52:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:52:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-18 00:52:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2020-07-18 00:52:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-18 00:52:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2020-07-18 00:52:49,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 147 transitions. [2020-07-18 00:52:49,506 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-18 00:52:49,508 INFO L225 Difference]: With dead ends: 147 [2020-07-18 00:52:49,508 INFO L226 Difference]: Without dead ends: 142 [2020-07-18 00:52:49,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 6 SyntacticMatches, 32 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4782 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2741, Invalid=7159, Unknown=0, NotChecked=0, Total=9900 [2020-07-18 00:52:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-18 00:52:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2020-07-18 00:52:49,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:52:49,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2020-07-18 00:52:49,663 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2020-07-18 00:52:49,663 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2020-07-18 00:52:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:49,665 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2020-07-18 00:52:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2020-07-18 00:52:49,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:49,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:49,666 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2020-07-18 00:52:49,666 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2020-07-18 00:52:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:52:49,669 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2020-07-18 00:52:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2020-07-18 00:52:49,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:52:49,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:52:49,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:52:49,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:52:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-18 00:52:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2020-07-18 00:52:49,671 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 135 [2020-07-18 00:52:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:52:49,672 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2020-07-18 00:52:49,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 99 states. [2020-07-18 00:52:49,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 140 states and 140 transitions. [2020-07-18 00:52:49,886 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-18 00:52:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2020-07-18 00:52:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-07-18 00:52:49,887 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:52:49,887 INFO L422 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:52:49,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-07-18 00:52:49,888 INFO L427 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:52:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:52:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash -672015184, now seen corresponding path program 32 times [2020-07-18 00:52:49,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:52:49,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173404768] [2020-07-18 00:52:49,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:52:52,570 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-07-18 00:52:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:52:52,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {17441#true} assume true; {17441#true} is VALID [2020-07-18 00:52:52,710 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17441#true} {17441#true} #45#return; {17441#true} is VALID [2020-07-18 00:52:52,710 INFO L263 TraceCheckUtils]: 0: Hoare triple {17441#true} call ULTIMATE.init(); {17441#true} is VALID [2020-07-18 00:52:52,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {17441#true} assume true; {17441#true} is VALID [2020-07-18 00:52:52,711 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17441#true} {17441#true} #45#return; {17441#true} is VALID [2020-07-18 00:52:52,711 INFO L263 TraceCheckUtils]: 3: Hoare triple {17441#true} call #t~ret1 := main(); {17441#true} is VALID [2020-07-18 00:52:52,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {17441#true} havoc ~i~0; {17441#true} is VALID [2020-07-18 00:52:52,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {17441#true} ~i~0 := 0; {17445#(<= main_~i~0 0)} is VALID [2020-07-18 00:52:52,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {17445#(<= main_~i~0 0)} [113] L15-6-->L15-7_primed: Formula: (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) (<= (+ v_oct_main_~i~0_in_32 2) v_oct_main_~i~0_out_32)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_32) v_oct_main_~i~0_in_32) (- 1)) (<= (* 2 v_oct_main_~i~0_in_32) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_32) v_oct_main_~i~0_out_32) 1))) 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-18 00:52:52,713 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-18 00:52:52,714 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-18 00:52:52,715 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-18 00:52:52,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {17449#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {17442#false} is VALID [2020-07-18 00:52:52,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {17442#false} assume !false; {17442#false} is VALID [2020-07-18 00:52:52,722 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-18 00:53:00,146 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:53:00,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [173404768] [2020-07-18 00:53:00,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:53:00,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2020-07-18 00:53:00,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860008568] [2020-07-18 00:53:00,148 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 139 [2020-07-18 00:53:00,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:53:00,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states. [2020-07-18 00:53:00,367 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-18 00:53:00,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2020-07-18 00:53:00,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:53:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2020-07-18 00:53:00,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2909, Invalid=7597, Unknown=0, NotChecked=0, Total=10506 [2020-07-18 00:53:00,370 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 102 states. [2020-07-18 00:53:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:02,392 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2020-07-18 00:53:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2020-07-18 00:53:02,392 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 139 [2020-07-18 00:53:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:53:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-18 00:53:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2020-07-18 00:53:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-18 00:53:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2020-07-18 00:53:02,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states and 151 transitions. [2020-07-18 00:53:02,636 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-18 00:53:02,638 INFO L225 Difference]: With dead ends: 151 [2020-07-18 00:53:02,638 INFO L226 Difference]: Without dead ends: 146 [2020-07-18 00:53:02,639 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-18 00:53:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-18 00:53:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2020-07-18 00:53:02,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:53:02,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2020-07-18 00:53:02,786 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2020-07-18 00:53:02,786 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2020-07-18 00:53:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:02,788 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2020-07-18 00:53:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2020-07-18 00:53:02,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:53:02,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:53:02,788 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2020-07-18 00:53:02,789 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2020-07-18 00:53:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:02,791 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2020-07-18 00:53:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2020-07-18 00:53:02,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:53:02,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:53:02,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:53:02,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:53:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-18 00:53:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2020-07-18 00:53:02,794 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 139 [2020-07-18 00:53:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:53:02,794 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2020-07-18 00:53:02,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 102 states. [2020-07-18 00:53:02,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states and 144 transitions. [2020-07-18 00:53:03,017 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-18 00:53:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2020-07-18 00:53:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-07-18 00:53:03,018 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:53:03,018 INFO L422 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:53:03,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-07-18 00:53:03,019 INFO L427 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:53:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:53:03,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1335298221, now seen corresponding path program 33 times [2020-07-18 00:53:03,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:53:03,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1620316372] [2020-07-18 00:53:03,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:53:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:53:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:53:05,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {18430#true} assume true; {18430#true} is VALID [2020-07-18 00:53:05,173 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {18430#true} {18430#true} #45#return; {18430#true} is VALID [2020-07-18 00:53:05,173 INFO L263 TraceCheckUtils]: 0: Hoare triple {18430#true} call ULTIMATE.init(); {18430#true} is VALID [2020-07-18 00:53:05,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {18430#true} assume true; {18430#true} is VALID [2020-07-18 00:53:05,174 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {18430#true} {18430#true} #45#return; {18430#true} is VALID [2020-07-18 00:53:05,174 INFO L263 TraceCheckUtils]: 3: Hoare triple {18430#true} call #t~ret1 := main(); {18430#true} is VALID [2020-07-18 00:53:05,174 INFO L280 TraceCheckUtils]: 4: Hoare triple {18430#true} havoc ~i~0; {18430#true} is VALID [2020-07-18 00:53:05,175 INFO L280 TraceCheckUtils]: 5: Hoare triple {18430#true} ~i~0 := 0; {18434#(<= main_~i~0 0)} is VALID [2020-07-18 00:53:05,176 INFO L280 TraceCheckUtils]: 6: Hoare triple {18434#(<= main_~i~0 0)} [115] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_33) v_oct_main_~i~0_out_33) 1) (<= (* 2 v_oct_main_~i~0_in_33) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_33) v_oct_main_~i~0_in_33) (- 1))) (and (<= (+ v_oct_main_~i~0_in_33 2) 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-18 00:53:05,176 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-18 00:53:05,177 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-18 00:53:05,178 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-18 00:53:05,178 INFO L280 TraceCheckUtils]: 10: Hoare triple {18438#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {18431#false} is VALID [2020-07-18 00:53:05,178 INFO L280 TraceCheckUtils]: 11: Hoare triple {18431#false} assume !false; {18431#false} is VALID [2020-07-18 00:53:05,179 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-18 00:53:13,258 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:53:13,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1620316372] [2020-07-18 00:53:13,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:53:13,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2020-07-18 00:53:13,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037966998] [2020-07-18 00:53:13,260 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 143 [2020-07-18 00:53:13,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:53:13,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states. [2020-07-18 00:53:13,499 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-18 00:53:13,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2020-07-18 00:53:13,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:53:13,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2020-07-18 00:53:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=8048, Unknown=0, NotChecked=0, Total=11130 [2020-07-18 00:53:13,501 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 105 states. [2020-07-18 00:53:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:15,546 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2020-07-18 00:53:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2020-07-18 00:53:15,546 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 143 [2020-07-18 00:53:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:53:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-18 00:53:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2020-07-18 00:53:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-18 00:53:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2020-07-18 00:53:15,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states and 155 transitions. [2020-07-18 00:53:15,809 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-18 00:53:15,812 INFO L225 Difference]: With dead ends: 155 [2020-07-18 00:53:15,812 INFO L226 Difference]: Without dead ends: 150 [2020-07-18 00:53:15,813 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-18 00:53:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-07-18 00:53:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2020-07-18 00:53:16,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:53:16,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2020-07-18 00:53:16,013 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2020-07-18 00:53:16,013 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2020-07-18 00:53:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:16,016 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2020-07-18 00:53:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2020-07-18 00:53:16,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:53:16,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:53:16,019 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2020-07-18 00:53:16,020 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2020-07-18 00:53:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:16,022 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2020-07-18 00:53:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2020-07-18 00:53:16,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:53:16,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:53:16,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:53:16,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:53:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-18 00:53:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2020-07-18 00:53:16,026 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 143 [2020-07-18 00:53:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:53:16,027 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2020-07-18 00:53:16,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 105 states. [2020-07-18 00:53:16,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 148 states and 148 transitions. [2020-07-18 00:53:16,261 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-18 00:53:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2020-07-18 00:53:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-18 00:53:16,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:53:16,263 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:53:16,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-07-18 00:53:16,263 INFO L427 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:53:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:53:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash -660869590, now seen corresponding path program 34 times [2020-07-18 00:53:16,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:53:16,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1933278339] [2020-07-18 00:53:16,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:53:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:53:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:53:18,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {19446#true} assume true; {19446#true} is VALID [2020-07-18 00:53:18,464 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19446#true} {19446#true} #45#return; {19446#true} is VALID [2020-07-18 00:53:18,464 INFO L263 TraceCheckUtils]: 0: Hoare triple {19446#true} call ULTIMATE.init(); {19446#true} is VALID [2020-07-18 00:53:18,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {19446#true} assume true; {19446#true} is VALID [2020-07-18 00:53:18,465 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19446#true} {19446#true} #45#return; {19446#true} is VALID [2020-07-18 00:53:18,465 INFO L263 TraceCheckUtils]: 3: Hoare triple {19446#true} call #t~ret1 := main(); {19446#true} is VALID [2020-07-18 00:53:18,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {19446#true} havoc ~i~0; {19446#true} is VALID [2020-07-18 00:53:18,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {19446#true} ~i~0 := 0; {19450#(<= main_~i~0 0)} is VALID [2020-07-18 00:53:18,468 INFO L280 TraceCheckUtils]: 6: Hoare triple {19450#(<= main_~i~0 0)} [117] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_34) v_oct_main_~i~0_out_34) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_34) v_oct_main_~i~0_in_34) (- 1)) (<= (* 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_in_34 2) v_oct_main_~i~0_out_34) (<= v_oct_main_~i~0_in_34 999999) (<= v_oct_main_~i~0_out_34 1000000))) 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-18 00:53:18,469 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-18 00:53:18,471 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-18 00:53:18,472 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-18 00:53:18,473 INFO L280 TraceCheckUtils]: 10: Hoare triple {19454#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {19447#false} is VALID [2020-07-18 00:53:18,473 INFO L280 TraceCheckUtils]: 11: Hoare triple {19447#false} assume !false; {19447#false} is VALID [2020-07-18 00:53:18,474 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-18 00:53:27,404 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:53:27,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1933278339] [2020-07-18 00:53:27,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:53:27,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [108] imperfect sequences [] total 108 [2020-07-18 00:53:27,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181375302] [2020-07-18 00:53:27,407 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 147 [2020-07-18 00:53:27,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:53:27,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states. [2020-07-18 00:53:27,659 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-18 00:53:27,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2020-07-18 00:53:27,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:53:27,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2020-07-18 00:53:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3260, Invalid=8512, Unknown=0, NotChecked=0, Total=11772 [2020-07-18 00:53:27,662 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 108 states. [2020-07-18 00:53:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:29,774 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2020-07-18 00:53:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2020-07-18 00:53:29,774 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 147 [2020-07-18 00:53:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:53:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-18 00:53:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 159 transitions. [2020-07-18 00:53:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-18 00:53:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 159 transitions. [2020-07-18 00:53:29,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 105 states and 159 transitions. [2020-07-18 00:53:30,052 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-18 00:53:30,055 INFO L225 Difference]: With dead ends: 159 [2020-07-18 00:53:30,055 INFO L226 Difference]: Without dead ends: 154 [2020-07-18 00:53:30,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 6 SyntacticMatches, 35 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5754 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3260, Invalid=8512, Unknown=0, NotChecked=0, Total=11772 [2020-07-18 00:53:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-07-18 00:53:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2020-07-18 00:53:30,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:53:30,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 152 states. [2020-07-18 00:53:30,249 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 152 states. [2020-07-18 00:53:30,249 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 152 states. [2020-07-18 00:53:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:30,251 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2020-07-18 00:53:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2020-07-18 00:53:30,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:53:30,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:53:30,252 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 154 states. [2020-07-18 00:53:30,252 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 154 states. [2020-07-18 00:53:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:30,254 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2020-07-18 00:53:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2020-07-18 00:53:30,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:53:30,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:53:30,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:53:30,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:53:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-18 00:53:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2020-07-18 00:53:30,257 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 147 [2020-07-18 00:53:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:53:30,258 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2020-07-18 00:53:30,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 108 states. [2020-07-18 00:53:30,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 152 states and 152 transitions. [2020-07-18 00:53:30,505 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-18 00:53:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2020-07-18 00:53:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-07-18 00:53:30,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:53:30,507 INFO L422 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:53:30,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-07-18 00:53:30,507 INFO L427 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:53:30,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:53:30,507 INFO L82 PathProgramCache]: Analyzing trace with hash -511193817, now seen corresponding path program 35 times [2020-07-18 00:53:30,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:53:30,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [848185843] [2020-07-18 00:53:30,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:53:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:53:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:53:32,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {20489#true} assume true; {20489#true} is VALID [2020-07-18 00:53:32,682 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20489#true} {20489#true} #45#return; {20489#true} is VALID [2020-07-18 00:53:32,682 INFO L263 TraceCheckUtils]: 0: Hoare triple {20489#true} call ULTIMATE.init(); {20489#true} is VALID [2020-07-18 00:53:32,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {20489#true} assume true; {20489#true} is VALID [2020-07-18 00:53:32,683 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20489#true} {20489#true} #45#return; {20489#true} is VALID [2020-07-18 00:53:32,683 INFO L263 TraceCheckUtils]: 3: Hoare triple {20489#true} call #t~ret1 := main(); {20489#true} is VALID [2020-07-18 00:53:32,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {20489#true} havoc ~i~0; {20489#true} is VALID [2020-07-18 00:53:32,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {20489#true} ~i~0 := 0; {20493#(<= main_~i~0 0)} is VALID [2020-07-18 00:53:32,685 INFO L280 TraceCheckUtils]: 6: Hoare triple {20493#(<= main_~i~0 0)} [119] L15-6-->L15-7_primed: Formula: (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_in_35 2) v_oct_main_~i~0_out_35) (<= v_oct_main_~i~0_out_35 1000000)) (and (<= (* 2 v_oct_main_~i~0_in_35) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_35) v_oct_main_~i~0_in_35) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_35) v_oct_main_~i~0_out_35) 1))) 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-18 00:53:32,686 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-18 00:53:32,687 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-18 00:53:32,688 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-18 00:53:32,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {20497#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {20490#false} is VALID [2020-07-18 00:53:32,688 INFO L280 TraceCheckUtils]: 11: Hoare triple {20490#false} assume !false; {20490#false} is VALID [2020-07-18 00:53:32,689 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-18 00:53:42,246 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:53:42,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [848185843] [2020-07-18 00:53:42,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:53:42,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [111] imperfect sequences [] total 111 [2020-07-18 00:53:42,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228700202] [2020-07-18 00:53:42,248 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 151 [2020-07-18 00:53:42,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:53:42,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 111 states. [2020-07-18 00:53:42,533 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-18 00:53:42,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2020-07-18 00:53:42,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:53:42,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2020-07-18 00:53:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3443, Invalid=8989, Unknown=0, NotChecked=0, Total=12432 [2020-07-18 00:53:42,535 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 111 states. [2020-07-18 00:53:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:44,810 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2020-07-18 00:53:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2020-07-18 00:53:44,810 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 151 [2020-07-18 00:53:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:53:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-07-18 00:53:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2020-07-18 00:53:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-07-18 00:53:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2020-07-18 00:53:44,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 163 transitions. [2020-07-18 00:53:45,101 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-18 00:53:45,104 INFO L225 Difference]: With dead ends: 163 [2020-07-18 00:53:45,104 INFO L226 Difference]: Without dead ends: 158 [2020-07-18 00:53:45,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 6 SyntacticMatches, 36 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=3443, Invalid=8989, Unknown=0, NotChecked=0, Total=12432 [2020-07-18 00:53:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-18 00:53:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2020-07-18 00:53:45,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:53:45,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 156 states. [2020-07-18 00:53:45,289 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 156 states. [2020-07-18 00:53:45,289 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 156 states. [2020-07-18 00:53:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:45,291 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2020-07-18 00:53:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2020-07-18 00:53:45,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:53:45,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:53:45,292 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 158 states. [2020-07-18 00:53:45,292 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 158 states. [2020-07-18 00:53:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:53:45,294 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2020-07-18 00:53:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2020-07-18 00:53:45,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:53:45,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:53:45,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:53:45,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:53:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-18 00:53:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2020-07-18 00:53:45,297 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 151 [2020-07-18 00:53:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:53:45,297 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2020-07-18 00:53:45,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 111 states. [2020-07-18 00:53:45,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states and 156 transitions. [2020-07-18 00:53:45,575 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-18 00:53:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2020-07-18 00:53:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-07-18 00:53:45,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:53:45,576 INFO L422 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:53:45,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-07-18 00:53:45,577 INFO L427 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:53:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:53:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1019091548, now seen corresponding path program 36 times [2020-07-18 00:53:45,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:53:45,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1600611997] [2020-07-18 00:53:45,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:53:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:53:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:53:47,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {21559#true} assume true; {21559#true} is VALID [2020-07-18 00:53:47,807 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21559#true} {21559#true} #45#return; {21559#true} is VALID [2020-07-18 00:53:47,807 INFO L263 TraceCheckUtils]: 0: Hoare triple {21559#true} call ULTIMATE.init(); {21559#true} is VALID [2020-07-18 00:53:47,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {21559#true} assume true; {21559#true} is VALID [2020-07-18 00:53:47,808 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21559#true} {21559#true} #45#return; {21559#true} is VALID [2020-07-18 00:53:47,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {21559#true} call #t~ret1 := main(); {21559#true} is VALID [2020-07-18 00:53:47,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {21559#true} havoc ~i~0; {21559#true} is VALID [2020-07-18 00:53:47,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {21559#true} ~i~0 := 0; {21563#(<= main_~i~0 0)} is VALID [2020-07-18 00:53:47,813 INFO L280 TraceCheckUtils]: 6: Hoare triple {21563#(<= main_~i~0 0)} [121] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_36) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_36) v_oct_main_~i~0_in_36) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_36) v_oct_main_~i~0_out_36) 1)) (and (<= v_oct_main_~i~0_out_36 1000000) (<= v_oct_main_~i~0_out_36 1000001) (<= (+ v_oct_main_~i~0_in_36 2) v_oct_main_~i~0_out_36) (<= v_oct_main_~i~0_in_36 999998) (<= v_oct_main_~i~0_in_36 999999))) 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-18 00:53:47,835 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-18 00:53:47,839 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-18 00:53:47,840 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-18 00:53:47,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {21567#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {21560#false} is VALID [2020-07-18 00:53:47,842 INFO L280 TraceCheckUtils]: 11: Hoare triple {21560#false} assume !false; {21560#false} is VALID [2020-07-18 00:53:47,842 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-18 00:53:58,262 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:53:58,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1600611997] [2020-07-18 00:53:58,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:53:58,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [114] imperfect sequences [] total 114 [2020-07-18 00:53:58,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418337935] [2020-07-18 00:53:58,264 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 155 [2020-07-18 00:53:58,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:53:58,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 114 states. [2020-07-18 00:53:58,554 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-18 00:53:58,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2020-07-18 00:53:58,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:53:58,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2020-07-18 00:53:58,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3631, Invalid=9479, Unknown=0, NotChecked=0, Total=13110 [2020-07-18 00:53:58,557 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 114 states. [2020-07-18 00:54:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:00,914 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2020-07-18 00:54:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2020-07-18 00:54:00,914 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 155 [2020-07-18 00:54:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:54:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-18 00:54:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2020-07-18 00:54:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-18 00:54:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2020-07-18 00:54:00,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 111 states and 167 transitions. [2020-07-18 00:54:01,227 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-18 00:54:01,230 INFO L225 Difference]: With dead ends: 167 [2020-07-18 00:54:01,230 INFO L226 Difference]: Without dead ends: 162 [2020-07-18 00:54:01,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 6 SyntacticMatches, 37 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6452 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3631, Invalid=9479, Unknown=0, NotChecked=0, Total=13110 [2020-07-18 00:54:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-18 00:54:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2020-07-18 00:54:01,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:54:01,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2020-07-18 00:54:01,412 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2020-07-18 00:54:01,412 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2020-07-18 00:54:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:01,415 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2020-07-18 00:54:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2020-07-18 00:54:01,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:54:01,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:54:01,415 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2020-07-18 00:54:01,415 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2020-07-18 00:54:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:01,418 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2020-07-18 00:54:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2020-07-18 00:54:01,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:54:01,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:54:01,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:54:01,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:54:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-18 00:54:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2020-07-18 00:54:01,421 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 155 [2020-07-18 00:54:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:54:01,422 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2020-07-18 00:54:01,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 114 states. [2020-07-18 00:54:01,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 160 states and 160 transitions. [2020-07-18 00:54:01,719 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-18 00:54:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2020-07-18 00:54:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-07-18 00:54:01,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:54:01,721 INFO L422 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:54:01,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-07-18 00:54:01,721 INFO L427 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:54:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:54:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1861126239, now seen corresponding path program 37 times [2020-07-18 00:54:01,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:54:01,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1818093121] [2020-07-18 00:54:01,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:54:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:54:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:54:03,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {22656#true} assume true; {22656#true} is VALID [2020-07-18 00:54:03,958 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22656#true} {22656#true} #45#return; {22656#true} is VALID [2020-07-18 00:54:03,958 INFO L263 TraceCheckUtils]: 0: Hoare triple {22656#true} call ULTIMATE.init(); {22656#true} is VALID [2020-07-18 00:54:03,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {22656#true} assume true; {22656#true} is VALID [2020-07-18 00:54:03,958 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22656#true} {22656#true} #45#return; {22656#true} is VALID [2020-07-18 00:54:03,959 INFO L263 TraceCheckUtils]: 3: Hoare triple {22656#true} call #t~ret1 := main(); {22656#true} is VALID [2020-07-18 00:54:03,959 INFO L280 TraceCheckUtils]: 4: Hoare triple {22656#true} havoc ~i~0; {22656#true} is VALID [2020-07-18 00:54:03,959 INFO L280 TraceCheckUtils]: 5: Hoare triple {22656#true} ~i~0 := 0; {22660#(<= main_~i~0 0)} is VALID [2020-07-18 00:54:03,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {22660#(<= main_~i~0 0)} [123] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_37) v_oct_main_~i~0_out_37) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_37) v_oct_main_~i~0_in_37) (- 1)) (<= (* 2 v_oct_main_~i~0_in_37) 1999998)) (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) (<= v_oct_main_~i~0_in_37 999999) (<= (+ v_oct_main_~i~0_in_37 2) v_oct_main_~i~0_out_37))) 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-18 00:54:03,961 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-18 00:54:03,962 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-18 00:54:03,963 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-18 00:54:03,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {22664#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {22657#false} is VALID [2020-07-18 00:54:03,964 INFO L280 TraceCheckUtils]: 11: Hoare triple {22657#false} assume !false; {22657#false} is VALID [2020-07-18 00:54:03,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-18 00:54:14,824 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:54:14,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1818093121] [2020-07-18 00:54:14,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:54:14,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [117] imperfect sequences [] total 117 [2020-07-18 00:54:14,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373299304] [2020-07-18 00:54:14,826 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 159 [2020-07-18 00:54:14,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:54:14,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states. [2020-07-18 00:54:15,132 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-18 00:54:15,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2020-07-18 00:54:15,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:54:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2020-07-18 00:54:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3824, Invalid=9982, Unknown=0, NotChecked=0, Total=13806 [2020-07-18 00:54:15,135 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 117 states. [2020-07-18 00:54:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:17,611 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2020-07-18 00:54:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2020-07-18 00:54:17,611 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 159 [2020-07-18 00:54:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:54:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-18 00:54:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2020-07-18 00:54:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-18 00:54:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2020-07-18 00:54:17,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 114 states and 171 transitions. [2020-07-18 00:54:17,933 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-18 00:54:17,936 INFO L225 Difference]: With dead ends: 171 [2020-07-18 00:54:17,936 INFO L226 Difference]: Without dead ends: 166 [2020-07-18 00:54:17,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 6 SyntacticMatches, 38 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3824, Invalid=9982, Unknown=0, NotChecked=0, Total=13806 [2020-07-18 00:54:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-18 00:54:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2020-07-18 00:54:18,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:54:18,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2020-07-18 00:54:18,133 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2020-07-18 00:54:18,133 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2020-07-18 00:54:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:18,136 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2020-07-18 00:54:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2020-07-18 00:54:18,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:54:18,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:54:18,137 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2020-07-18 00:54:18,137 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2020-07-18 00:54:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:18,139 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2020-07-18 00:54:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2020-07-18 00:54:18,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:54:18,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:54:18,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:54:18,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:54:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-18 00:54:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2020-07-18 00:54:18,142 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 159 [2020-07-18 00:54:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:54:18,143 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2020-07-18 00:54:18,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 117 states. [2020-07-18 00:54:18,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 164 transitions. [2020-07-18 00:54:18,452 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-18 00:54:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2020-07-18 00:54:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-07-18 00:54:18,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:54:18,453 INFO L422 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:54:18,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-07-18 00:54:18,454 INFO L427 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:54:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:54:18,454 INFO L82 PathProgramCache]: Analyzing trace with hash -392314082, now seen corresponding path program 38 times [2020-07-18 00:54:18,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:54:18,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215468967] [2020-07-18 00:54:18,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:54:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:54:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:54:20,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {23780#true} assume true; {23780#true} is VALID [2020-07-18 00:54:20,649 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23780#true} {23780#true} #45#return; {23780#true} is VALID [2020-07-18 00:54:20,650 INFO L263 TraceCheckUtils]: 0: Hoare triple {23780#true} call ULTIMATE.init(); {23780#true} is VALID [2020-07-18 00:54:20,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {23780#true} assume true; {23780#true} is VALID [2020-07-18 00:54:20,650 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23780#true} {23780#true} #45#return; {23780#true} is VALID [2020-07-18 00:54:20,650 INFO L263 TraceCheckUtils]: 3: Hoare triple {23780#true} call #t~ret1 := main(); {23780#true} is VALID [2020-07-18 00:54:20,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {23780#true} havoc ~i~0; {23780#true} is VALID [2020-07-18 00:54:20,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {23780#true} ~i~0 := 0; {23784#(<= main_~i~0 0)} is VALID [2020-07-18 00:54:20,652 INFO L280 TraceCheckUtils]: 6: Hoare triple {23784#(<= main_~i~0 0)} [125] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_38) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_38) v_oct_main_~i~0_in_38) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_38) v_oct_main_~i~0_out_38) 1)) (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) (<= (+ v_oct_main_~i~0_in_38 2) 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-18 00:54:20,653 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-18 00:54:20,654 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-18 00:54:20,654 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-18 00:54:20,655 INFO L280 TraceCheckUtils]: 10: Hoare triple {23788#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {23781#false} is VALID [2020-07-18 00:54:20,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {23781#false} assume !false; {23781#false} is VALID [2020-07-18 00:54:20,655 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-18 00:54:32,883 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:54:32,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215468967] [2020-07-18 00:54:32,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:54:32,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [120] imperfect sequences [] total 120 [2020-07-18 00:54:32,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790304363] [2020-07-18 00:54:32,885 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 163 [2020-07-18 00:54:32,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:54:32,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states. [2020-07-18 00:54:33,216 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-18 00:54:33,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2020-07-18 00:54:33,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:54:33,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2020-07-18 00:54:33,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4022, Invalid=10498, Unknown=0, NotChecked=0, Total=14520 [2020-07-18 00:54:33,219 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 120 states. [2020-07-18 00:54:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:35,713 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2020-07-18 00:54:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2020-07-18 00:54:35,713 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 163 [2020-07-18 00:54:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:54:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-18 00:54:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2020-07-18 00:54:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-18 00:54:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2020-07-18 00:54:35,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 175 transitions. [2020-07-18 00:54:36,063 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-18 00:54:36,066 INFO L225 Difference]: With dead ends: 175 [2020-07-18 00:54:36,066 INFO L226 Difference]: Without dead ends: 170 [2020-07-18 00:54:36,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 6 SyntacticMatches, 39 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7190 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=4022, Invalid=10498, Unknown=0, NotChecked=0, Total=14520 [2020-07-18 00:54:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-07-18 00:54:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2020-07-18 00:54:36,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:54:36,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 168 states. [2020-07-18 00:54:36,292 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 168 states. [2020-07-18 00:54:36,292 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 168 states. [2020-07-18 00:54:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:36,294 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2020-07-18 00:54:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2020-07-18 00:54:36,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:54:36,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:54:36,294 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 170 states. [2020-07-18 00:54:36,295 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 170 states. [2020-07-18 00:54:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:36,297 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2020-07-18 00:54:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2020-07-18 00:54:36,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:54:36,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:54:36,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:54:36,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:54:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-07-18 00:54:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2020-07-18 00:54:36,299 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 163 [2020-07-18 00:54:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:54:36,300 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2020-07-18 00:54:36,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 120 states. [2020-07-18 00:54:36,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 168 states and 168 transitions. [2020-07-18 00:54:36,632 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-18 00:54:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2020-07-18 00:54:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-07-18 00:54:36,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:54:36,634 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:54:36,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-07-18 00:54:36,634 INFO L427 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:54:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:54:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1041364965, now seen corresponding path program 39 times [2020-07-18 00:54:36,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:54:36,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1032636475] [2020-07-18 00:54:36,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:54:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:54:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:54:38,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {24931#true} assume true; {24931#true} is VALID [2020-07-18 00:54:38,821 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24931#true} {24931#true} #45#return; {24931#true} is VALID [2020-07-18 00:54:38,821 INFO L263 TraceCheckUtils]: 0: Hoare triple {24931#true} call ULTIMATE.init(); {24931#true} is VALID [2020-07-18 00:54:38,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {24931#true} assume true; {24931#true} is VALID [2020-07-18 00:54:38,821 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24931#true} {24931#true} #45#return; {24931#true} is VALID [2020-07-18 00:54:38,821 INFO L263 TraceCheckUtils]: 3: Hoare triple {24931#true} call #t~ret1 := main(); {24931#true} is VALID [2020-07-18 00:54:38,822 INFO L280 TraceCheckUtils]: 4: Hoare triple {24931#true} havoc ~i~0; {24931#true} is VALID [2020-07-18 00:54:38,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {24931#true} ~i~0 := 0; {24935#(<= main_~i~0 0)} is VALID [2020-07-18 00:54:38,824 INFO L280 TraceCheckUtils]: 6: Hoare triple {24935#(<= main_~i~0 0)} [127] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_out_39 1000001) (<= (+ v_oct_main_~i~0_in_39 2) 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)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_39) v_oct_main_~i~0_in_39) (- 1)) (<= (* 2 v_oct_main_~i~0_in_39) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_39) v_oct_main_~i~0_out_39) 1))) 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-18 00:54:38,825 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-18 00:54:38,826 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-18 00:54:38,826 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-18 00:54:38,827 INFO L280 TraceCheckUtils]: 10: Hoare triple {24939#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {24932#false} is VALID [2020-07-18 00:54:38,827 INFO L280 TraceCheckUtils]: 11: Hoare triple {24932#false} assume !false; {24932#false} is VALID [2020-07-18 00:54:38,828 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-18 00:54:52,271 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:54:52,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1032636475] [2020-07-18 00:54:52,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:54:52,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [123] imperfect sequences [] total 123 [2020-07-18 00:54:52,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037879315] [2020-07-18 00:54:52,273 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 167 [2020-07-18 00:54:52,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:54:52,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states. [2020-07-18 00:54:52,629 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-18 00:54:52,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2020-07-18 00:54:52,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:54:52,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2020-07-18 00:54:52,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4225, Invalid=11027, Unknown=0, NotChecked=0, Total=15252 [2020-07-18 00:54:52,632 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 123 states. [2020-07-18 00:54:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:55,748 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2020-07-18 00:54:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2020-07-18 00:54:55,749 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 167 [2020-07-18 00:54:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:54:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-18 00:54:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2020-07-18 00:54:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-18 00:54:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2020-07-18 00:54:55,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 179 transitions. [2020-07-18 00:54:56,134 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-18 00:54:56,137 INFO L225 Difference]: With dead ends: 179 [2020-07-18 00:54:56,138 INFO L226 Difference]: Without dead ends: 174 [2020-07-18 00:54:56,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 6 SyntacticMatches, 40 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7574 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=4225, Invalid=11027, Unknown=0, NotChecked=0, Total=15252 [2020-07-18 00:54:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-07-18 00:54:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2020-07-18 00:54:56,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:54:56,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 172 states. [2020-07-18 00:54:56,375 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 172 states. [2020-07-18 00:54:56,375 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 172 states. [2020-07-18 00:54:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:56,379 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2020-07-18 00:54:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2020-07-18 00:54:56,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:54:56,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:54:56,380 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 174 states. [2020-07-18 00:54:56,380 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 174 states. [2020-07-18 00:54:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:54:56,383 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2020-07-18 00:54:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2020-07-18 00:54:56,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:54:56,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:54:56,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:54:56,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:54:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-07-18 00:54:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2020-07-18 00:54:56,387 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 167 [2020-07-18 00:54:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:54:56,387 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2020-07-18 00:54:56,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 123 states. [2020-07-18 00:54:56,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 172 states and 172 transitions. [2020-07-18 00:54:56,746 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-18 00:54:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2020-07-18 00:54:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-07-18 00:54:56,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:54:56,747 INFO L422 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:54:56,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-07-18 00:54:56,748 INFO L427 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:54:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:54:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1063880344, now seen corresponding path program 40 times [2020-07-18 00:54:56,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:54:56,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417295735] [2020-07-18 00:54:56,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:54:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:54:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:54:58,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {26109#true} assume true; {26109#true} is VALID [2020-07-18 00:54:58,964 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26109#true} {26109#true} #45#return; {26109#true} is VALID [2020-07-18 00:54:58,964 INFO L263 TraceCheckUtils]: 0: Hoare triple {26109#true} call ULTIMATE.init(); {26109#true} is VALID [2020-07-18 00:54:58,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {26109#true} assume true; {26109#true} is VALID [2020-07-18 00:54:58,964 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26109#true} {26109#true} #45#return; {26109#true} is VALID [2020-07-18 00:54:58,964 INFO L263 TraceCheckUtils]: 3: Hoare triple {26109#true} call #t~ret1 := main(); {26109#true} is VALID [2020-07-18 00:54:58,965 INFO L280 TraceCheckUtils]: 4: Hoare triple {26109#true} havoc ~i~0; {26109#true} is VALID [2020-07-18 00:54:58,965 INFO L280 TraceCheckUtils]: 5: Hoare triple {26109#true} ~i~0 := 0; {26113#(<= main_~i~0 0)} is VALID [2020-07-18 00:54:58,967 INFO L280 TraceCheckUtils]: 6: Hoare triple {26113#(<= main_~i~0 0)} [129] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_40) v_oct_main_~i~0_out_40) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_40) v_oct_main_~i~0_in_40) (- 1)) (<= (* 2 v_oct_main_~i~0_in_40) 1999998)) (and (<= v_oct_main_~i~0_in_40 999999) (<= v_oct_main_~i~0_out_40 1000001) (<= (+ v_oct_main_~i~0_in_40 2) 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-18 00:54:58,968 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-18 00:54:58,969 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-18 00:54:58,970 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-18 00:54:58,971 INFO L280 TraceCheckUtils]: 10: Hoare triple {26117#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {26110#false} is VALID [2020-07-18 00:54:58,971 INFO L280 TraceCheckUtils]: 11: Hoare triple {26110#false} assume !false; {26110#false} is VALID [2020-07-18 00:54:58,971 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-18 00:55:14,172 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:55:14,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417295735] [2020-07-18 00:55:14,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:55:14,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [126] imperfect sequences [] total 126 [2020-07-18 00:55:14,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519361948] [2020-07-18 00:55:14,173 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 171 [2020-07-18 00:55:14,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:55:14,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states. [2020-07-18 00:55:14,521 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-18 00:55:14,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2020-07-18 00:55:14,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:55:14,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2020-07-18 00:55:14,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4433, Invalid=11569, Unknown=0, NotChecked=0, Total=16002 [2020-07-18 00:55:14,524 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 126 states. [2020-07-18 00:55:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:55:17,541 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2020-07-18 00:55:17,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2020-07-18 00:55:17,541 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 171 [2020-07-18 00:55:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:55:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-18 00:55:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2020-07-18 00:55:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-18 00:55:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2020-07-18 00:55:17,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states and 183 transitions. [2020-07-18 00:55:17,924 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-18 00:55:17,927 INFO L225 Difference]: With dead ends: 183 [2020-07-18 00:55:17,927 INFO L226 Difference]: Without dead ends: 178 [2020-07-18 00:55:17,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 6 SyntacticMatches, 41 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7968 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=4433, Invalid=11569, Unknown=0, NotChecked=0, Total=16002 [2020-07-18 00:55:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-18 00:55:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2020-07-18 00:55:18,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:55:18,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 176 states. [2020-07-18 00:55:18,185 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 176 states. [2020-07-18 00:55:18,185 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 176 states. [2020-07-18 00:55:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:55:18,188 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2020-07-18 00:55:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2020-07-18 00:55:18,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:55:18,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:55:18,188 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 178 states. [2020-07-18 00:55:18,188 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 178 states. [2020-07-18 00:55:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:55:18,190 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2020-07-18 00:55:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2020-07-18 00:55:18,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:55:18,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:55:18,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:55:18,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:55:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-18 00:55:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2020-07-18 00:55:18,193 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 171 [2020-07-18 00:55:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:55:18,193 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2020-07-18 00:55:18,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 126 states. [2020-07-18 00:55:18,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 176 states and 176 transitions. [2020-07-18 00:55:18,541 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-18 00:55:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2020-07-18 00:55:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-18 00:55:18,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:55:18,543 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:55:18,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-07-18 00:55:18,543 INFO L427 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:55:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:55:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2111274645, now seen corresponding path program 41 times [2020-07-18 00:55:18,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:55:18,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213161750] [2020-07-18 00:55:18,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:55:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:55:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:55:20,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {27314#true} assume true; {27314#true} is VALID [2020-07-18 00:55:20,781 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27314#true} {27314#true} #45#return; {27314#true} is VALID [2020-07-18 00:55:20,781 INFO L263 TraceCheckUtils]: 0: Hoare triple {27314#true} call ULTIMATE.init(); {27314#true} is VALID [2020-07-18 00:55:20,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {27314#true} assume true; {27314#true} is VALID [2020-07-18 00:55:20,781 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27314#true} {27314#true} #45#return; {27314#true} is VALID [2020-07-18 00:55:20,782 INFO L263 TraceCheckUtils]: 3: Hoare triple {27314#true} call #t~ret1 := main(); {27314#true} is VALID [2020-07-18 00:55:20,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {27314#true} havoc ~i~0; {27314#true} is VALID [2020-07-18 00:55:20,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {27314#true} ~i~0 := 0; {27318#(<= main_~i~0 0)} is VALID [2020-07-18 00:55:20,785 INFO L280 TraceCheckUtils]: 6: Hoare triple {27318#(<= main_~i~0 0)} [131] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_41 999999) (<= v_oct_main_~i~0_in_41 999998) (<= (+ v_oct_main_~i~0_in_41 2) v_oct_main_~i~0_out_41) (<= v_oct_main_~i~0_out_41 1000001) (<= v_oct_main_~i~0_out_41 1000000)) (and (<= (+ (* (- 1) v_oct_main_~i~0_in_41) v_oct_main_~i~0_out_41) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_41) v_oct_main_~i~0_in_41) (- 1)) (<= (* 2 v_oct_main_~i~0_in_41) 1999998))) 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-18 00:55:20,786 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-18 00:55:20,787 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-18 00:55:20,788 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-18 00:55:20,789 INFO L280 TraceCheckUtils]: 10: Hoare triple {27322#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {27315#false} is VALID [2020-07-18 00:55:20,789 INFO L280 TraceCheckUtils]: 11: Hoare triple {27315#false} assume !false; {27315#false} is VALID [2020-07-18 00:55:20,789 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-18 00:55:37,720 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:55:37,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213161750] [2020-07-18 00:55:37,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:55:37,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [129] imperfect sequences [] total 129 [2020-07-18 00:55:37,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275008915] [2020-07-18 00:55:37,722 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 175 [2020-07-18 00:55:37,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:55:37,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 129 states. [2020-07-18 00:55:38,126 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-18 00:55:38,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2020-07-18 00:55:38,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:55:38,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2020-07-18 00:55:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4646, Invalid=12124, Unknown=0, NotChecked=0, Total=16770 [2020-07-18 00:55:38,129 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 129 states. [2020-07-18 00:55:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:55:40,649 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2020-07-18 00:55:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2020-07-18 00:55:40,649 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 175 [2020-07-18 00:55:40,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:55:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-07-18 00:55:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2020-07-18 00:55:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-07-18 00:55:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2020-07-18 00:55:40,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 187 transitions. [2020-07-18 00:55:41,077 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-18 00:55:41,080 INFO L225 Difference]: With dead ends: 187 [2020-07-18 00:55:41,081 INFO L226 Difference]: Without dead ends: 182 [2020-07-18 00:55:41,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 6 SyntacticMatches, 42 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=4646, Invalid=12124, Unknown=0, NotChecked=0, Total=16770 [2020-07-18 00:55:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-07-18 00:55:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2020-07-18 00:55:41,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:55:41,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 180 states. [2020-07-18 00:55:41,364 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 180 states. [2020-07-18 00:55:41,364 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 180 states. [2020-07-18 00:55:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:55:41,366 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2020-07-18 00:55:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2020-07-18 00:55:41,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:55:41,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:55:41,367 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 182 states. [2020-07-18 00:55:41,367 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 182 states. [2020-07-18 00:55:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:55:41,369 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2020-07-18 00:55:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2020-07-18 00:55:41,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:55:41,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:55:41,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:55:41,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:55:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-07-18 00:55:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2020-07-18 00:55:41,372 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 175 [2020-07-18 00:55:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:55:41,372 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2020-07-18 00:55:41,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 129 states. [2020-07-18 00:55:41,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 180 states and 180 transitions. [2020-07-18 00:55:41,758 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-18 00:55:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2020-07-18 00:55:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-07-18 00:55:41,759 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:55:41,759 INFO L422 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:55:41,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-07-18 00:55:41,760 INFO L427 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:55:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:55:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1683959826, now seen corresponding path program 42 times [2020-07-18 00:55:41,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:55:41,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1486612550] [2020-07-18 00:55:41,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:55:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:55:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:55:43,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {28546#true} assume true; {28546#true} is VALID [2020-07-18 00:55:43,996 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28546#true} {28546#true} #45#return; {28546#true} is VALID [2020-07-18 00:55:43,997 INFO L263 TraceCheckUtils]: 0: Hoare triple {28546#true} call ULTIMATE.init(); {28546#true} is VALID [2020-07-18 00:55:43,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {28546#true} assume true; {28546#true} is VALID [2020-07-18 00:55:43,997 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28546#true} {28546#true} #45#return; {28546#true} is VALID [2020-07-18 00:55:43,997 INFO L263 TraceCheckUtils]: 3: Hoare triple {28546#true} call #t~ret1 := main(); {28546#true} is VALID [2020-07-18 00:55:43,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {28546#true} havoc ~i~0; {28546#true} is VALID [2020-07-18 00:55:43,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {28546#true} ~i~0 := 0; {28550#(<= main_~i~0 0)} is VALID [2020-07-18 00:55:44,000 INFO L280 TraceCheckUtils]: 6: Hoare triple {28550#(<= main_~i~0 0)} [133] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_42) v_oct_main_~i~0_out_42) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_42) v_oct_main_~i~0_in_42) (- 1)) (<= (* 2 v_oct_main_~i~0_in_42) 1999998)) (and (<= v_oct_main_~i~0_out_42 1000000) (<= (+ v_oct_main_~i~0_in_42 2) 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-18 00:55:44,002 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-18 00:55:44,003 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-18 00:55:44,004 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-18 00:55:44,005 INFO L280 TraceCheckUtils]: 10: Hoare triple {28554#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {28547#false} is VALID [2020-07-18 00:55:44,005 INFO L280 TraceCheckUtils]: 11: Hoare triple {28547#false} assume !false; {28547#false} is VALID [2020-07-18 00:55:44,006 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-18 00:56:02,934 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:56:02,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1486612550] [2020-07-18 00:56:02,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:56:02,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [132] imperfect sequences [] total 132 [2020-07-18 00:56:02,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084641221] [2020-07-18 00:56:02,936 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 179 [2020-07-18 00:56:02,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:56:02,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 132 states. [2020-07-18 00:56:03,372 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-18 00:56:03,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2020-07-18 00:56:03,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:56:03,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2020-07-18 00:56:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4864, Invalid=12692, Unknown=0, NotChecked=0, Total=17556 [2020-07-18 00:56:03,375 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 132 states. [2020-07-18 00:56:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:56:05,246 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2020-07-18 00:56:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2020-07-18 00:56:05,246 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 179 [2020-07-18 00:56:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:56:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-18 00:56:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2020-07-18 00:56:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-18 00:56:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2020-07-18 00:56:05,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 129 states and 191 transitions. [2020-07-18 00:56:05,724 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-18 00:56:05,728 INFO L225 Difference]: With dead ends: 191 [2020-07-18 00:56:05,728 INFO L226 Difference]: Without dead ends: 186 [2020-07-18 00:56:05,729 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 6 SyntacticMatches, 43 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8786 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=4864, Invalid=12692, Unknown=0, NotChecked=0, Total=17556 [2020-07-18 00:56:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-18 00:56:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2020-07-18 00:56:06,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:56:06,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 184 states. [2020-07-18 00:56:06,066 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 184 states. [2020-07-18 00:56:06,066 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 184 states. [2020-07-18 00:56:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:56:06,070 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2020-07-18 00:56:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2020-07-18 00:56:06,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:56:06,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:56:06,071 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 186 states. [2020-07-18 00:56:06,071 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 186 states. [2020-07-18 00:56:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:56:06,074 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2020-07-18 00:56:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2020-07-18 00:56:06,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:56:06,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:56:06,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:56:06,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:56:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-18 00:56:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2020-07-18 00:56:06,077 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 179 [2020-07-18 00:56:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:56:06,077 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2020-07-18 00:56:06,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 132 states. [2020-07-18 00:56:06,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 184 states and 184 transitions. [2020-07-18 00:56:06,507 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-18 00:56:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2020-07-18 00:56:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-07-18 00:56:06,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:56:06,509 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:56:06,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-07-18 00:56:06,509 INFO L427 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:56:06,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:56:06,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1955060495, now seen corresponding path program 43 times [2020-07-18 00:56:06,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:56:06,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323559268] [2020-07-18 00:56:06,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:56:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:56:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:56:08,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {29805#true} assume true; {29805#true} is VALID [2020-07-18 00:56:08,764 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29805#true} {29805#true} #45#return; {29805#true} is VALID [2020-07-18 00:56:08,764 INFO L263 TraceCheckUtils]: 0: Hoare triple {29805#true} call ULTIMATE.init(); {29805#true} is VALID [2020-07-18 00:56:08,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {29805#true} assume true; {29805#true} is VALID [2020-07-18 00:56:08,765 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29805#true} {29805#true} #45#return; {29805#true} is VALID [2020-07-18 00:56:08,765 INFO L263 TraceCheckUtils]: 3: Hoare triple {29805#true} call #t~ret1 := main(); {29805#true} is VALID [2020-07-18 00:56:08,765 INFO L280 TraceCheckUtils]: 4: Hoare triple {29805#true} havoc ~i~0; {29805#true} is VALID [2020-07-18 00:56:08,766 INFO L280 TraceCheckUtils]: 5: Hoare triple {29805#true} ~i~0 := 0; {29809#(<= main_~i~0 0)} is VALID [2020-07-18 00:56:08,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {29809#(<= main_~i~0 0)} [135] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_43) v_oct_main_~i~0_out_43) 1) (<= (* 2 v_oct_main_~i~0_in_43) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_43) v_oct_main_~i~0_in_43) (- 1))) (and (<= (+ v_oct_main_~i~0_in_43 2) v_oct_main_~i~0_out_43) (<= v_oct_main_~i~0_in_43 999999) (<= v_oct_main_~i~0_in_43 999998) (<= v_oct_main_~i~0_out_43 1000000) (<= v_oct_main_~i~0_out_43 1000001))) 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-18 00:56:08,769 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-18 00:56:08,771 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-18 00:56:08,772 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-18 00:56:08,773 INFO L280 TraceCheckUtils]: 10: Hoare triple {29813#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {29806#false} is VALID [2020-07-18 00:56:08,773 INFO L280 TraceCheckUtils]: 11: Hoare triple {29806#false} assume !false; {29806#false} is VALID [2020-07-18 00:56:08,773 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-18 00:56:29,156 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:56:29,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323559268] [2020-07-18 00:56:29,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:56:29,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [135] imperfect sequences [] total 135 [2020-07-18 00:56:29,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796923051] [2020-07-18 00:56:29,158 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 183 [2020-07-18 00:56:29,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:56:29,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 135 states. [2020-07-18 00:56:29,599 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-18 00:56:29,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2020-07-18 00:56:29,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:56:29,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2020-07-18 00:56:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5087, Invalid=13273, Unknown=0, NotChecked=0, Total=18360 [2020-07-18 00:56:29,602 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 135 states. [2020-07-18 00:56:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:56:33,554 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2020-07-18 00:56:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2020-07-18 00:56:33,554 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 183 [2020-07-18 00:56:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:56:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-07-18 00:56:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2020-07-18 00:56:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-07-18 00:56:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2020-07-18 00:56:33,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 132 states and 195 transitions. [2020-07-18 00:56:34,027 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-18 00:56:34,029 INFO L225 Difference]: With dead ends: 195 [2020-07-18 00:56:34,029 INFO L226 Difference]: Without dead ends: 190 [2020-07-18 00:56:34,030 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 6 SyntacticMatches, 44 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9210 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=5087, Invalid=13273, Unknown=0, NotChecked=0, Total=18360 [2020-07-18 00:56:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-07-18 00:56:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2020-07-18 00:56:34,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:56:34,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 188 states. [2020-07-18 00:56:34,324 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 188 states. [2020-07-18 00:56:34,324 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 188 states. [2020-07-18 00:56:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:56:34,327 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2020-07-18 00:56:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2020-07-18 00:56:34,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:56:34,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:56:34,327 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 190 states. [2020-07-18 00:56:34,327 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 190 states. [2020-07-18 00:56:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:56:34,330 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2020-07-18 00:56:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2020-07-18 00:56:34,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:56:34,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:56:34,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:56:34,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:56:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-18 00:56:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2020-07-18 00:56:34,333 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 183 [2020-07-18 00:56:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:56:34,333 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2020-07-18 00:56:34,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 135 states. [2020-07-18 00:56:34,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 188 states and 188 transitions. [2020-07-18 00:56:34,755 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-18 00:56:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2020-07-18 00:56:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-07-18 00:56:34,756 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:56:34,757 INFO L422 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:56:34,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-07-18 00:56:34,757 INFO L427 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:56:34,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:56:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1707556980, now seen corresponding path program 44 times [2020-07-18 00:56:34,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:56:34,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [830477914] [2020-07-18 00:56:34,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:56:37,760 WARN L193 SmtUtils]: Spent 980.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-07-18 00:56:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:56:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:56:37,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {31091#true} assume true; {31091#true} is VALID [2020-07-18 00:56:37,927 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {31091#true} {31091#true} #45#return; {31091#true} is VALID [2020-07-18 00:56:37,927 INFO L263 TraceCheckUtils]: 0: Hoare triple {31091#true} call ULTIMATE.init(); {31091#true} is VALID [2020-07-18 00:56:37,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {31091#true} assume true; {31091#true} is VALID [2020-07-18 00:56:37,927 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31091#true} {31091#true} #45#return; {31091#true} is VALID [2020-07-18 00:56:37,927 INFO L263 TraceCheckUtils]: 3: Hoare triple {31091#true} call #t~ret1 := main(); {31091#true} is VALID [2020-07-18 00:56:37,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {31091#true} havoc ~i~0; {31091#true} is VALID [2020-07-18 00:56:37,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {31091#true} ~i~0 := 0; {31095#(<= main_~i~0 0)} is VALID [2020-07-18 00:56:37,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {31095#(<= main_~i~0 0)} [137] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_44 999999) (<= v_oct_main_~i~0_in_44 999998) (<= v_oct_main_~i~0_out_44 1000001) (<= v_oct_main_~i~0_out_44 1000000) (<= (+ v_oct_main_~i~0_in_44 2) v_oct_main_~i~0_out_44)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_44) v_oct_main_~i~0_in_44) (- 1)) (<= (* 2 v_oct_main_~i~0_in_44) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_44) v_oct_main_~i~0_out_44) 1))) 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-18 00:56:37,931 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-18 00:56:37,932 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-18 00:56:37,933 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-18 00:56:37,934 INFO L280 TraceCheckUtils]: 10: Hoare triple {31099#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {31092#false} is VALID [2020-07-18 00:56:37,934 INFO L280 TraceCheckUtils]: 11: Hoare triple {31092#false} assume !false; {31092#false} is VALID [2020-07-18 00:56:37,934 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-18 00:56:58,258 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:56:58,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [830477914] [2020-07-18 00:56:58,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:56:58,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [138] imperfect sequences [] total 138 [2020-07-18 00:56:58,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395829610] [2020-07-18 00:56:58,260 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 187 [2020-07-18 00:56:58,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:56:58,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 138 states. [2020-07-18 00:56:58,755 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-18 00:56:58,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2020-07-18 00:56:58,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:56:58,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2020-07-18 00:56:58,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5315, Invalid=13867, Unknown=0, NotChecked=0, Total=19182 [2020-07-18 00:56:58,758 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 138 states. [2020-07-18 00:57:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:57:03,614 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2020-07-18 00:57:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2020-07-18 00:57:03,614 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 187 [2020-07-18 00:57:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:57:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-18 00:57:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2020-07-18 00:57:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-18 00:57:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2020-07-18 00:57:03,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 135 states and 199 transitions. [2020-07-18 00:57:04,150 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-18 00:57:04,154 INFO L225 Difference]: With dead ends: 199 [2020-07-18 00:57:04,154 INFO L226 Difference]: Without dead ends: 194 [2020-07-18 00:57:04,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 6 SyntacticMatches, 45 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9644 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=5315, Invalid=13867, Unknown=0, NotChecked=0, Total=19182 [2020-07-18 00:57:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-18 00:57:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2020-07-18 00:57:04,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:57:04,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 192 states. [2020-07-18 00:57:04,554 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 192 states. [2020-07-18 00:57:04,554 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 192 states. [2020-07-18 00:57:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:57:04,557 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2020-07-18 00:57:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2020-07-18 00:57:04,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:57:04,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:57:04,558 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 194 states. [2020-07-18 00:57:04,558 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 194 states. [2020-07-18 00:57:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:57:04,560 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2020-07-18 00:57:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2020-07-18 00:57:04,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:57:04,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:57:04,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:57:04,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:57:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-07-18 00:57:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2020-07-18 00:57:04,563 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 187 [2020-07-18 00:57:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:57:04,564 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2020-07-18 00:57:04,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 138 states. [2020-07-18 00:57:04,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 192 states and 192 transitions. [2020-07-18 00:57:05,066 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-18 00:57:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2020-07-18 00:57:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-18 00:57:05,067 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:57:05,068 INFO L422 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:57:05,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-07-18 00:57:05,068 INFO L427 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:57:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:57:05,068 INFO L82 PathProgramCache]: Analyzing trace with hash -71754359, now seen corresponding path program 45 times [2020-07-18 00:57:05,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:57:05,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132595100] [2020-07-18 00:57:05,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:57:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:57:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:57:07,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {32404#true} assume true; {32404#true} is VALID [2020-07-18 00:57:07,335 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32404#true} {32404#true} #45#return; {32404#true} is VALID [2020-07-18 00:57:07,335 INFO L263 TraceCheckUtils]: 0: Hoare triple {32404#true} call ULTIMATE.init(); {32404#true} is VALID [2020-07-18 00:57:07,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {32404#true} assume true; {32404#true} is VALID [2020-07-18 00:57:07,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32404#true} {32404#true} #45#return; {32404#true} is VALID [2020-07-18 00:57:07,336 INFO L263 TraceCheckUtils]: 3: Hoare triple {32404#true} call #t~ret1 := main(); {32404#true} is VALID [2020-07-18 00:57:07,336 INFO L280 TraceCheckUtils]: 4: Hoare triple {32404#true} havoc ~i~0; {32404#true} is VALID [2020-07-18 00:57:07,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {32404#true} ~i~0 := 0; {32408#(<= main_~i~0 0)} is VALID [2020-07-18 00:57:07,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {32408#(<= main_~i~0 0)} [139] L15-6-->L15-7_primed: Formula: (or (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) (<= (+ v_oct_main_~i~0_in_45 2) v_oct_main_~i~0_out_45) (<= v_oct_main_~i~0_in_45 999999)) (and (<= (* 2 v_oct_main_~i~0_in_45) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_45) v_oct_main_~i~0_in_45) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_45) v_oct_main_~i~0_out_45) 1))) 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-18 00:57:07,340 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-18 00:57:07,341 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-18 00:57:07,342 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-18 00:57:07,344 INFO L280 TraceCheckUtils]: 10: Hoare triple {32412#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {32405#false} is VALID [2020-07-18 00:57:07,344 INFO L280 TraceCheckUtils]: 11: Hoare triple {32405#false} assume !false; {32405#false} is VALID [2020-07-18 00:57:07,344 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-18 00:57:32,875 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:57:32,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1132595100] [2020-07-18 00:57:32,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:57:32,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [141] imperfect sequences [] total 141 [2020-07-18 00:57:32,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797941450] [2020-07-18 00:57:32,877 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 191 [2020-07-18 00:57:32,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:57:32,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 141 states. [2020-07-18 00:57:33,446 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-18 00:57:33,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2020-07-18 00:57:33,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:57:33,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2020-07-18 00:57:33,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5548, Invalid=14474, Unknown=0, NotChecked=0, Total=20022 [2020-07-18 00:57:33,449 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 141 states. [2020-07-18 00:57:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:57:36,648 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2020-07-18 00:57:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2020-07-18 00:57:36,648 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 191 [2020-07-18 00:57:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:57:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-07-18 00:57:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2020-07-18 00:57:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-07-18 00:57:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2020-07-18 00:57:36,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 138 states and 203 transitions. [2020-07-18 00:57:37,276 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-18 00:57:37,280 INFO L225 Difference]: With dead ends: 203 [2020-07-18 00:57:37,280 INFO L226 Difference]: Without dead ends: 198 [2020-07-18 00:57:37,281 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 6 SyntacticMatches, 46 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10088 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=5548, Invalid=14474, Unknown=0, NotChecked=0, Total=20022 [2020-07-18 00:57:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-07-18 00:57:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2020-07-18 00:57:37,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:57:37,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 196 states. [2020-07-18 00:57:37,735 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 196 states. [2020-07-18 00:57:37,735 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 196 states. [2020-07-18 00:57:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:57:37,738 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2020-07-18 00:57:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2020-07-18 00:57:37,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:57:37,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:57:37,739 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 198 states. [2020-07-18 00:57:37,739 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 198 states. [2020-07-18 00:57:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:57:37,742 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2020-07-18 00:57:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2020-07-18 00:57:37,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:57:37,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:57:37,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:57:37,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:57:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-07-18 00:57:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2020-07-18 00:57:37,746 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 191 [2020-07-18 00:57:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:57:37,746 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2020-07-18 00:57:37,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 141 states. [2020-07-18 00:57:37,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 196 states and 196 transitions. [2020-07-18 00:57:38,338 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-18 00:57:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2020-07-18 00:57:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-18 00:57:38,339 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:57:38,339 INFO L422 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:57:38,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-07-18 00:57:38,340 INFO L427 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:57:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:57:38,340 INFO L82 PathProgramCache]: Analyzing trace with hash -911198970, now seen corresponding path program 46 times [2020-07-18 00:57:38,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:57:38,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073270974] [2020-07-18 00:57:38,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:57:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:57:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:57:40,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {33744#true} assume true; {33744#true} is VALID [2020-07-18 00:57:40,634 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33744#true} {33744#true} #45#return; {33744#true} is VALID [2020-07-18 00:57:40,635 INFO L263 TraceCheckUtils]: 0: Hoare triple {33744#true} call ULTIMATE.init(); {33744#true} is VALID [2020-07-18 00:57:40,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {33744#true} assume true; {33744#true} is VALID [2020-07-18 00:57:40,635 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33744#true} {33744#true} #45#return; {33744#true} is VALID [2020-07-18 00:57:40,635 INFO L263 TraceCheckUtils]: 3: Hoare triple {33744#true} call #t~ret1 := main(); {33744#true} is VALID [2020-07-18 00:57:40,636 INFO L280 TraceCheckUtils]: 4: Hoare triple {33744#true} havoc ~i~0; {33744#true} is VALID [2020-07-18 00:57:40,644 INFO L280 TraceCheckUtils]: 5: Hoare triple {33744#true} ~i~0 := 0; {33748#(<= main_~i~0 0)} is VALID [2020-07-18 00:57:40,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {33748#(<= main_~i~0 0)} [141] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_in_46) v_oct_main_~i~0_out_46) 1) (<= (* 2 v_oct_main_~i~0_in_46) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_46) v_oct_main_~i~0_in_46) (- 1))) (and (<= v_oct_main_~i~0_in_46 999999) (<= (+ v_oct_main_~i~0_in_46 2) 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-18 00:57:40,648 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-18 00:57:40,650 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-18 00:57:40,652 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-18 00:57:40,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {33752#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {33745#false} is VALID [2020-07-18 00:57:40,654 INFO L280 TraceCheckUtils]: 11: Hoare triple {33745#false} assume !false; {33745#false} is VALID [2020-07-18 00:57:40,655 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-18 00:58:08,939 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:58:08,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073270974] [2020-07-18 00:58:08,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:58:08,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [144] imperfect sequences [] total 144 [2020-07-18 00:58:08,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257180086] [2020-07-18 00:58:08,941 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 195 [2020-07-18 00:58:08,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:58:08,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states. [2020-07-18 00:58:09,583 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-18 00:58:09,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2020-07-18 00:58:09,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:58:09,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2020-07-18 00:58:09,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5786, Invalid=15094, Unknown=0, NotChecked=0, Total=20880 [2020-07-18 00:58:09,587 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 144 states. [2020-07-18 00:58:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:58:14,412 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2020-07-18 00:58:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2020-07-18 00:58:14,412 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 195 [2020-07-18 00:58:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:58:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-18 00:58:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2020-07-18 00:58:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-18 00:58:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2020-07-18 00:58:14,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 141 states and 207 transitions. [2020-07-18 00:58:15,067 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-18 00:58:15,072 INFO L225 Difference]: With dead ends: 207 [2020-07-18 00:58:15,072 INFO L226 Difference]: Without dead ends: 202 [2020-07-18 00:58:15,074 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 6 SyntacticMatches, 47 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10542 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=5786, Invalid=15094, Unknown=0, NotChecked=0, Total=20880 [2020-07-18 00:58:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-18 00:58:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2020-07-18 00:58:15,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:58:15,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 200 states. [2020-07-18 00:58:15,511 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 200 states. [2020-07-18 00:58:15,511 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 200 states. [2020-07-18 00:58:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:58:15,514 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2020-07-18 00:58:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2020-07-18 00:58:15,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:58:15,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:58:15,515 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 202 states. [2020-07-18 00:58:15,515 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 202 states. [2020-07-18 00:58:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:58:15,517 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2020-07-18 00:58:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2020-07-18 00:58:15,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:58:15,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:58:15,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:58:15,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:58:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-18 00:58:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2020-07-18 00:58:15,521 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 195 [2020-07-18 00:58:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:58:15,521 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2020-07-18 00:58:15,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 144 states. [2020-07-18 00:58:15,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 200 states and 200 transitions. [2020-07-18 00:58:16,139 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-18 00:58:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2020-07-18 00:58:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-07-18 00:58:16,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:58:16,141 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:58:16,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-07-18 00:58:16,141 INFO L427 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:58:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:58:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash 254100995, now seen corresponding path program 47 times [2020-07-18 00:58:16,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:58:16,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1974748795] [2020-07-18 00:58:16,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:58:19,832 WARN L193 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-18 00:58:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:58:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:58:20,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {35111#true} assume true; {35111#true} is VALID [2020-07-18 00:58:20,047 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35111#true} {35111#true} #45#return; {35111#true} is VALID [2020-07-18 00:58:20,047 INFO L263 TraceCheckUtils]: 0: Hoare triple {35111#true} call ULTIMATE.init(); {35111#true} is VALID [2020-07-18 00:58:20,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {35111#true} assume true; {35111#true} is VALID [2020-07-18 00:58:20,047 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35111#true} {35111#true} #45#return; {35111#true} is VALID [2020-07-18 00:58:20,047 INFO L263 TraceCheckUtils]: 3: Hoare triple {35111#true} call #t~ret1 := main(); {35111#true} is VALID [2020-07-18 00:58:20,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {35111#true} havoc ~i~0; {35111#true} is VALID [2020-07-18 00:58:20,049 INFO L280 TraceCheckUtils]: 5: Hoare triple {35111#true} ~i~0 := 0; {35115#(<= main_~i~0 0)} is VALID [2020-07-18 00:58:20,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {35115#(<= main_~i~0 0)} [143] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_47 999999) (<= v_oct_main_~i~0_out_47 1000001) (<= (+ v_oct_main_~i~0_in_47 2) v_oct_main_~i~0_out_47) (<= v_oct_main_~i~0_in_47 999998) (<= v_oct_main_~i~0_out_47 1000000)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_47) v_oct_main_~i~0_in_47) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_47) v_oct_main_~i~0_out_47) 1) (<= (* 2 v_oct_main_~i~0_in_47) 1999998))) 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-18 00:58:20,053 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-18 00:58:20,054 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-18 00:58:20,056 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-18 00:58:20,057 INFO L280 TraceCheckUtils]: 10: Hoare triple {35119#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {35112#false} is VALID [2020-07-18 00:58:20,058 INFO L280 TraceCheckUtils]: 11: Hoare triple {35112#false} assume !false; {35112#false} is VALID [2020-07-18 00:58:20,058 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-18 00:58:48,724 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:58:48,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1974748795] [2020-07-18 00:58:48,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:58:48,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [147] imperfect sequences [] total 147 [2020-07-18 00:58:48,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747893165] [2020-07-18 00:58:48,726 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 199 [2020-07-18 00:58:48,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:58:48,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 147 states. [2020-07-18 00:58:49,373 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-18 00:58:49,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2020-07-18 00:58:49,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:58:49,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2020-07-18 00:58:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6029, Invalid=15727, Unknown=0, NotChecked=0, Total=21756 [2020-07-18 00:58:49,376 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 147 states. [2020-07-18 00:58:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:58:55,832 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2020-07-18 00:58:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2020-07-18 00:58:55,833 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 199 [2020-07-18 00:58:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:58:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-18 00:58:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2020-07-18 00:58:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-18 00:58:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2020-07-18 00:58:55,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states and 211 transitions. [2020-07-18 00:58:56,554 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-18 00:58:56,557 INFO L225 Difference]: With dead ends: 211 [2020-07-18 00:58:56,557 INFO L226 Difference]: Without dead ends: 206 [2020-07-18 00:58:56,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 6 SyntacticMatches, 48 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11006 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=6029, Invalid=15727, Unknown=0, NotChecked=0, Total=21756 [2020-07-18 00:58:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-18 00:58:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2020-07-18 00:58:57,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:58:57,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 204 states. [2020-07-18 00:58:57,152 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 204 states. [2020-07-18 00:58:57,153 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 204 states. [2020-07-18 00:58:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:58:57,157 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2020-07-18 00:58:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2020-07-18 00:58:57,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:58:57,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:58:57,157 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 206 states. [2020-07-18 00:58:57,157 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 206 states. [2020-07-18 00:58:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:58:57,162 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2020-07-18 00:58:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2020-07-18 00:58:57,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:58:57,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:58:57,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:58:57,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:58:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-07-18 00:58:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2020-07-18 00:58:57,167 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 199 [2020-07-18 00:58:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:58:57,167 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2020-07-18 00:58:57,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 147 states. [2020-07-18 00:58:57,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 204 states and 204 transitions. [2020-07-18 00:58:58,042 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-18 00:58:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2020-07-18 00:58:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2020-07-18 00:58:58,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:58:58,044 INFO L422 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:58:58,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-07-18 00:58:58,044 INFO L427 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:58:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:58:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2122346368, now seen corresponding path program 48 times [2020-07-18 00:58:58,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:58:58,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1973305687] [2020-07-18 00:58:58,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:59:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:59:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:59:00,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {36505#true} assume true; {36505#true} is VALID [2020-07-18 00:59:00,429 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36505#true} {36505#true} #45#return; {36505#true} is VALID [2020-07-18 00:59:00,429 INFO L263 TraceCheckUtils]: 0: Hoare triple {36505#true} call ULTIMATE.init(); {36505#true} is VALID [2020-07-18 00:59:00,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {36505#true} assume true; {36505#true} is VALID [2020-07-18 00:59:00,429 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36505#true} {36505#true} #45#return; {36505#true} is VALID [2020-07-18 00:59:00,429 INFO L263 TraceCheckUtils]: 3: Hoare triple {36505#true} call #t~ret1 := main(); {36505#true} is VALID [2020-07-18 00:59:00,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {36505#true} havoc ~i~0; {36505#true} is VALID [2020-07-18 00:59:00,431 INFO L280 TraceCheckUtils]: 5: Hoare triple {36505#true} ~i~0 := 0; {36509#(<= main_~i~0 0)} is VALID [2020-07-18 00:59:00,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {36509#(<= main_~i~0 0)} [145] L15-6-->L15-7_primed: Formula: (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) (<= (+ v_oct_main_~i~0_in_48 2) v_oct_main_~i~0_out_48)) (and (<= (* 2 v_oct_main_~i~0_in_48) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_48) v_oct_main_~i~0_in_48) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_48) v_oct_main_~i~0_out_48) 1))) 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-18 00:59:00,435 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-18 00:59:00,436 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-18 00:59:00,438 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-18 00:59:00,440 INFO L280 TraceCheckUtils]: 10: Hoare triple {36513#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {36506#false} is VALID [2020-07-18 00:59:00,441 INFO L280 TraceCheckUtils]: 11: Hoare triple {36506#false} assume !false; {36506#false} is VALID [2020-07-18 00:59:00,441 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-18 00:59:35,775 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:59:35,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1973305687] [2020-07-18 00:59:35,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:59:35,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [150] imperfect sequences [] total 150 [2020-07-18 00:59:35,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044596269] [2020-07-18 00:59:35,777 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 203 [2020-07-18 00:59:35,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:59:35,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 150 states. [2020-07-18 00:59:36,618 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-18 00:59:36,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2020-07-18 00:59:36,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:59:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2020-07-18 00:59:36,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6277, Invalid=16373, Unknown=0, NotChecked=0, Total=22650 [2020-07-18 00:59:36,621 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 150 states. [2020-07-18 00:59:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:59:41,439 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2020-07-18 00:59:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2020-07-18 00:59:41,439 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 203 [2020-07-18 00:59:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:59:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-07-18 00:59:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2020-07-18 00:59:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-07-18 00:59:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2020-07-18 00:59:41,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 147 states and 215 transitions. [2020-07-18 00:59:42,432 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-18 00:59:42,437 INFO L225 Difference]: With dead ends: 215 [2020-07-18 00:59:42,437 INFO L226 Difference]: Without dead ends: 210 [2020-07-18 00:59:42,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 6 SyntacticMatches, 49 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11480 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=6277, Invalid=16373, Unknown=0, NotChecked=0, Total=22650 [2020-07-18 00:59:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-18 00:59:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2020-07-18 00:59:43,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:59:43,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 208 states. [2020-07-18 00:59:43,284 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 208 states. [2020-07-18 00:59:43,284 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 208 states. [2020-07-18 00:59:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:59:43,288 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2020-07-18 00:59:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2020-07-18 00:59:43,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:59:43,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:59:43,289 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 210 states. [2020-07-18 00:59:43,289 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 210 states. [2020-07-18 00:59:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:59:43,294 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2020-07-18 00:59:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2020-07-18 00:59:43,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:59:43,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:59:43,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:59:43,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:59:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-07-18 00:59:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2020-07-18 00:59:43,299 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 203 [2020-07-18 00:59:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:59:43,300 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2020-07-18 00:59:43,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 150 states. [2020-07-18 00:59:43,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 208 states and 208 transitions. [2020-07-18 00:59:44,184 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-18 00:59:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2020-07-18 00:59:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-07-18 00:59:44,186 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:59:44,187 INFO L422 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:59:44,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-07-18 00:59:44,187 INFO L427 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:59:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:59:44,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1350980733, now seen corresponding path program 49 times [2020-07-18 00:59:44,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:59:44,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989985413] [2020-07-18 00:59:44,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:59:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:59:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:59:46,614 INFO L280 TraceCheckUtils]: 0: Hoare triple {37926#true} assume true; {37926#true} is VALID [2020-07-18 00:59:46,615 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37926#true} {37926#true} #45#return; {37926#true} is VALID [2020-07-18 00:59:46,615 INFO L263 TraceCheckUtils]: 0: Hoare triple {37926#true} call ULTIMATE.init(); {37926#true} is VALID [2020-07-18 00:59:46,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {37926#true} assume true; {37926#true} is VALID [2020-07-18 00:59:46,616 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37926#true} {37926#true} #45#return; {37926#true} is VALID [2020-07-18 00:59:46,616 INFO L263 TraceCheckUtils]: 3: Hoare triple {37926#true} call #t~ret1 := main(); {37926#true} is VALID [2020-07-18 00:59:46,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {37926#true} havoc ~i~0; {37926#true} is VALID [2020-07-18 00:59:46,617 INFO L280 TraceCheckUtils]: 5: Hoare triple {37926#true} ~i~0 := 0; {37930#(<= main_~i~0 0)} is VALID [2020-07-18 00:59:46,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {37930#(<= main_~i~0 0)} [147] L15-6-->L15-7_primed: Formula: (or (and (<= v_oct_main_~i~0_in_49 999998) (<= (+ v_oct_main_~i~0_in_49 2) 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)) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_49) v_oct_main_~i~0_in_49) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_49) v_oct_main_~i~0_out_49) 1) (<= (* 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-18 00:59:46,622 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-18 00:59:46,624 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-18 00:59:46,626 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-18 00:59:46,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {37934#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {37927#false} is VALID [2020-07-18 00:59:46,628 INFO L280 TraceCheckUtils]: 11: Hoare triple {37927#false} assume !false; {37927#false} is VALID [2020-07-18 00:59:46,629 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-18 01:00:29,028 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 01:00:29,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989985413] [2020-07-18 01:00:29,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 01:00:29,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [153] imperfect sequences [] total 153 [2020-07-18 01:00:29,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281627003] [2020-07-18 01:00:29,030 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 207 [2020-07-18 01:00:29,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 01:00:29,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states. [2020-07-18 01:00:30,065 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-18 01:00:30,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2020-07-18 01:00:30,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 01:00:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2020-07-18 01:00:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6530, Invalid=17032, Unknown=0, NotChecked=0, Total=23562 [2020-07-18 01:00:30,068 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 153 states. [2020-07-18 01:00:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:00:39,704 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2020-07-18 01:00:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2020-07-18 01:00:39,704 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 207 [2020-07-18 01:00:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 01:00:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-18 01:00:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2020-07-18 01:00:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-18 01:00:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2020-07-18 01:00:39,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 150 states and 219 transitions. [2020-07-18 01:00:40,698 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-18 01:00:40,702 INFO L225 Difference]: With dead ends: 219 [2020-07-18 01:00:40,702 INFO L226 Difference]: Without dead ends: 214 [2020-07-18 01:00:40,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 6 SyntacticMatches, 50 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11964 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=6530, Invalid=17032, Unknown=0, NotChecked=0, Total=23562 [2020-07-18 01:00:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-18 01:00:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2020-07-18 01:00:41,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 01:00:41,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 212 states. [2020-07-18 01:00:41,379 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 212 states. [2020-07-18 01:00:41,379 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 212 states. [2020-07-18 01:00:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:00:41,382 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2020-07-18 01:00:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2020-07-18 01:00:41,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 01:00:41,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 01:00:41,383 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 214 states. [2020-07-18 01:00:41,383 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 214 states. [2020-07-18 01:00:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:00:41,387 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2020-07-18 01:00:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2020-07-18 01:00:41,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 01:00:41,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 01:00:41,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 01:00:41,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 01:00:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-07-18 01:00:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2020-07-18 01:00:41,390 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 207 [2020-07-18 01:00:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 01:00:41,390 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2020-07-18 01:00:41,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 153 states. [2020-07-18 01:00:41,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 212 states and 212 transitions. [2020-07-18 01:00:42,211 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-18 01:00:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2020-07-18 01:00:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-18 01:00:42,213 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 01:00:42,213 INFO L422 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 01:00:42,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-07-18 01:00:42,213 INFO L427 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 01:00:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 01:00:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash -161426950, now seen corresponding path program 50 times [2020-07-18 01:00:42,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 01:00:42,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177774159] [2020-07-18 01:00:42,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 01:00:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 01:00:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 01:00:44,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {39374#true} assume true; {39374#true} is VALID [2020-07-18 01:00:44,584 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {39374#true} {39374#true} #45#return; {39374#true} is VALID [2020-07-18 01:00:44,584 INFO L263 TraceCheckUtils]: 0: Hoare triple {39374#true} call ULTIMATE.init(); {39374#true} is VALID [2020-07-18 01:00:44,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {39374#true} assume true; {39374#true} is VALID [2020-07-18 01:00:44,585 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39374#true} {39374#true} #45#return; {39374#true} is VALID [2020-07-18 01:00:44,585 INFO L263 TraceCheckUtils]: 3: Hoare triple {39374#true} call #t~ret1 := main(); {39374#true} is VALID [2020-07-18 01:00:44,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {39374#true} havoc ~i~0; {39374#true} is VALID [2020-07-18 01:00:44,586 INFO L280 TraceCheckUtils]: 5: Hoare triple {39374#true} ~i~0 := 0; {39378#(<= main_~i~0 0)} is VALID [2020-07-18 01:00:44,589 INFO L280 TraceCheckUtils]: 6: Hoare triple {39378#(<= main_~i~0 0)} [149] L15-6-->L15-7_primed: Formula: (or (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) (<= (+ v_oct_main_~i~0_in_50 2) v_oct_main_~i~0_out_50)) (and (<= (+ (* (- 1) v_oct_main_~i~0_in_50) v_oct_main_~i~0_out_50) 1) (<= (* 2 v_oct_main_~i~0_in_50) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_out_50) v_oct_main_~i~0_in_50) (- 1)))) 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-18 01:00:44,591 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-18 01:00:44,593 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-18 01:00:44,594 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-18 01:00:44,596 INFO L280 TraceCheckUtils]: 10: Hoare triple {39382#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {39375#false} is VALID [2020-07-18 01:00:44,597 INFO L280 TraceCheckUtils]: 11: Hoare triple {39375#false} assume !false; {39375#false} is VALID [2020-07-18 01:00:44,597 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-18 01:01:26,303 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 01:01:26,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177774159] [2020-07-18 01:01:26,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 01:01:26,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [156] imperfect sequences [] total 156 [2020-07-18 01:01:26,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002810519] [2020-07-18 01:01:26,306 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 211 [2020-07-18 01:01:26,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 01:01:26,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states. [2020-07-18 01:01:27,158 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-18 01:01:27,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2020-07-18 01:01:27,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 01:01:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2020-07-18 01:01:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6788, Invalid=17704, Unknown=0, NotChecked=0, Total=24492 [2020-07-18 01:01:27,161 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 156 states. [2020-07-18 01:01:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:01:34,424 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2020-07-18 01:01:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2020-07-18 01:01:34,425 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 211 [2020-07-18 01:01:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 01:01:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-18 01:01:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2020-07-18 01:01:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-18 01:01:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2020-07-18 01:01:34,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 223 transitions. [2020-07-18 01:01:35,376 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-18 01:01:35,379 INFO L225 Difference]: With dead ends: 223 [2020-07-18 01:01:35,380 INFO L226 Difference]: Without dead ends: 218 [2020-07-18 01:01:35,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 6 SyntacticMatches, 51 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12458 ImplicationChecksByTransitivity, 40.7s TimeCoverageRelationStatistics Valid=6788, Invalid=17704, Unknown=0, NotChecked=0, Total=24492 [2020-07-18 01:01:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-07-18 01:01:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2020-07-18 01:01:36,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 01:01:36,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand 216 states. [2020-07-18 01:01:36,045 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 216 states. [2020-07-18 01:01:36,045 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 216 states. [2020-07-18 01:01:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:01:36,049 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2020-07-18 01:01:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2020-07-18 01:01:36,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 01:01:36,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 01:01:36,049 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 218 states. [2020-07-18 01:01:36,049 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 218 states. [2020-07-18 01:01:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:01:36,053 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2020-07-18 01:01:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2020-07-18 01:01:36,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 01:01:36,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 01:01:36,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 01:01:36,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 01:01:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-07-18 01:01:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2020-07-18 01:01:36,057 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 211 [2020-07-18 01:01:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 01:01:36,058 INFO L479 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2020-07-18 01:01:36,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 156 states. [2020-07-18 01:01:36,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 216 states and 216 transitions. [2020-07-18 01:01:36,950 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-18 01:01:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2020-07-18 01:01:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-07-18 01:01:36,952 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 01:01:36,952 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 01:01:36,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-07-18 01:01:36,952 INFO L427 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 01:01:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 01:01:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash 127289591, now seen corresponding path program 51 times [2020-07-18 01:01:36,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 01:01:36,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1660437612] [2020-07-18 01:01:36,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 01:01:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 01:01:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 01:01:39,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {40849#true} assume true; {40849#true} is VALID [2020-07-18 01:01:39,319 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {40849#true} {40849#true} #45#return; {40849#true} is VALID [2020-07-18 01:01:39,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {40849#true} call ULTIMATE.init(); {40849#true} is VALID [2020-07-18 01:01:39,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {40849#true} assume true; {40849#true} is VALID [2020-07-18 01:01:39,320 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40849#true} {40849#true} #45#return; {40849#true} is VALID [2020-07-18 01:01:39,320 INFO L263 TraceCheckUtils]: 3: Hoare triple {40849#true} call #t~ret1 := main(); {40849#true} is VALID [2020-07-18 01:01:39,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {40849#true} havoc ~i~0; {40849#true} is VALID [2020-07-18 01:01:39,321 INFO L280 TraceCheckUtils]: 5: Hoare triple {40849#true} ~i~0 := 0; {40853#(<= main_~i~0 0)} is VALID [2020-07-18 01:01:39,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {40853#(<= main_~i~0 0)} [151] L15-6-->L15-7_primed: Formula: (or (and (<= (* 2 v_oct_main_~i~0_in_51) 1999998) (<= (+ (* (- 1) v_oct_main_~i~0_in_51) v_oct_main_~i~0_out_51) 1) (<= (+ (* (- 1) v_oct_main_~i~0_out_51) v_oct_main_~i~0_in_51) (- 1))) (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) (<= (+ v_oct_main_~i~0_in_51 2) 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-18 01:01:39,326 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-18 01:01:39,327 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-18 01:01:39,329 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-18 01:01:39,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {40857#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {40850#false} is VALID [2020-07-18 01:01:39,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {40850#false} assume !false; {40850#false} is VALID [2020-07-18 01:01:39,331 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-18 01:02:21,690 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 01:02:21,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1660437612] [2020-07-18 01:02:21,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 01:02:21,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [159] imperfect sequences [] total 159 [2020-07-18 01:02:21,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545122658] [2020-07-18 01:02:21,691 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 215 [2020-07-18 01:02:21,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 01:02:21,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states. [2020-07-18 01:02:22,700 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-18 01:02:22,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2020-07-18 01:02:22,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 01:02:22,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2020-07-18 01:02:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7051, Invalid=18389, Unknown=0, NotChecked=0, Total=25440 [2020-07-18 01:02:22,703 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 159 states. [2020-07-18 01:02:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:02:28,176 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2020-07-18 01:02:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2020-07-18 01:02:28,176 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 215 [2020-07-18 01:02:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 01:02:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-18 01:02:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 227 transitions. [2020-07-18 01:02:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-18 01:02:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 227 transitions. [2020-07-18 01:02:28,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 156 states and 227 transitions. [2020-07-18 01:02:29,139 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-18 01:02:29,142 INFO L225 Difference]: With dead ends: 227 [2020-07-18 01:02:29,142 INFO L226 Difference]: Without dead ends: 222 [2020-07-18 01:02:29,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 6 SyntacticMatches, 52 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12962 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=7051, Invalid=18389, Unknown=0, NotChecked=0, Total=25440 [2020-07-18 01:02:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-07-18 01:02:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2020-07-18 01:02:29,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 01:02:29,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand 220 states. [2020-07-18 01:02:29,865 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand 220 states. [2020-07-18 01:02:29,866 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 220 states. [2020-07-18 01:02:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:02:29,869 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2020-07-18 01:02:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2020-07-18 01:02:29,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 01:02:29,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 01:02:29,870 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 222 states. [2020-07-18 01:02:29,870 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 222 states. [2020-07-18 01:02:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 01:02:29,874 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2020-07-18 01:02:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2020-07-18 01:02:29,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 01:02:29,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 01:02:29,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 01:02:29,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 01:02:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-07-18 01:02:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2020-07-18 01:02:29,878 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 215 [2020-07-18 01:02:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 01:02:29,878 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2020-07-18 01:02:29,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 159 states. [2020-07-18 01:02:29,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 220 states and 220 transitions. [2020-07-18 01:02:30,923 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-18 01:02:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2020-07-18 01:02:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-07-18 01:02:30,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 01:02:30,925 INFO L422 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 01:02:30,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-07-18 01:02:30,925 INFO L427 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 01:02:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 01:02:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash 51247476, now seen corresponding path program 52 times [2020-07-18 01:02:30,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 01:02:30,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224492704] [2020-07-18 01:02:30,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 01:02:34,948 WARN L193 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-18 01:02:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 01:02:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 01:02:35,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {42351#true} assume true; {42351#true} is VALID [2020-07-18 01:02:35,298 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {42351#true} {42351#true} #45#return; {42351#true} is VALID [2020-07-18 01:02:35,298 INFO L263 TraceCheckUtils]: 0: Hoare triple {42351#true} call ULTIMATE.init(); {42351#true} is VALID [2020-07-18 01:02:35,299 INFO L280 TraceCheckUtils]: 1: Hoare triple {42351#true} assume true; {42351#true} is VALID [2020-07-18 01:02:35,299 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {42351#true} {42351#true} #45#return; {42351#true} is VALID [2020-07-18 01:02:35,299 INFO L263 TraceCheckUtils]: 3: Hoare triple {42351#true} call #t~ret1 := main(); {42351#true} is VALID [2020-07-18 01:02:35,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {42351#true} havoc ~i~0; {42351#true} is VALID [2020-07-18 01:02:35,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {42351#true} ~i~0 := 0; {42355#(<= main_~i~0 0)} is VALID [2020-07-18 01:02:35,303 INFO L280 TraceCheckUtils]: 6: Hoare triple {42355#(<= main_~i~0 0)} [153] L15-6-->L15-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~i~0_out_52) v_oct_main_~i~0_in_52) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_52) v_oct_main_~i~0_out_52) 1) (<= (* 2 v_oct_main_~i~0_in_52) 1999998)) (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) (<= (+ v_oct_main_~i~0_in_52 2) 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-18 01:02:35,305 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-18 01:02:35,307 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-18 01:02:35,309 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-18 01:02:35,311 INFO L280 TraceCheckUtils]: 10: Hoare triple {42359#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {42352#false} is VALID [2020-07-18 01:02:35,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {42352#false} assume !false; {42352#false} is VALID [2020-07-18 01:02:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.