/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/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:58,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:58,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:58,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:58,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:58,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:58,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:58,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:58,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:58,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:58,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:58,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:58,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:58,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:58,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:58,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:58,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:58,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:58,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:58,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:58,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:58,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:58,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:58,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:58,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:58,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:58,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:58,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:58,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:58,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:58,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:58,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:58,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:58,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:58,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:58,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:58,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:58,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:58,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:58,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:58,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:58,802 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:47:58,827 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:58,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:58,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:58,829 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:58,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:58,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:58,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:58,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:58,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:58,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:58,833 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:58,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:58,834 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:58,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:58,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:58,834 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:58,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:58,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:58,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:58,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:58,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:58,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:58,836 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:59,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:59,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:59,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:59,128 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:59,128 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:59,129 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2020-07-18 00:47:59,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65bf3f95/ee847217d8564e488036d1c6e7f10888/FLAG3a7ac768a [2020-07-18 00:47:59,644 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:59,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2020-07-18 00:47:59,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65bf3f95/ee847217d8564e488036d1c6e7f10888/FLAG3a7ac768a [2020-07-18 00:48:00,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65bf3f95/ee847217d8564e488036d1c6e7f10888 [2020-07-18 00:48:00,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:48:00,040 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:48:00,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:00,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:48:00,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:48:00,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4b5cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00, skipping insertion in model container [2020-07-18 00:48:00,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:48:00,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:48:00,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:00,250 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:48:00,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:00,278 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:48:00,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00 WrapperNode [2020-07-18 00:48:00,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:00,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:48:00,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:48:00,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:48:00,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (1/1) ... [2020-07-18 00:48:00,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:48:00,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:48:00,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:48:00,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:48:00,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:00,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:48:00,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:48:00,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:48:00,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:48:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:48:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:48:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:48:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:48:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:48:00,655 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:48:00,655 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:48:00,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:00 BoogieIcfgContainer [2020-07-18 00:48:00,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:48:00,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:48:00,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:48:00,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:48:00,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:48:00" (1/3) ... [2020-07-18 00:48:00,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42048fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:00, skipping insertion in model container [2020-07-18 00:48:00,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:00" (2/3) ... [2020-07-18 00:48:00,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42048fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:00, skipping insertion in model container [2020-07-18 00:48:00,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:00" (3/3) ... [2020-07-18 00:48:00,669 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2020-07-18 00:48:00,680 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:48:00,689 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:48:00,704 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:48:00,730 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:48:00,731 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:48:00,731 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:48:00,731 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:48:00,731 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:48:00,731 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:48:00,732 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:48:00,732 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:48:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-18 00:48:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-18 00:48:00,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:00,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:00,768 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 129992897, now seen corresponding path program 1 times [2020-07-18 00:48:00,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:00,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1240186659] [2020-07-18 00:48:00,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:00,945 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-18 00:48:00,945 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #37#return; {26#true} is VALID [2020-07-18 00:48:00,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-18 00:48:00,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-18 00:48:00,948 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #37#return; {26#true} is VALID [2020-07-18 00:48:00,949 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret1 := main(); {26#true} is VALID [2020-07-18 00:48:00,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~i~0; {26#true} is VALID [2020-07-18 00:48:00,949 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} ~sn~0 := 0; {26#true} is VALID [2020-07-18 00:48:00,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~i~0 := 1; {26#true} is VALID [2020-07-18 00:48:00,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-18 00:48:00,955 INFO L263 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {27#false} is VALID [2020-07-18 00:48:00,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-18 00:48:00,956 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-18 00:48:00,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-18 00:48:00,957 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:48:00,959 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:00,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1240186659] [2020-07-18 00:48:00,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:00,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:48:00,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761904653] [2020-07-18 00:48:00,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-18 00:48:00,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:00,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:48:01,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:01,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:48:01,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:48:01,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:48:01,028 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-18 00:48:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:01,131 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-18 00:48:01,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:48:01,132 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-18 00:48:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:48:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2020-07-18 00:48:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:48:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2020-07-18 00:48:01,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2020-07-18 00:48:01,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:01,234 INFO L225 Difference]: With dead ends: 34 [2020-07-18 00:48:01,235 INFO L226 Difference]: Without dead ends: 17 [2020-07-18 00:48:01,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:48:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-18 00:48:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-18 00:48:01,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:01,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-18 00:48:01,290 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-18 00:48:01,290 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-18 00:48:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:01,294 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-18 00:48:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-18 00:48:01,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:01,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:01,295 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-18 00:48:01,295 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-18 00:48:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:01,300 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-18 00:48:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-18 00:48:01,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:01,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:01,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:01,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 00:48:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-18 00:48:01,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2020-07-18 00:48:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:01,307 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-18 00:48:01,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:48:01,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2020-07-18 00:48:01,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-18 00:48:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-18 00:48:01,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:01,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:01,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:48:01,338 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash 121681208, now seen corresponding path program 1 times [2020-07-18 00:48:01,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:01,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [641577243] [2020-07-18 00:48:01,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:01,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-18 00:48:01,399 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {168#true} {168#true} #37#return; {168#true} is VALID [2020-07-18 00:48:01,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2020-07-18 00:48:01,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-18 00:48:01,400 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #37#return; {168#true} is VALID [2020-07-18 00:48:01,400 INFO L263 TraceCheckUtils]: 3: Hoare triple {168#true} call #t~ret1 := main(); {168#true} is VALID [2020-07-18 00:48:01,401 INFO L280 TraceCheckUtils]: 4: Hoare triple {168#true} havoc ~i~0; {168#true} is VALID [2020-07-18 00:48:01,401 INFO L280 TraceCheckUtils]: 5: Hoare triple {168#true} ~sn~0 := 0; {168#true} is VALID [2020-07-18 00:48:01,402 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#true} ~i~0 := 1; {172#(<= main_~i~0 1)} is VALID [2020-07-18 00:48:01,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {172#(<= main_~i~0 1)} assume !(~i~0 <= 8); {169#false} is VALID [2020-07-18 00:48:01,404 INFO L263 TraceCheckUtils]: 8: Hoare triple {169#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {169#false} is VALID [2020-07-18 00:48:01,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2020-07-18 00:48:01,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2020-07-18 00:48:01,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2020-07-18 00:48:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:48:01,412 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:01,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [641577243] [2020-07-18 00:48:01,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:01,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:48:01,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538985071] [2020-07-18 00:48:01,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-18 00:48:01,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:01,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:48:01,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:01,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:48:01,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:48:01,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:48:01,435 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2020-07-18 00:48:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:01,506 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-18 00:48:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:48:01,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-18 00:48:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:48:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-18 00:48:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:48:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-18 00:48:01,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2020-07-18 00:48:01,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:01,555 INFO L225 Difference]: With dead ends: 26 [2020-07-18 00:48:01,555 INFO L226 Difference]: Without dead ends: 21 [2020-07-18 00:48:01,557 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:48:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-18 00:48:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2020-07-18 00:48:01,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:01,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 18 states. [2020-07-18 00:48:01,573 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 18 states. [2020-07-18 00:48:01,573 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 18 states. [2020-07-18 00:48:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:01,576 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-18 00:48:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-18 00:48:01,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:01,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:01,577 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 21 states. [2020-07-18 00:48:01,577 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 21 states. [2020-07-18 00:48:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:01,580 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-18 00:48:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-18 00:48:01,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:01,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:01,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:01,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-18 00:48:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-18 00:48:01,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2020-07-18 00:48:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:01,585 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-18 00:48:01,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:48:01,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2020-07-18 00:48:01,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-18 00:48:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-18 00:48:01,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:01,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:01,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:48:01,615 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash -917865259, now seen corresponding path program 1 times [2020-07-18 00:48:01,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:01,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [761208383] [2020-07-18 00:48:01,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:04,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-18 00:48:04,172 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {305#true} {305#true} #37#return; {305#true} is VALID [2020-07-18 00:48:04,173 INFO L263 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2020-07-18 00:48:04,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-18 00:48:04,173 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #37#return; {305#true} is VALID [2020-07-18 00:48:04,174 INFO L263 TraceCheckUtils]: 3: Hoare triple {305#true} call #t~ret1 := main(); {305#true} is VALID [2020-07-18 00:48:04,174 INFO L280 TraceCheckUtils]: 4: Hoare triple {305#true} havoc ~i~0; {305#true} is VALID [2020-07-18 00:48:04,175 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#true} ~sn~0 := 0; {309#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:04,176 INFO L280 TraceCheckUtils]: 6: Hoare triple {309#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {310#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-18 00:48:04,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {310#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [43] L13-6-->L13-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~sn~0_in_1) v_oct_main_~sn~0_out_1) 2) (<= (+ (* (- 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) (<= (* 2 v_oct_main_~i~0_in_1) 16) (<= (+ (* (- 1) v_oct_main_~sn~0_out_1) v_oct_main_~sn~0_in_1) (- 2))) (let ((.cse0 (div (+ (* v_oct_main_~sn~0_in_1 (- 1)) v_oct_main_~sn~0_out_1 (- 4)) 2)) (.cse1 (div (+ v_oct_main_~sn~0_in_1 (* v_oct_main_~sn~0_out_1 (- 1)) 4) (- 2)))) (and (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~i~0_in_1 .cse0 2)) (<= 0 .cse0) (<= (+ .cse1 v_oct_main_~i~0_in_1) 7) (<= (+ .cse1 v_oct_main_~i~0_in_1 2) v_oct_main_~i~0_out_1)))) InVars {main_~sn~0=v_oct_main_~sn~0_in_1, main_~i~0=v_oct_main_~i~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_#t~post0=|v_oct_main_#t~post0_out_1|, main_~sn~0=v_oct_main_~sn~0_out_1} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {311#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-18 00:48:04,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {311#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [42] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {312#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 00:48:04,183 INFO L263 TraceCheckUtils]: 9: Hoare triple {312#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {313#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:04,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {313#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {314#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:04,185 INFO L280 TraceCheckUtils]: 11: Hoare triple {314#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {306#false} is VALID [2020-07-18 00:48:04,185 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#false} assume !false; {306#false} is VALID [2020-07-18 00:48:04,186 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:48:04,357 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:04,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [761208383] [2020-07-18 00:48:04,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:04,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-18 00:48:04,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982547563] [2020-07-18 00:48:04,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-07-18 00:48:04,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:04,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 00:48:04,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:04,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 00:48:04,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:04,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 00:48:04,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:48:04,381 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2020-07-18 00:48:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:04,666 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-18 00:48:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:04,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-07-18 00:48:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:48:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-18 00:48:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:48:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-18 00:48:04,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-18 00:48:04,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:04,707 INFO L225 Difference]: With dead ends: 29 [2020-07-18 00:48:04,708 INFO L226 Difference]: Without dead ends: 24 [2020-07-18 00:48:04,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:48:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-18 00:48:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-18 00:48:04,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:04,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-18 00:48:04,736 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-18 00:48:04,737 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-18 00:48:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:04,739 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-18 00:48:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-18 00:48:04,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:04,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:04,740 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-18 00:48:04,740 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-18 00:48:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:04,742 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-18 00:48:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-18 00:48:04,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:04,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:04,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:04,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 00:48:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-18 00:48:04,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2020-07-18 00:48:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:04,746 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-18 00:48:04,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 00:48:04,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2020-07-18 00:48:04,777 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:48:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-18 00:48:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 00:48:04,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:04,789 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:04,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:04,790 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2060587176, now seen corresponding path program 2 times [2020-07-18 00:48:04,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:04,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706530259] [2020-07-18 00:48:04,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:07,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {475#true} assume true; {475#true} is VALID [2020-07-18 00:48:07,215 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {475#true} {475#true} #37#return; {475#true} is VALID [2020-07-18 00:48:07,215 INFO L263 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2020-07-18 00:48:07,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2020-07-18 00:48:07,216 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #37#return; {475#true} is VALID [2020-07-18 00:48:07,217 INFO L263 TraceCheckUtils]: 3: Hoare triple {475#true} call #t~ret1 := main(); {475#true} is VALID [2020-07-18 00:48:07,217 INFO L280 TraceCheckUtils]: 4: Hoare triple {475#true} havoc ~i~0; {475#true} is VALID [2020-07-18 00:48:07,222 INFO L280 TraceCheckUtils]: 5: Hoare triple {475#true} ~sn~0 := 0; {479#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:07,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {479#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {480#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-18 00:48:07,226 INFO L280 TraceCheckUtils]: 7: Hoare triple {480#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [45] L13-6-->L13-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~sn~0_out_2) v_oct_main_~sn~0_in_2) (- 2)) (<= (+ (* (- 1) v_oct_main_~sn~0_in_2) v_oct_main_~sn~0_out_2) 2) (<= (* 2 v_oct_main_~i~0_in_2) 16) (<= (+ (* (- 1) v_oct_main_~i~0_out_2) v_oct_main_~i~0_in_2) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_in_2) v_oct_main_~i~0_out_2) 1)) (let ((.cse0 (div (+ (* v_oct_main_~sn~0_in_2 (- 1)) v_oct_main_~sn~0_out_2 (- 4)) 2))) (and (<= v_oct_main_~i~0_out_2 (+ .cse0 v_oct_main_~i~0_in_2 2)) (<= 0 .cse0) (<= v_oct_main_~i~0_out_2 9) (<= (+ v_oct_main_~i~0_in_2 (div (+ v_oct_main_~sn~0_in_2 (* v_oct_main_~sn~0_out_2 (- 1)) 4) (- 2)) 2) v_oct_main_~i~0_out_2)))) InVars {main_~sn~0=v_oct_main_~sn~0_in_2, main_~i~0=v_oct_main_~i~0_in_2} OutVars{main_~i~0=v_oct_main_~i~0_out_2, main_#t~post0=|v_oct_main_#t~post0_out_2|, main_~sn~0=v_oct_main_~sn~0_out_2} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {481#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-18 00:48:07,228 INFO L280 TraceCheckUtils]: 8: Hoare triple {481#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [44] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {482#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 00:48:07,230 INFO L263 TraceCheckUtils]: 9: Hoare triple {482#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {483#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:07,231 INFO L280 TraceCheckUtils]: 10: Hoare triple {483#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {484#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:07,231 INFO L280 TraceCheckUtils]: 11: Hoare triple {484#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {476#false} is VALID [2020-07-18 00:48:07,232 INFO L280 TraceCheckUtils]: 12: Hoare triple {476#false} assume !false; {476#false} is VALID [2020-07-18 00:48:07,233 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:48:07,561 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:07,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706530259] [2020-07-18 00:48:07,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:07,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:48:07,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136096728] [2020-07-18 00:48:07,564 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-07-18 00:48:07,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:07,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:48:07,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:07,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:48:07,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:07,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:48:07,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:48:07,596 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2020-07-18 00:48:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:08,021 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-18 00:48:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:48:08,021 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-07-18 00:48:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:48:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2020-07-18 00:48:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:48:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2020-07-18 00:48:08,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 34 transitions. [2020-07-18 00:48:08,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:08,088 INFO L225 Difference]: With dead ends: 34 [2020-07-18 00:48:08,088 INFO L226 Difference]: Without dead ends: 29 [2020-07-18 00:48:08,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-07-18 00:48:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-18 00:48:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-18 00:48:08,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:08,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-18 00:48:08,131 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-18 00:48:08,131 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-18 00:48:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:08,137 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-18 00:48:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-18 00:48:08,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:08,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:08,138 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-18 00:48:08,138 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-18 00:48:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:08,142 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-18 00:48:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-18 00:48:08,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:08,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:08,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:08,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 00:48:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-18 00:48:08,145 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2020-07-18 00:48:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:08,145 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-18 00:48:08,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:48:08,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-18 00:48:08,189 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:48:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-18 00:48:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:48:08,190 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:08,190 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:08,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:08,191 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:08,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:08,191 INFO L82 PathProgramCache]: Analyzing trace with hash 657233589, now seen corresponding path program 3 times [2020-07-18 00:48:08,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:08,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1381763466] [2020-07-18 00:48:08,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:10,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-18 00:48:10,501 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {679#true} {679#true} #37#return; {679#true} is VALID [2020-07-18 00:48:10,501 INFO L263 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2020-07-18 00:48:10,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-18 00:48:10,502 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} #37#return; {679#true} is VALID [2020-07-18 00:48:10,502 INFO L263 TraceCheckUtils]: 3: Hoare triple {679#true} call #t~ret1 := main(); {679#true} is VALID [2020-07-18 00:48:10,503 INFO L280 TraceCheckUtils]: 4: Hoare triple {679#true} havoc ~i~0; {679#true} is VALID [2020-07-18 00:48:10,504 INFO L280 TraceCheckUtils]: 5: Hoare triple {679#true} ~sn~0 := 0; {683#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:10,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {684#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-18 00:48:10,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {684#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [47] L13-6-->L13-7_primed: Formula: (or (let ((.cse0 (div (+ v_oct_main_~sn~0_out_3 (* v_oct_main_~sn~0_in_3 (- 1)) (- 4)) 2))) (and (<= (+ (div (+ (* v_oct_main_~sn~0_out_3 (- 1)) v_oct_main_~sn~0_in_3 4) (- 2)) v_oct_main_~i~0_in_3 2) v_oct_main_~i~0_out_3) (<= 0 .cse0) (<= v_oct_main_~i~0_out_3 9) (<= v_oct_main_~i~0_out_3 (+ v_oct_main_~i~0_in_3 .cse0 2)))) (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) 16) (<= (+ (* (- 1) v_oct_main_~sn~0_out_3) v_oct_main_~sn~0_in_3) (- 2)) (<= (+ (* (- 1) v_oct_main_~i~0_in_3) v_oct_main_~i~0_out_3) 1) (<= (+ (* (- 1) v_oct_main_~sn~0_in_3) v_oct_main_~sn~0_out_3) 2))) InVars {main_~sn~0=v_oct_main_~sn~0_in_3, main_~i~0=v_oct_main_~i~0_in_3} OutVars{main_~i~0=v_oct_main_~i~0_out_3, main_#t~post0=|v_oct_main_#t~post0_out_3|, main_~sn~0=v_oct_main_~sn~0_out_3} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {685#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-18 00:48:10,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {685#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [46] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {686#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 00:48:10,509 INFO L263 TraceCheckUtils]: 9: Hoare triple {686#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {687#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:10,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {687#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {688#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:10,510 INFO L280 TraceCheckUtils]: 11: Hoare triple {688#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {680#false} is VALID [2020-07-18 00:48:10,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {680#false} assume !false; {680#false} is VALID [2020-07-18 00:48:10,511 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:48:11,011 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:11,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1381763466] [2020-07-18 00:48:11,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:11,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-18 00:48:11,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667400716] [2020-07-18 00:48:11,014 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-07-18 00:48:11,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:11,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-18 00:48:11,060 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:48:11,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-18 00:48:11,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-18 00:48:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:48:11,062 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 19 states. [2020-07-18 00:48:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:11,541 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-18 00:48:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 00:48:11,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-07-18 00:48:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-18 00:48:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-07-18 00:48:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-18 00:48:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-07-18 00:48:11,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 39 transitions. [2020-07-18 00:48:11,590 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:48:11,591 INFO L225 Difference]: With dead ends: 39 [2020-07-18 00:48:11,592 INFO L226 Difference]: Without dead ends: 34 [2020-07-18 00:48:11,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2020-07-18 00:48:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-18 00:48:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-18 00:48:11,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:11,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-18 00:48:11,632 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-18 00:48:11,632 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-18 00:48:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:11,635 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-18 00:48:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-18 00:48:11,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:11,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:11,636 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-18 00:48:11,636 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-18 00:48:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:11,638 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-18 00:48:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-18 00:48:11,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:11,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:11,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:11,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-18 00:48:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2020-07-18 00:48:11,641 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2020-07-18 00:48:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:11,642 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2020-07-18 00:48:11,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-18 00:48:11,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2020-07-18 00:48:11,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2020-07-18 00:48:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 00:48:11,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:11,681 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:11,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:48:11,682 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1410268808, now seen corresponding path program 4 times [2020-07-18 00:48:11,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:11,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1180228954] [2020-07-18 00:48:11,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:14,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {917#true} assume true; {917#true} is VALID [2020-07-18 00:48:14,046 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {917#true} {917#true} #37#return; {917#true} is VALID [2020-07-18 00:48:14,046 INFO L263 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2020-07-18 00:48:14,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {917#true} assume true; {917#true} is VALID [2020-07-18 00:48:14,047 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {917#true} {917#true} #37#return; {917#true} is VALID [2020-07-18 00:48:14,047 INFO L263 TraceCheckUtils]: 3: Hoare triple {917#true} call #t~ret1 := main(); {917#true} is VALID [2020-07-18 00:48:14,048 INFO L280 TraceCheckUtils]: 4: Hoare triple {917#true} havoc ~i~0; {917#true} is VALID [2020-07-18 00:48:14,049 INFO L280 TraceCheckUtils]: 5: Hoare triple {917#true} ~sn~0 := 0; {921#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:14,050 INFO L280 TraceCheckUtils]: 6: Hoare triple {921#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {922#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-18 00:48:14,053 INFO L280 TraceCheckUtils]: 7: Hoare triple {922#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [49] L13-6-->L13-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_~sn~0_in_4) v_oct_main_~sn~0_out_4) 2) (<= (+ (* (- 1) v_oct_main_~i~0_in_4) v_oct_main_~i~0_out_4) 1) (<= (* 2 v_oct_main_~i~0_in_4) 16) (<= (+ (* (- 1) v_oct_main_~sn~0_out_4) v_oct_main_~sn~0_in_4) (- 2))) (let ((.cse0 (div (+ (* v_oct_main_~sn~0_out_4 (- 1)) v_oct_main_~sn~0_in_4 4) (- 2))) (.cse1 (div (+ v_oct_main_~sn~0_out_4 (* v_oct_main_~sn~0_in_4 (- 1)) (- 4)) 2))) (and (<= (+ v_oct_main_~i~0_in_4 .cse0 2) v_oct_main_~i~0_out_4) (<= (+ v_oct_main_~i~0_in_4 .cse0) 7) (<= v_oct_main_~i~0_out_4 (+ v_oct_main_~i~0_in_4 .cse1 2)) (<= 0 .cse1)))) InVars {main_~sn~0=v_oct_main_~sn~0_in_4, main_~i~0=v_oct_main_~i~0_in_4} OutVars{main_~i~0=v_oct_main_~i~0_out_4, main_#t~post0=|v_oct_main_#t~post0_out_4|, main_~sn~0=v_oct_main_~sn~0_out_4} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {923#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-18 00:48:14,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {923#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [48] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {924#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 00:48:14,056 INFO L263 TraceCheckUtils]: 9: Hoare triple {924#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {925#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:14,057 INFO L280 TraceCheckUtils]: 10: Hoare triple {925#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {926#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:14,058 INFO L280 TraceCheckUtils]: 11: Hoare triple {926#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {918#false} is VALID [2020-07-18 00:48:14,059 INFO L280 TraceCheckUtils]: 12: Hoare triple {918#false} assume !false; {918#false} is VALID [2020-07-18 00:48:14,059 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:48:14,722 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:14,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1180228954] [2020-07-18 00:48:14,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:14,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-07-18 00:48:14,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854038647] [2020-07-18 00:48:14,724 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2020-07-18 00:48:14,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:14,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-18 00:48:14,778 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:48:14,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-18 00:48:14,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:14,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-18 00:48:14,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2020-07-18 00:48:14,780 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 23 states. [2020-07-18 00:48:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:15,340 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-18 00:48:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-18 00:48:15,340 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2020-07-18 00:48:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 00:48:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. [2020-07-18 00:48:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 00:48:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. [2020-07-18 00:48:15,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 44 transitions. [2020-07-18 00:48:15,389 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:48:15,390 INFO L225 Difference]: With dead ends: 44 [2020-07-18 00:48:15,390 INFO L226 Difference]: Without dead ends: 39 [2020-07-18 00:48:15,391 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2020-07-18 00:48:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-18 00:48:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-07-18 00:48:15,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:15,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2020-07-18 00:48:15,437 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2020-07-18 00:48:15,437 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2020-07-18 00:48:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:15,439 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-18 00:48:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-18 00:48:15,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:15,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:15,440 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2020-07-18 00:48:15,440 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2020-07-18 00:48:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:15,442 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-18 00:48:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-18 00:48:15,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:15,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:15,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:15,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-18 00:48:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-18 00:48:15,445 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2020-07-18 00:48:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:15,445 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-18 00:48:15,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-18 00:48:15,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-18 00:48:15,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-18 00:48:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 00:48:15,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:15,495 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:15,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:48:15,496 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1340090219, now seen corresponding path program 5 times [2020-07-18 00:48:15,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:15,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893475082] [2020-07-18 00:48:15,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:17,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {1189#true} assume true; {1189#true} is VALID [2020-07-18 00:48:17,781 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1189#true} {1189#true} #37#return; {1189#true} is VALID [2020-07-18 00:48:17,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {1189#true} call ULTIMATE.init(); {1189#true} is VALID [2020-07-18 00:48:17,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {1189#true} assume true; {1189#true} is VALID [2020-07-18 00:48:17,782 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1189#true} {1189#true} #37#return; {1189#true} is VALID [2020-07-18 00:48:17,783 INFO L263 TraceCheckUtils]: 3: Hoare triple {1189#true} call #t~ret1 := main(); {1189#true} is VALID [2020-07-18 00:48:17,783 INFO L280 TraceCheckUtils]: 4: Hoare triple {1189#true} havoc ~i~0; {1189#true} is VALID [2020-07-18 00:48:17,789 INFO L280 TraceCheckUtils]: 5: Hoare triple {1189#true} ~sn~0 := 0; {1193#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:17,790 INFO L280 TraceCheckUtils]: 6: Hoare triple {1193#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {1194#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-18 00:48:17,792 INFO L280 TraceCheckUtils]: 7: Hoare triple {1194#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [51] L13-6-->L13-7_primed: Formula: (or (let ((.cse0 (div (+ (* v_oct_main_~sn~0_out_5 (- 1)) v_oct_main_~sn~0_in_5 4) (- 2))) (.cse1 (div (+ v_oct_main_~sn~0_out_5 (* v_oct_main_~sn~0_in_5 (- 1)) (- 4)) 2))) (and (<= (+ .cse0 v_oct_main_~i~0_in_5 2) v_oct_main_~i~0_out_5) (<= 0 .cse1) (<= (+ .cse0 v_oct_main_~i~0_in_5) 7) (<= v_oct_main_~i~0_out_5 (+ v_oct_main_~i~0_in_5 .cse1 2)))) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_5) v_oct_main_~i~0_in_5) (- 1)) (<= (+ (* (- 1) v_oct_main_~sn~0_in_5) v_oct_main_~sn~0_out_5) 2) (<= (* 2 v_oct_main_~i~0_in_5) 16) (<= (+ (* (- 1) v_oct_main_~i~0_in_5) v_oct_main_~i~0_out_5) 1) (<= (+ (* (- 1) v_oct_main_~sn~0_out_5) v_oct_main_~sn~0_in_5) (- 2)))) InVars {main_~sn~0=v_oct_main_~sn~0_in_5, main_~i~0=v_oct_main_~i~0_in_5} OutVars{main_~i~0=v_oct_main_~i~0_out_5, main_#t~post0=|v_oct_main_#t~post0_out_5|, main_~sn~0=v_oct_main_~sn~0_out_5} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {1195#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-18 00:48:17,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {1195#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [50] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1196#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 00:48:17,794 INFO L263 TraceCheckUtils]: 9: Hoare triple {1196#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1197#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:17,795 INFO L280 TraceCheckUtils]: 10: Hoare triple {1197#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1198#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:17,799 INFO L280 TraceCheckUtils]: 11: Hoare triple {1198#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1190#false} is VALID [2020-07-18 00:48:17,800 INFO L280 TraceCheckUtils]: 12: Hoare triple {1190#false} assume !false; {1190#false} is VALID [2020-07-18 00:48:17,801 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:48:18,693 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:18,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893475082] [2020-07-18 00:48:18,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:18,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-07-18 00:48:18,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725937542] [2020-07-18 00:48:18,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2020-07-18 00:48:18,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:18,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2020-07-18 00:48:18,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:18,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-18 00:48:18,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:18,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-18 00:48:18,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2020-07-18 00:48:18,754 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 27 states. [2020-07-18 00:48:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:19,249 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-18 00:48:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-18 00:48:19,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2020-07-18 00:48:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-18 00:48:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 49 transitions. [2020-07-18 00:48:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-18 00:48:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 49 transitions. [2020-07-18 00:48:19,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 49 transitions. [2020-07-18 00:48:19,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:19,326 INFO L225 Difference]: With dead ends: 49 [2020-07-18 00:48:19,327 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 00:48:19,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2020-07-18 00:48:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 00:48:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-18 00:48:19,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:19,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-18 00:48:19,385 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-18 00:48:19,386 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-18 00:48:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:19,389 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-18 00:48:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-18 00:48:19,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:19,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:19,390 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-18 00:48:19,390 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-18 00:48:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:19,392 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-18 00:48:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-18 00:48:19,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:19,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:19,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:19,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-18 00:48:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2020-07-18 00:48:19,394 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 37 [2020-07-18 00:48:19,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:19,395 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2020-07-18 00:48:19,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-18 00:48:19,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2020-07-18 00:48:19,458 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:48:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-18 00:48:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 00:48:19,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:19,461 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:19,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:48:19,462 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:19,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash 740027288, now seen corresponding path program 6 times [2020-07-18 00:48:19,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:19,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938452752] [2020-07-18 00:48:19,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:21,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-18 00:48:21,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1495#true} {1495#true} #37#return; {1495#true} is VALID [2020-07-18 00:48:21,749 INFO L263 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1495#true} is VALID [2020-07-18 00:48:21,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-18 00:48:21,749 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1495#true} {1495#true} #37#return; {1495#true} is VALID [2020-07-18 00:48:21,749 INFO L263 TraceCheckUtils]: 3: Hoare triple {1495#true} call #t~ret1 := main(); {1495#true} is VALID [2020-07-18 00:48:21,750 INFO L280 TraceCheckUtils]: 4: Hoare triple {1495#true} havoc ~i~0; {1495#true} is VALID [2020-07-18 00:48:21,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {1495#true} ~sn~0 := 0; {1499#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:21,751 INFO L280 TraceCheckUtils]: 6: Hoare triple {1499#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {1500#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-18 00:48:21,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {1500#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [53] L13-6-->L13-7_primed: Formula: (or (let ((.cse1 (div (+ (* v_oct_main_~sn~0_out_6 (- 1)) v_oct_main_~sn~0_in_6 4) (- 2))) (.cse0 (div (+ v_oct_main_~sn~0_out_6 (* v_oct_main_~sn~0_in_6 (- 1)) (- 4)) 2))) (and (<= v_oct_main_~i~0_out_6 (+ .cse0 v_oct_main_~i~0_in_6 2)) (<= (+ .cse1 v_oct_main_~i~0_in_6) 7) (<= (+ .cse1 v_oct_main_~i~0_in_6 2) v_oct_main_~i~0_out_6) (<= 0 .cse0))) (and (<= (+ (* (- 1) v_oct_main_~sn~0_out_6) v_oct_main_~sn~0_in_6) (- 2)) (<= (+ (* (- 1) v_oct_main_~sn~0_in_6) v_oct_main_~sn~0_out_6) 2) (<= (+ (* (- 1) v_oct_main_~i~0_out_6) v_oct_main_~i~0_in_6) (- 1)) (<= (* 2 v_oct_main_~i~0_in_6) 16) (<= (+ (* (- 1) v_oct_main_~i~0_in_6) v_oct_main_~i~0_out_6) 1))) InVars {main_~sn~0=v_oct_main_~sn~0_in_6, main_~i~0=v_oct_main_~i~0_in_6} OutVars{main_~i~0=v_oct_main_~i~0_out_6, main_#t~post0=|v_oct_main_#t~post0_out_6|, main_~sn~0=v_oct_main_~sn~0_out_6} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {1501#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-18 00:48:21,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {1501#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [52] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1502#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 00:48:21,755 INFO L263 TraceCheckUtils]: 9: Hoare triple {1502#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1503#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:21,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {1503#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1504#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:21,757 INFO L280 TraceCheckUtils]: 11: Hoare triple {1504#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1496#false} is VALID [2020-07-18 00:48:21,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2020-07-18 00:48:21,757 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:48:22,868 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:22,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938452752] [2020-07-18 00:48:22,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:22,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2020-07-18 00:48:22,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426484394] [2020-07-18 00:48:22,870 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2020-07-18 00:48:22,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:22,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2020-07-18 00:48:22,933 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:48:22,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-07-18 00:48:22,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:22,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-07-18 00:48:22,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2020-07-18 00:48:22,935 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 31 states. [2020-07-18 00:48:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:23,653 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-18 00:48:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-18 00:48:23,653 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2020-07-18 00:48:23,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 00:48:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2020-07-18 00:48:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 00:48:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2020-07-18 00:48:23,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 54 transitions. [2020-07-18 00:48:23,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:23,739 INFO L225 Difference]: With dead ends: 54 [2020-07-18 00:48:23,740 INFO L226 Difference]: Without dead ends: 49 [2020-07-18 00:48:23,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=850, Unknown=0, NotChecked=0, Total=1056 [2020-07-18 00:48:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-18 00:48:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2020-07-18 00:48:23,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:23,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2020-07-18 00:48:23,811 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2020-07-18 00:48:23,811 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2020-07-18 00:48:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:23,814 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-18 00:48:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-18 00:48:23,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:23,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:23,814 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2020-07-18 00:48:23,815 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2020-07-18 00:48:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:23,817 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-18 00:48:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-18 00:48:23,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:23,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:23,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:23,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 00:48:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-07-18 00:48:23,820 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 42 [2020-07-18 00:48:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:23,820 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-07-18 00:48:23,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-07-18 00:48:23,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2020-07-18 00:48:23,887 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:48:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-18 00:48:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 00:48:23,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:23,889 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:23,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:48:23,890 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1053966965, now seen corresponding path program 7 times [2020-07-18 00:48:23,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:23,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701575511] [2020-07-18 00:48:23,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:26,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {1835#true} assume true; {1835#true} is VALID [2020-07-18 00:48:26,197 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1835#true} {1835#true} #37#return; {1835#true} is VALID [2020-07-18 00:48:26,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1835#true} is VALID [2020-07-18 00:48:26,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {1835#true} assume true; {1835#true} is VALID [2020-07-18 00:48:26,198 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1835#true} {1835#true} #37#return; {1835#true} is VALID [2020-07-18 00:48:26,198 INFO L263 TraceCheckUtils]: 3: Hoare triple {1835#true} call #t~ret1 := main(); {1835#true} is VALID [2020-07-18 00:48:26,198 INFO L280 TraceCheckUtils]: 4: Hoare triple {1835#true} havoc ~i~0; {1835#true} is VALID [2020-07-18 00:48:26,205 INFO L280 TraceCheckUtils]: 5: Hoare triple {1835#true} ~sn~0 := 0; {1839#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:26,206 INFO L280 TraceCheckUtils]: 6: Hoare triple {1839#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {1840#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-18 00:48:26,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {1840#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [55] L13-6-->L13-7_primed: Formula: (or (let ((.cse0 (div (+ (* v_oct_main_~sn~0_out_7 (- 1)) v_oct_main_~sn~0_in_7 4) (- 2)))) (and (<= (+ .cse0 v_oct_main_~i~0_in_7 2) v_oct_main_~i~0_out_7) (<= (+ .cse0 v_oct_main_~i~0_in_7) 7) (<= v_oct_main_~i~0_out_7 (+ (div (+ v_oct_main_~sn~0_out_7 (* v_oct_main_~sn~0_in_7 (- 1)) (- 4)) 2) v_oct_main_~i~0_in_7 2)) (<= (+ v_oct_main_~i~0_in_7 2) v_oct_main_~i~0_out_7))) (and (<= (+ (* (- 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)) (<= (* 2 v_oct_main_~i~0_in_7) 16) (<= (+ (* (- 1) v_oct_main_~sn~0_in_7) v_oct_main_~sn~0_out_7) 2) (<= (+ (* (- 1) v_oct_main_~sn~0_out_7) v_oct_main_~sn~0_in_7) (- 2)))) InVars {main_~sn~0=v_oct_main_~sn~0_in_7, main_~i~0=v_oct_main_~i~0_in_7} OutVars{main_~i~0=v_oct_main_~i~0_out_7, main_#t~post0=|v_oct_main_#t~post0_out_7|, main_~sn~0=v_oct_main_~sn~0_out_7} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {1841#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-18 00:48:26,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {1841#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [54] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1842#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 00:48:26,212 INFO L263 TraceCheckUtils]: 9: Hoare triple {1842#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1843#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:26,212 INFO L280 TraceCheckUtils]: 10: Hoare triple {1843#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1844#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:26,213 INFO L280 TraceCheckUtils]: 11: Hoare triple {1844#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1836#false} is VALID [2020-07-18 00:48:26,213 INFO L280 TraceCheckUtils]: 12: Hoare triple {1836#false} assume !false; {1836#false} is VALID [2020-07-18 00:48:26,213 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:48:27,588 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:27,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701575511] [2020-07-18 00:48:27,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:27,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2020-07-18 00:48:27,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31861528] [2020-07-18 00:48:27,590 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2020-07-18 00:48:27,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:27,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2020-07-18 00:48:27,659 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:48:27,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-07-18 00:48:27,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:27,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-07-18 00:48:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2020-07-18 00:48:27,661 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 35 states. [2020-07-18 00:48:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:28,306 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-18 00:48:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-18 00:48:28,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2020-07-18 00:48:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 00:48:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2020-07-18 00:48:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 00:48:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2020-07-18 00:48:28,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 59 transitions. [2020-07-18 00:48:28,397 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:48:28,398 INFO L225 Difference]: With dead ends: 59 [2020-07-18 00:48:28,399 INFO L226 Difference]: Without dead ends: 54 [2020-07-18 00:48:28,402 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2020-07-18 00:48:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-18 00:48:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-07-18 00:48:28,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:28,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2020-07-18 00:48:28,485 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2020-07-18 00:48:28,485 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2020-07-18 00:48:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:28,487 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-18 00:48:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-07-18 00:48:28,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:28,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:28,488 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2020-07-18 00:48:28,488 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2020-07-18 00:48:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:28,490 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-18 00:48:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-07-18 00:48:28,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:28,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:28,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:28,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-18 00:48:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2020-07-18 00:48:28,493 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2020-07-18 00:48:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:28,494 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2020-07-18 00:48:28,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-07-18 00:48:28,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2020-07-18 00:48:28,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-18 00:48:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 00:48:28,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:28,563 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:28,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:48:28,564 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:28,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1480544840, now seen corresponding path program 8 times [2020-07-18 00:48:28,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:28,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348300497] [2020-07-18 00:48:28,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:30,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {2209#true} assume true; {2209#true} is VALID [2020-07-18 00:48:30,869 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2209#true} {2209#true} #37#return; {2209#true} is VALID [2020-07-18 00:48:30,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {2209#true} call ULTIMATE.init(); {2209#true} is VALID [2020-07-18 00:48:30,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {2209#true} assume true; {2209#true} is VALID [2020-07-18 00:48:30,870 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2209#true} {2209#true} #37#return; {2209#true} is VALID [2020-07-18 00:48:30,870 INFO L263 TraceCheckUtils]: 3: Hoare triple {2209#true} call #t~ret1 := main(); {2209#true} is VALID [2020-07-18 00:48:30,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {2209#true} havoc ~i~0; {2209#true} is VALID [2020-07-18 00:48:30,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {2209#true} ~sn~0 := 0; {2213#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:30,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {2213#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {2214#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-18 00:48:30,873 INFO L280 TraceCheckUtils]: 7: Hoare triple {2214#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [57] L13-6-->L13-7_primed: Formula: (or (and (<= (+ (* (- 1) v_oct_main_~sn~0_out_8) v_oct_main_~sn~0_in_8) (- 2)) (<= (* 2 v_oct_main_~i~0_in_8) 16) (<= (+ (* (- 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)) (<= (+ (* (- 1) v_oct_main_~sn~0_in_8) v_oct_main_~sn~0_out_8) 2)) (let ((.cse0 (div (+ (* v_oct_main_~sn~0_out_8 (- 1)) v_oct_main_~sn~0_in_8 4) (- 2)))) (and (<= (+ .cse0 v_oct_main_~i~0_in_8 2) v_oct_main_~i~0_out_8) (<= (+ v_oct_main_~i~0_in_8 2) v_oct_main_~i~0_out_8) (<= (+ .cse0 v_oct_main_~i~0_in_8) 7) (<= v_oct_main_~i~0_out_8 (+ (div (+ v_oct_main_~sn~0_out_8 (* v_oct_main_~sn~0_in_8 (- 1)) (- 4)) 2) v_oct_main_~i~0_in_8 2))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_8, main_~i~0=v_oct_main_~i~0_in_8} OutVars{main_~i~0=v_oct_main_~i~0_out_8, main_#t~post0=|v_oct_main_#t~post0_out_8|, main_~sn~0=v_oct_main_~sn~0_out_8} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {2215#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-18 00:48:30,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {2215#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [56] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {2216#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-18 00:48:30,878 INFO L263 TraceCheckUtils]: 9: Hoare triple {2216#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2217#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:30,878 INFO L280 TraceCheckUtils]: 10: Hoare triple {2217#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2218#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:30,879 INFO L280 TraceCheckUtils]: 11: Hoare triple {2218#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2210#false} is VALID [2020-07-18 00:48:30,879 INFO L280 TraceCheckUtils]: 12: Hoare triple {2210#false} assume !false; {2210#false} is VALID [2020-07-18 00:48:30,879 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:48:32,507 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:32,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348300497] [2020-07-18 00:48:32,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:32,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2020-07-18 00:48:32,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187497788] [2020-07-18 00:48:32,509 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2020-07-18 00:48:32,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:32,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2020-07-18 00:48:32,588 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:48:32,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-07-18 00:48:32,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:32,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-07-18 00:48:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1332, Unknown=0, NotChecked=0, Total=1640 [2020-07-18 00:48:32,590 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 39 states. [2020-07-18 00:48:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,208 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-18 00:48:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-18 00:48:33,209 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2020-07-18 00:48:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-18 00:48:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-07-18 00:48:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-18 00:48:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-07-18 00:48:33,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2020-07-18 00:48:33,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:33,300 INFO L225 Difference]: With dead ends: 53 [2020-07-18 00:48:33,300 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:48:33,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=1481, Unknown=0, NotChecked=0, Total=1806 [2020-07-18 00:48:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:48:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:48:33,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:33,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:33,303 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:33,303 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,303 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:48:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:33,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:33,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:33,303 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:33,304 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,304 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:48:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:33,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:33,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:33,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:33,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:48:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:48:33,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2020-07-18 00:48:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:33,305 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:48:33,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-07-18 00:48:33,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:48:33,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:33,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:33,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:48:33,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:48:33,698 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:48:33,699 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:48:33,699 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:48:33,699 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:48:33,699 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:48:33,699 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:48:33,699 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-18 00:48:33,699 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-18 00:48:33,699 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= main_~i~0 8) (<= .cse1 .cse0))) [2020-07-18 00:48:33,699 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~sn~0 0) (<= 0 main_~sn~0)) [2020-07-18 00:48:33,699 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 17) the Hoare annotation is: true [2020-07-18 00:48:33,700 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 00:48:33,700 INFO L264 CegarLoopResult]: At program point L13-3(lines 13 15) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= main_~sn~0 .cse0) (<= main_~i~0 8) (<= .cse0 main_~sn~0))) [2020-07-18 00:48:33,700 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= main_~sn~0 .cse0) (<= main_~i~0 8) (<= .cse0 main_~sn~0) (= |main_#t~post0| main_~i~0))) [2020-07-18 00:48:33,700 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse0 (* 2 |main_#t~post0|))) (and (<= main_~sn~0 .cse0) (= main_~i~0 (+ |main_#t~post0| 1)) (<= .cse0 main_~sn~0) (<= |main_#t~post0| 8))) [2020-07-18 00:48:33,700 INFO L264 CegarLoopResult]: At program point L13-6(lines 13 15) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= main_~i~0 9))) [2020-07-18 00:48:33,700 INFO L264 CegarLoopResult]: At program point L13-7(lines 13 15) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (< 8 main_~i~0) (<= main_~i~0 9))) [2020-07-18 00:48:33,700 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-18 00:48:33,700 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 3 8) the Hoare annotation is: true [2020-07-18 00:48:33,700 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:48:33,701 INFO L264 CegarLoopResult]: At program point L4(lines 4 6) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:48:33,701 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:48:33,701 INFO L271 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2020-07-18 00:48:33,710 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:48:33,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:48:33 BoogieIcfgContainer [2020-07-18 00:48:33,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:48:33,725 INFO L168 Benchmark]: Toolchain (without parser) took 33685.11 ms. Allocated memory was 138.4 MB in the beginning and 341.3 MB in the end (delta: 202.9 MB). Free memory was 103.2 MB in the beginning and 240.5 MB in the end (delta: -137.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:33,726 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:48:33,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.28 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 93.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:33,731 INFO L168 Benchmark]: Boogie Preprocessor took 107.28 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 93.4 MB in the beginning and 181.5 MB in the end (delta: -88.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:33,731 INFO L168 Benchmark]: RCFGBuilder took 272.22 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 167.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:33,732 INFO L168 Benchmark]: TraceAbstraction took 33061.15 ms. Allocated memory was 202.4 MB in the beginning and 341.3 MB in the end (delta: 138.9 MB). Free memory was 167.0 MB in the beginning and 240.5 MB in the end (delta: -73.6 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:33,735 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.28 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 93.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.28 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 93.4 MB in the beginning and 181.5 MB in the end (delta: -88.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 272.22 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 167.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33061.15 ms. Allocated memory was 202.4 MB in the beginning and 341.3 MB in the end (delta: 138.9 MB). Free memory was 167.0 MB in the beginning and 240.5 MB in the end (delta: -73.6 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (sn + 2 <= 2 * i && 2 * i <= sn + 2) && i <= 9 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 32.5s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 138 SDtfs, 110 SDslu, 1056 SDs, 0 SdLazy, 948 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 65 SyntacticMatches, 43 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 10 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 77 PreInvPairs, 136 NumberOfFragments, 141 HoareAnnotationTreeSize, 77 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 622 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...