/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/recHanoi03-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:02:02,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:02:02,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:02:02,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:02:02,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:02:02,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:02:02,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:02:02,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:02:02,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:02:02,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:02:02,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:02:02,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:02:02,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:02:02,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:02:02,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:02:02,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:02:02,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:02:02,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:02:02,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:02:02,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:02:02,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:02:02,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:02:02,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:02:02,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:02:02,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:02:02,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:02:02,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:02:02,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:02:02,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:02:02,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:02:02,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:02:02,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:02:02,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:02:02,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:02:02,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:02:02,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:02:02,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:02:02,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:02:02,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:02:02,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:02:02,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:02:02,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:02:02,475 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:02:02,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:02:02,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:02:02,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:02:02,480 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:02:02,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:02:02,481 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:02:02,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:02:02,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:02:02,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:02:02,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:02:02,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:02:02,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:02:02,484 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:02:02,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:02:02,484 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:02:02,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:02:02,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:02:02,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:02:02,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:02:02,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:02:02,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:02:02,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:02:02,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:02:02,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:02:02,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:02:02,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:02:02,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:02:02,491 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:02:02,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:02:02,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:02:02,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:02:02,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:02:02,817 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:02:02,818 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:02:02,819 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/recHanoi03-2.c [2020-07-08 12:02:02,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f14ad87/3f5f2db6e82f4fda813a5e9a8f60a3b7/FLAG2d7699f49 [2020-07-08 12:02:03,399 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:02:03,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/recHanoi03-2.c [2020-07-08 12:02:03,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f14ad87/3f5f2db6e82f4fda813a5e9a8f60a3b7/FLAG2d7699f49 [2020-07-08 12:02:03,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f14ad87/3f5f2db6e82f4fda813a5e9a8f60a3b7 [2020-07-08 12:02:03,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:02:03,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:02:03,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:02:03,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:02:03,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:02:03,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:02:03" (1/1) ... [2020-07-08 12:02:03,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0efb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:03, skipping insertion in model container [2020-07-08 12:02:03,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:02:03" (1/1) ... [2020-07-08 12:02:03,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:02:03,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:02:03,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:02:04,000 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:02:04,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:02:04,033 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:02:04,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04 WrapperNode [2020-07-08 12:02:04,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:02:04,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:02:04,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:02:04,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:02:04,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (1/1) ... [2020-07-08 12:02:04,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (1/1) ... [2020-07-08 12:02:04,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (1/1) ... [2020-07-08 12:02:04,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (1/1) ... [2020-07-08 12:02:04,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (1/1) ... [2020-07-08 12:02:04,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (1/1) ... [2020-07-08 12:02:04,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (1/1) ... [2020-07-08 12:02:04,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:02:04,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:02:04,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:02:04,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:02:04,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (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-08 12:02:04,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:02:04,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:02:04,202 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2020-07-08 12:02:04,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:02:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:02:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:02:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2020-07-08 12:02:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:02:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:02:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:02:04,488 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:02:04,488 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:02:04,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:02:04 BoogieIcfgContainer [2020-07-08 12:02:04,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:02:04,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:02:04,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:02:04,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:02:04,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:02:03" (1/3) ... [2020-07-08 12:02:04,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529b0a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:02:04, skipping insertion in model container [2020-07-08 12:02:04,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:02:04" (2/3) ... [2020-07-08 12:02:04,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529b0a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:02:04, skipping insertion in model container [2020-07-08 12:02:04,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:02:04" (3/3) ... [2020-07-08 12:02:04,512 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2020-07-08 12:02:04,520 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:02:04,526 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:02:04,540 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:02:04,564 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:02:04,564 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:02:04,565 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:02:04,565 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:02:04,565 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:02:04,565 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:02:04,565 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:02:04,566 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:02:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-08 12:02:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:02:04,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:02:04,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:02:04,591 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:02:04,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:02:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash 913793727, now seen corresponding path program 1 times [2020-07-08 12:02:04,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:02:04,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279911786] [2020-07-08 12:02:04,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:02:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:04,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-08 12:02:04,850 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-08 12:02:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:04,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~n := #in~n; {34#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:04,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:04,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} assume true; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:04,921 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} {24#true} #34#return; {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} is VALID [2020-07-08 12:02:04,922 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-08 12:02:04,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-08 12:02:04,923 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-08 12:02:04,924 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-08 12:02:04,924 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2020-07-08 12:02:04,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !(~n~0 < 1 || ~n~0 > 31); {24#true} is VALID [2020-07-08 12:02:04,925 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#true} call #t~ret2 := hanoi(~n~0); {24#true} is VALID [2020-07-08 12:02:04,926 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} ~n := #in~n; {34#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:04,928 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:04,929 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} assume true; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:04,931 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} {24#true} #34#return; {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} is VALID [2020-07-08 12:02:04,933 INFO L280 TraceCheckUtils]: 11: Hoare triple {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {33#(and (= 1 main_~n~0) (<= 1 main_~result~0))} is VALID [2020-07-08 12:02:04,934 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#(and (= 1 main_~n~0) (<= 1 main_~result~0))} assume !(~result~0 >= ~n~0); {25#false} is VALID [2020-07-08 12:02:04,935 INFO L280 TraceCheckUtils]: 13: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-08 12:02:04,937 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-08 12:02:04,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279911786] [2020-07-08 12:02:04,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:02:04,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:02:04,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761244174] [2020-07-08 12:02:04,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-08 12:02:04,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:02:04,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:02:04,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:02:04,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:02:04,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:02:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:02:04,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:02:04,998 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 6 states. [2020-07-08 12:02:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:05,303 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-08 12:02:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:02:05,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-08 12:02:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:02:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:02:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-08 12:02:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:02:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-08 12:02:05,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-08 12:02:05,389 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-08 12:02:05,402 INFO L225 Difference]: With dead ends: 33 [2020-07-08 12:02:05,402 INFO L226 Difference]: Without dead ends: 19 [2020-07-08 12:02:05,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:02:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-08 12:02:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-08 12:02:05,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:02:05,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-08 12:02:05,459 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 12:02:05,459 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 12:02:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:05,465 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-08 12:02:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-08 12:02:05,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:02:05,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:02:05,467 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 12:02:05,467 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 12:02:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:05,472 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-08 12:02:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-08 12:02:05,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:02:05,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:02:05,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:02:05,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:02:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:02:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-08 12:02:05,479 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2020-07-08 12:02:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:02:05,479 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-08 12:02:05,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:02:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-08 12:02:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:02:05,481 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:02:05,482 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:02:05,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:02:05,482 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:02:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:02:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1998834103, now seen corresponding path program 1 times [2020-07-08 12:02:05,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:02:05,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852059898] [2020-07-08 12:02:05,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:02:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:05,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-08 12:02:05,592 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-08 12:02:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:05,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:05,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:05,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:05,714 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:05,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:05,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:05,716 INFO L263 TraceCheckUtils]: 2: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-08 12:02:05,717 INFO L280 TraceCheckUtils]: 3: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:05,718 INFO L280 TraceCheckUtils]: 4: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:05,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:05,720 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:05,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-08 12:02:05,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} assume true; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-08 12:02:05,724 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} {144#true} #34#return; {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} is VALID [2020-07-08 12:02:05,725 INFO L263 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2020-07-08 12:02:05,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-08 12:02:05,725 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-08 12:02:05,726 INFO L263 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret3 := main(); {144#true} is VALID [2020-07-08 12:02:05,726 INFO L280 TraceCheckUtils]: 4: Hoare triple {144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {144#true} is VALID [2020-07-08 12:02:05,726 INFO L280 TraceCheckUtils]: 5: Hoare triple {144#true} assume !(~n~0 < 1 || ~n~0 > 31); {144#true} is VALID [2020-07-08 12:02:05,727 INFO L263 TraceCheckUtils]: 6: Hoare triple {144#true} call #t~ret2 := hanoi(~n~0); {144#true} is VALID [2020-07-08 12:02:05,728 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:05,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:05,729 INFO L263 TraceCheckUtils]: 9: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-08 12:02:05,729 INFO L280 TraceCheckUtils]: 10: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:05,730 INFO L280 TraceCheckUtils]: 11: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:05,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:05,733 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:05,735 INFO L280 TraceCheckUtils]: 14: Hoare triple {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-08 12:02:05,735 INFO L280 TraceCheckUtils]: 15: Hoare triple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} assume true; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-08 12:02:05,737 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} {144#true} #34#return; {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} is VALID [2020-07-08 12:02:05,738 INFO L280 TraceCheckUtils]: 17: Hoare triple {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {159#(<= (+ main_~n~0 1) main_~result~0)} is VALID [2020-07-08 12:02:05,739 INFO L280 TraceCheckUtils]: 18: Hoare triple {159#(<= (+ main_~n~0 1) main_~result~0)} assume !(~result~0 >= ~n~0); {145#false} is VALID [2020-07-08 12:02:05,739 INFO L280 TraceCheckUtils]: 19: Hoare triple {145#false} assume !false; {145#false} is VALID [2020-07-08 12:02:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:02:05,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852059898] [2020-07-08 12:02:05,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862022087] [2020-07-08 12:02:05,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:02:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:05,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-08 12:02:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:05,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:02:06,131 INFO L263 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2020-07-08 12:02:06,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-08 12:02:06,132 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-08 12:02:06,132 INFO L263 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret3 := main(); {144#true} is VALID [2020-07-08 12:02:06,132 INFO L280 TraceCheckUtils]: 4: Hoare triple {144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {144#true} is VALID [2020-07-08 12:02:06,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {144#true} assume !(~n~0 < 1 || ~n~0 > 31); {144#true} is VALID [2020-07-08 12:02:06,133 INFO L263 TraceCheckUtils]: 6: Hoare triple {144#true} call #t~ret2 := hanoi(~n~0); {144#true} is VALID [2020-07-08 12:02:06,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#true} ~n := #in~n; {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-08 12:02:06,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-08 12:02:06,135 INFO L263 TraceCheckUtils]: 9: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-08 12:02:06,136 INFO L280 TraceCheckUtils]: 10: Hoare triple {144#true} ~n := #in~n; {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-08 12:02:06,137 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-08 12:02:06,138 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-08 12:02:06,140 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {192#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {212#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:06,141 INFO L280 TraceCheckUtils]: 14: Hoare triple {212#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-08 12:02:06,142 INFO L280 TraceCheckUtils]: 15: Hoare triple {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} assume true; {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-08 12:02:06,144 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} {144#true} #34#return; {223#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| |main_#t~ret2|))) (<= main_~n~0 2))} is VALID [2020-07-08 12:02:06,146 INFO L280 TraceCheckUtils]: 17: Hoare triple {223#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| |main_#t~ret2|))) (<= main_~n~0 2))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {227#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| main_~result~0))) (<= main_~n~0 2))} is VALID [2020-07-08 12:02:06,147 INFO L280 TraceCheckUtils]: 18: Hoare triple {227#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| main_~result~0))) (<= main_~n~0 2))} assume !(~result~0 >= ~n~0); {145#false} is VALID [2020-07-08 12:02:06,147 INFO L280 TraceCheckUtils]: 19: Hoare triple {145#false} assume !false; {145#false} is VALID [2020-07-08 12:02:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:02:06,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:02:06,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-08 12:02:06,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651288389] [2020-07-08 12:02:06,153 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2020-07-08 12:02:06,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:02:06,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:02:06,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:02:06,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:02:06,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:02:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:02:06,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:02:06,201 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 14 states. [2020-07-08 12:02:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:06,624 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-08 12:02:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:02:06,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2020-07-08 12:02:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:02:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:02:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2020-07-08 12:02:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:02:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2020-07-08 12:02:06,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2020-07-08 12:02:06,672 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-08 12:02:06,674 INFO L225 Difference]: With dead ends: 26 [2020-07-08 12:02:06,675 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 12:02:06,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:02:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 12:02:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-08 12:02:06,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:02:06,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-08 12:02:06,685 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:02:06,686 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:02:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:06,689 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:02:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:02:06,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:02:06,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:02:06,690 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:02:06,690 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:02:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:06,693 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-08 12:02:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:02:06,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:02:06,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:02:06,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:02:06,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:02:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:02:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-08 12:02:06,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2020-07-08 12:02:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:02:06,698 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-08 12:02:06,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:02:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-08 12:02:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:02:06,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:02:06,700 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:02:06,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:02:06,913 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:02:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:02:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 293522751, now seen corresponding path program 2 times [2020-07-08 12:02:06,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:02:06,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527821369] [2020-07-08 12:02:06,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:02:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:06,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-08 12:02:06,977 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-08 12:02:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:07,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,142 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:07,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,144 INFO L263 TraceCheckUtils]: 2: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-08 12:02:07,144 INFO L280 TraceCheckUtils]: 3: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,146 INFO L280 TraceCheckUtils]: 5: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,148 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:07,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,149 INFO L280 TraceCheckUtils]: 8: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,151 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:07,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,153 INFO L263 TraceCheckUtils]: 2: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-08 12:02:07,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,154 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,155 INFO L263 TraceCheckUtils]: 5: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-08 12:02:07,155 INFO L280 TraceCheckUtils]: 6: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,156 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,159 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:07,160 INFO L280 TraceCheckUtils]: 10: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,161 INFO L280 TraceCheckUtils]: 11: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,162 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:07,163 INFO L280 TraceCheckUtils]: 13: Hoare triple {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-08 12:02:07,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} assume true; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-08 12:02:07,165 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} {345#true} #34#return; {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} is VALID [2020-07-08 12:02:07,166 INFO L263 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2020-07-08 12:02:07,167 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-08 12:02:07,167 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-08 12:02:07,167 INFO L263 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret3 := main(); {345#true} is VALID [2020-07-08 12:02:07,168 INFO L280 TraceCheckUtils]: 4: Hoare triple {345#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {345#true} is VALID [2020-07-08 12:02:07,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {345#true} assume !(~n~0 < 1 || ~n~0 > 31); {345#true} is VALID [2020-07-08 12:02:07,168 INFO L263 TraceCheckUtils]: 6: Hoare triple {345#true} call #t~ret2 := hanoi(~n~0); {345#true} is VALID [2020-07-08 12:02:07,169 INFO L280 TraceCheckUtils]: 7: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,170 INFO L263 TraceCheckUtils]: 9: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-08 12:02:07,171 INFO L280 TraceCheckUtils]: 10: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,171 INFO L280 TraceCheckUtils]: 11: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,172 INFO L263 TraceCheckUtils]: 12: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-08 12:02:07,172 INFO L280 TraceCheckUtils]: 13: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:07,173 INFO L280 TraceCheckUtils]: 14: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,174 INFO L280 TraceCheckUtils]: 15: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,176 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:07,177 INFO L280 TraceCheckUtils]: 17: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,177 INFO L280 TraceCheckUtils]: 18: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:07,179 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:07,180 INFO L280 TraceCheckUtils]: 20: Hoare triple {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-08 12:02:07,181 INFO L280 TraceCheckUtils]: 21: Hoare triple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} assume true; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-08 12:02:07,182 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} {345#true} #34#return; {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} is VALID [2020-07-08 12:02:07,183 INFO L280 TraceCheckUtils]: 23: Hoare triple {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {366#(<= (+ main_~n~0 4) main_~result~0)} is VALID [2020-07-08 12:02:07,187 INFO L280 TraceCheckUtils]: 24: Hoare triple {366#(<= (+ main_~n~0 4) main_~result~0)} assume !(~result~0 >= ~n~0); {346#false} is VALID [2020-07-08 12:02:07,187 INFO L280 TraceCheckUtils]: 25: Hoare triple {346#false} assume !false; {346#false} is VALID [2020-07-08 12:02:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:02:07,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527821369] [2020-07-08 12:02:07,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536964052] [2020-07-08 12:02:07,189 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:02:07,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:02:07,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:02:07,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-08 12:02:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:07,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:02:09,835 INFO L263 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2020-07-08 12:02:09,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-08 12:02:09,836 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-08 12:02:09,836 INFO L263 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret3 := main(); {345#true} is VALID [2020-07-08 12:02:09,836 INFO L280 TraceCheckUtils]: 4: Hoare triple {345#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {345#true} is VALID [2020-07-08 12:02:09,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {345#true} assume !(~n~0 < 1 || ~n~0 > 31); {345#true} is VALID [2020-07-08 12:02:09,837 INFO L263 TraceCheckUtils]: 6: Hoare triple {345#true} call #t~ret2 := hanoi(~n~0); {345#true} is VALID [2020-07-08 12:02:09,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-08 12:02:09,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-08 12:02:09,839 INFO L263 TraceCheckUtils]: 9: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-08 12:02:09,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-08 12:02:09,843 INFO L280 TraceCheckUtils]: 11: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-08 12:02:09,843 INFO L263 TraceCheckUtils]: 12: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-08 12:02:09,845 INFO L280 TraceCheckUtils]: 13: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-08 12:02:09,847 INFO L280 TraceCheckUtils]: 14: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-08 12:02:09,849 INFO L280 TraceCheckUtils]: 15: Hoare triple {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-08 12:02:09,851 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {411#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {440#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:09,852 INFO L280 TraceCheckUtils]: 17: Hoare triple {440#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-08 12:02:09,853 INFO L280 TraceCheckUtils]: 18: Hoare triple {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} assume true; {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-08 12:02:09,855 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} {411#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {451#(and (<= |hanoi_#in~n| 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} is VALID [2020-07-08 12:02:09,858 INFO L280 TraceCheckUtils]: 20: Hoare triple {451#(and (<= |hanoi_#in~n| 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} is VALID [2020-07-08 12:02:09,859 INFO L280 TraceCheckUtils]: 21: Hoare triple {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} assume true; {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} is VALID [2020-07-08 12:02:09,862 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} {345#true} #34#return; {462#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_5| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))) (<= main_~n~0 3))} is VALID [2020-07-08 12:02:09,866 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_5| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))) (<= main_~n~0 3))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {466#(and (<= main_~n~0 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_5| main_~result~0) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} is VALID [2020-07-08 12:02:09,868 INFO L280 TraceCheckUtils]: 24: Hoare triple {466#(and (<= main_~n~0 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_5| main_~result~0) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} assume !(~result~0 >= ~n~0); {346#false} is VALID [2020-07-08 12:02:09,868 INFO L280 TraceCheckUtils]: 25: Hoare triple {346#false} assume !false; {346#false} is VALID [2020-07-08 12:02:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:02:09,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:02:09,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-07-08 12:02:09,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773519584] [2020-07-08 12:02:09,873 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-08 12:02:09,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:02:09,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-08 12:02:09,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:02:09,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-08 12:02:09,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:02:09,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-08 12:02:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=263, Unknown=1, NotChecked=0, Total=306 [2020-07-08 12:02:09,950 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 18 states. [2020-07-08 12:02:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:10,729 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-08 12:02:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 12:02:10,730 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-08 12:02:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:02:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:02:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2020-07-08 12:02:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:02:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2020-07-08 12:02:10,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 36 transitions. [2020-07-08 12:02:10,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:02:10,801 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:02:10,802 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 12:02:10,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=85, Invalid=514, Unknown=1, NotChecked=0, Total=600 [2020-07-08 12:02:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 12:02:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-08 12:02:10,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:02:10,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-08 12:02:10,813 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 12:02:10,813 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 12:02:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:10,816 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:02:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:02:10,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:02:10,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:02:10,817 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 12:02:10,817 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 12:02:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:02:10,825 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:02:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:02:10,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:02:10,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:02:10,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:02:10,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:02:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 12:02:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-08 12:02:10,829 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2020-07-08 12:02:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:02:10,829 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-08 12:02:10,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-08 12:02:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:02:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 12:02:10,831 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:02:10,831 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:02:11,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:02:11,034 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:02:11,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:02:11,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1152432193, now seen corresponding path program 3 times [2020-07-08 12:02:11,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:02:11,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282186904] [2020-07-08 12:02:11,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:02:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:11,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-08 12:02:11,111 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-08 12:02:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:11,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,419 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,422 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,423 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,423 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,424 INFO L280 TraceCheckUtils]: 5: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,426 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,427 INFO L280 TraceCheckUtils]: 7: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,428 INFO L280 TraceCheckUtils]: 8: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,429 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,430 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,431 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,432 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,433 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,433 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,434 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,435 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,437 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,438 INFO L280 TraceCheckUtils]: 10: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,439 INFO L280 TraceCheckUtils]: 11: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,441 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,442 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,444 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,449 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,450 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,451 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,452 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,454 INFO L263 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,456 INFO L280 TraceCheckUtils]: 9: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,462 INFO L280 TraceCheckUtils]: 10: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,464 INFO L280 TraceCheckUtils]: 11: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,466 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,467 INFO L280 TraceCheckUtils]: 13: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,468 INFO L280 TraceCheckUtils]: 14: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,470 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,472 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,473 INFO L280 TraceCheckUtils]: 17: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,475 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,477 INFO L280 TraceCheckUtils]: 19: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,478 INFO L280 TraceCheckUtils]: 20: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,480 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,482 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,483 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,484 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,485 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,485 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,486 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,486 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,487 INFO L263 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,489 INFO L263 TraceCheckUtils]: 11: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,489 INFO L280 TraceCheckUtils]: 12: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,490 INFO L280 TraceCheckUtils]: 13: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,494 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,497 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,499 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,500 INFO L280 TraceCheckUtils]: 20: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,502 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,504 INFO L280 TraceCheckUtils]: 22: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,505 INFO L280 TraceCheckUtils]: 23: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,507 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,509 INFO L280 TraceCheckUtils]: 25: Hoare triple {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-08 12:02:11,510 INFO L280 TraceCheckUtils]: 26: Hoare triple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} assume true; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-08 12:02:11,511 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} {618#true} #34#return; {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} is VALID [2020-07-08 12:02:11,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2020-07-08 12:02:11,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-08 12:02:11,514 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-08 12:02:11,515 INFO L263 TraceCheckUtils]: 3: Hoare triple {618#true} call #t~ret3 := main(); {618#true} is VALID [2020-07-08 12:02:11,515 INFO L280 TraceCheckUtils]: 4: Hoare triple {618#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {618#true} is VALID [2020-07-08 12:02:11,515 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#true} assume !(~n~0 < 1 || ~n~0 > 31); {618#true} is VALID [2020-07-08 12:02:11,516 INFO L263 TraceCheckUtils]: 6: Hoare triple {618#true} call #t~ret2 := hanoi(~n~0); {618#true} is VALID [2020-07-08 12:02:11,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,517 INFO L280 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,518 INFO L263 TraceCheckUtils]: 9: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,518 INFO L280 TraceCheckUtils]: 10: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,519 INFO L280 TraceCheckUtils]: 11: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,519 INFO L263 TraceCheckUtils]: 12: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,521 INFO L280 TraceCheckUtils]: 14: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,521 INFO L263 TraceCheckUtils]: 15: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,522 INFO L280 TraceCheckUtils]: 16: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,522 INFO L280 TraceCheckUtils]: 17: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,523 INFO L263 TraceCheckUtils]: 18: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:11,524 INFO L280 TraceCheckUtils]: 19: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-08 12:02:11,525 INFO L280 TraceCheckUtils]: 20: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,526 INFO L280 TraceCheckUtils]: 21: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,527 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,528 INFO L280 TraceCheckUtils]: 23: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,529 INFO L280 TraceCheckUtils]: 24: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,531 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,533 INFO L280 TraceCheckUtils]: 27: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,535 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,536 INFO L280 TraceCheckUtils]: 29: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,537 INFO L280 TraceCheckUtils]: 30: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-08 12:02:11,539 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-08 12:02:11,540 INFO L280 TraceCheckUtils]: 32: Hoare triple {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-08 12:02:11,541 INFO L280 TraceCheckUtils]: 33: Hoare triple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} assume true; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-08 12:02:11,543 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} {618#true} #34#return; {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} is VALID [2020-07-08 12:02:11,544 INFO L280 TraceCheckUtils]: 35: Hoare triple {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {651#(<= (+ main_~n~0 26) main_~result~0)} is VALID [2020-07-08 12:02:11,545 INFO L280 TraceCheckUtils]: 36: Hoare triple {651#(<= (+ main_~n~0 26) main_~result~0)} assume !(~result~0 >= ~n~0); {619#false} is VALID [2020-07-08 12:02:11,545 INFO L280 TraceCheckUtils]: 37: Hoare triple {619#false} assume !false; {619#false} is VALID [2020-07-08 12:02:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-08 12:02:11,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282186904] [2020-07-08 12:02:11,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334141177] [2020-07-08 12:02:11,549 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:02:11,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-08 12:02:11,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:02:11,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-08 12:02:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:02:11,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:02:45,380 INFO L263 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2020-07-08 12:02:45,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-08 12:02:45,381 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-08 12:02:45,381 INFO L263 TraceCheckUtils]: 3: Hoare triple {618#true} call #t~ret3 := main(); {618#true} is VALID [2020-07-08 12:02:45,382 INFO L280 TraceCheckUtils]: 4: Hoare triple {618#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {618#true} is VALID [2020-07-08 12:02:45,383 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#true} assume !(~n~0 < 1 || ~n~0 > 31); {732#(<= main_~n~0 31)} is VALID [2020-07-08 12:02:45,383 INFO L263 TraceCheckUtils]: 6: Hoare triple {732#(<= main_~n~0 31)} call #t~ret2 := hanoi(~n~0); {618#true} is VALID [2020-07-08 12:02:45,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-08 12:02:45,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-08 12:02:45,384 INFO L263 TraceCheckUtils]: 9: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:45,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-08 12:02:45,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-08 12:02:45,384 INFO L263 TraceCheckUtils]: 12: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:45,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-08 12:02:45,385 INFO L280 TraceCheckUtils]: 14: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-08 12:02:45,385 INFO L263 TraceCheckUtils]: 15: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:45,385 INFO L280 TraceCheckUtils]: 16: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-08 12:02:45,386 INFO L280 TraceCheckUtils]: 17: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-08 12:02:45,386 INFO L263 TraceCheckUtils]: 18: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-08 12:02:45,386 INFO L280 TraceCheckUtils]: 19: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-08 12:02:45,387 INFO L280 TraceCheckUtils]: 20: Hoare triple {618#true} assume 1 == ~n;#res := 1; {778#(<= 1 |hanoi_#res|)} is VALID [2020-07-08 12:02:45,388 INFO L280 TraceCheckUtils]: 21: Hoare triple {778#(<= 1 |hanoi_#res|)} assume true; {778#(<= 1 |hanoi_#res|)} is VALID [2020-07-08 12:02:45,391 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {778#(<= 1 |hanoi_#res|)} {618#true} #28#return; {785#(<= 1 |hanoi_#t~ret0|)} is VALID [2020-07-08 12:02:45,393 INFO L280 TraceCheckUtils]: 23: Hoare triple {785#(<= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} is VALID [2020-07-08 12:02:45,394 INFO L280 TraceCheckUtils]: 24: Hoare triple {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} assume true; {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} is VALID [2020-07-08 12:02:45,397 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} {618#true} #28#return; {796#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,401 INFO L280 TraceCheckUtils]: 26: Hoare triple {796#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,402 INFO L280 TraceCheckUtils]: 27: Hoare triple {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume true; {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,407 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} {618#true} #28#return; {807#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,411 INFO L280 TraceCheckUtils]: 29: Hoare triple {807#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,412 INFO L280 TraceCheckUtils]: 30: Hoare triple {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume true; {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,494 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} {618#true} #28#return; {818#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,511 INFO L280 TraceCheckUtils]: 32: Hoare triple {818#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,512 INFO L280 TraceCheckUtils]: 33: Hoare triple {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} assume true; {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-08 12:02:45,528 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} {732#(<= main_~n~0 31)} #34#return; {829#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} is VALID [2020-07-08 12:02:45,529 INFO L280 TraceCheckUtils]: 35: Hoare triple {829#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {833#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| main_~result~0) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} is VALID [2020-07-08 12:02:45,532 INFO L280 TraceCheckUtils]: 36: Hoare triple {833#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| main_~result~0) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} assume !(~result~0 >= ~n~0); {619#false} is VALID [2020-07-08 12:02:45,532 INFO L280 TraceCheckUtils]: 37: Hoare triple {619#false} assume !false; {619#false} is VALID [2020-07-08 12:02:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-08 12:02:45,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:02:45,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2020-07-08 12:02:45,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885427048] [2020-07-08 12:02:45,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-08 12:02:45,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:02:45,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:02:45,753 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-08 12:02:45,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:02:45,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:02:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:02:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=566, Unknown=15, NotChecked=0, Total=650 [2020-07-08 12:02:45,755 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2020-07-08 12:03:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:03:11,136 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:03:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 12:03:11,136 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-08 12:03:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:03:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:03:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2020-07-08 12:03:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:03:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2020-07-08 12:03:11,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 29 transitions. [2020-07-08 12:03:11,356 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-08 12:03:11,356 INFO L225 Difference]: With dead ends: 28 [2020-07-08 12:03:11,357 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:03:11,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=69, Invalid=566, Unknown=15, NotChecked=0, Total=650 [2020-07-08 12:03:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:03:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:03:11,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:03:11,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:03:11,359 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:03:11,359 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:03:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:03:11,360 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:03:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:03:11,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:03:11,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:03:11,361 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:03:11,361 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:03:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:03:11,361 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:03:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:03:11,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:03:11,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:03:11,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:03:11,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:03:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:03:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:03:11,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-08 12:03:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:03:11,362 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:03:11,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:03:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:03:11,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:03:11,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:03:11,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:03:11,619 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:03:11,619 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:03:11,619 INFO L268 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-07-08 12:03:11,619 INFO L268 CegarLoopResult]: For program point hanoiEXIT(lines 16 21) no Hoare annotation was computed. [2020-07-08 12:03:11,619 INFO L271 CegarLoopResult]: At program point hanoiENTRY(lines 16 21) the Hoare annotation is: true [2020-07-08 12:03:11,620 INFO L268 CegarLoopResult]: For program point hanoiFINAL(lines 16 21) no Hoare annotation was computed. [2020-07-08 12:03:11,620 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (= hanoi_~n |hanoi_#in~n|) [2020-07-08 12:03:11,620 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-08 12:03:11,621 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:03:11,621 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:03:11,621 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:03:11,621 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:03:11,621 INFO L268 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-07-08 12:03:11,621 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 33) no Hoare annotation was computed. [2020-07-08 12:03:11,622 INFO L268 CegarLoopResult]: For program point L30(lines 30 34) no Hoare annotation was computed. [2020-07-08 12:03:11,622 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 24 35) the Hoare annotation is: true [2020-07-08 12:03:11,622 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (<= main_~n~0 31) [2020-07-08 12:03:11,622 INFO L268 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-07-08 12:03:11,622 INFO L268 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-07-08 12:03:11,622 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 24 35) no Hoare annotation was computed. [2020-07-08 12:03:11,622 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 24 35) no Hoare annotation was computed. [2020-07-08 12:03:11,627 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:03:11,627 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: hanoiFINAL has no Hoare annotation [2020-07-08 12:03:11,628 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 12:03:11,629 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 12:03:11,630 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:03:11,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:03:11 BoogieIcfgContainer [2020-07-08 12:03:11,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:03:11,636 INFO L168 Benchmark]: Toolchain (without parser) took 67865.57 ms. Allocated memory was 143.7 MB in the beginning and 288.9 MB in the end (delta: 145.2 MB). Free memory was 102.1 MB in the beginning and 127.3 MB in the end (delta: -25.2 MB). Peak memory consumption was 120.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:03:11,637 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:03:11,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.19 ms. Allocated memory is still 143.7 MB. Free memory was 101.9 MB in the beginning and 91.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:03:11,638 INFO L168 Benchmark]: Boogie Preprocessor took 24.05 ms. Allocated memory is still 143.7 MB. Free memory was 91.9 MB in the beginning and 90.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:03:11,639 INFO L168 Benchmark]: RCFGBuilder took 433.12 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.6 MB in the beginning and 165.2 MB in the end (delta: -74.6 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:03:11,640 INFO L168 Benchmark]: TraceAbstraction took 67127.46 ms. Allocated memory was 201.3 MB in the beginning and 288.9 MB in the end (delta: 87.6 MB). Free memory was 165.2 MB in the beginning and 127.3 MB in the end (delta: 37.9 MB). Peak memory consumption was 125.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:03:11,643 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.54 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 264.19 ms. Allocated memory is still 143.7 MB. Free memory was 101.9 MB in the beginning and 91.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.05 ms. Allocated memory is still 143.7 MB. Free memory was 91.9 MB in the beginning and 90.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 433.12 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.6 MB in the beginning and 165.2 MB in the end (delta: -74.6 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67127.46 ms. Allocated memory was 201.3 MB in the beginning and 288.9 MB in the end (delta: 87.6 MB). Free memory was 165.2 MB in the beginning and 127.3 MB in the end (delta: 37.9 MB). Peak memory consumption was 125.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 67.0s, OverallIterations: 4, TraceHistogramMax: 5, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 68 SDtfs, 19 SDslu, 365 SDs, 0 SdLazy, 297 SolverSat, 7 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 35.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 11 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 38.1s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 18 QuantifiedInterpolants, 27252 SizeOfPredicates, 11 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 96/140 InterpolantCoveringCapability, 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...