/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 21:49:00,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 21:49:00,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 21:49:00,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 21:49:00,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 21:49:00,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 21:49:00,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 21:49:00,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 21:49:00,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 21:49:00,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 21:49:00,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 21:49:00,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 21:49:00,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 21:49:00,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 21:49:00,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 21:49:00,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 21:49:00,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 21:49:00,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 21:49:00,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 21:49:00,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 21:49:00,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 21:49:00,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 21:49:00,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 21:49:00,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 21:49:00,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 21:49:00,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 21:49:00,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 21:49:00,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 21:49:00,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 21:49:00,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 21:49:00,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 21:49:00,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 21:49:00,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 21:49:00,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 21:49:00,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 21:49:00,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 21:49:00,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 21:49:00,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 21:49:00,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 21:49:00,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 21:49:00,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 21:49:00,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 21:49:00,642 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 21:49:00,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 21:49:00,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 21:49:00,644 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 21:49:00,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 21:49:00,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 21:49:00,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 21:49:00,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 21:49:00,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 21:49:00,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 21:49:00,646 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 21:49:00,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 21:49:00,647 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 21:49:00,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 21:49:00,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 21:49:00,648 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 21:49:00,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 21:49:00,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 21:49:00,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 21:49:00,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 21:49:00,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 21:49:00,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 21:49:00,649 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 21:49:00,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 21:49:00,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 21:49:00,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 21:49:00,949 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 21:49:00,950 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 21:49:00,950 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-07-08 21:49:01,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e8e5e41/bdd9138200624bf6ad50235e288d4eeb/FLAGa920563e6 [2020-07-08 21:49:01,469 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 21:49:01,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-07-08 21:49:01,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e8e5e41/bdd9138200624bf6ad50235e288d4eeb/FLAGa920563e6 [2020-07-08 21:49:01,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e8e5e41/bdd9138200624bf6ad50235e288d4eeb [2020-07-08 21:49:01,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 21:49:01,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 21:49:01,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 21:49:01,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 21:49:01,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 21:49:01,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:49:01" (1/1) ... [2020-07-08 21:49:01,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f06912a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:01, skipping insertion in model container [2020-07-08 21:49:01,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:49:01" (1/1) ... [2020-07-08 21:49:01,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 21:49:01,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 21:49:02,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:49:02,070 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 21:49:02,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:49:02,105 INFO L208 MainTranslator]: Completed translation [2020-07-08 21:49:02,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02 WrapperNode [2020-07-08 21:49:02,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 21:49:02,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 21:49:02,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 21:49:02,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 21:49:02,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 21:49:02,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 21:49:02,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 21:49:02,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 21:49:02,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (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 21:49:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 21:49:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 21:49:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-08 21:49:02,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 21:49:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 21:49:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 21:49:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-08 21:49:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 21:49:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 21:49:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 21:49:02,622 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 21:49:02,623 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 21:49:02,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:49:02 BoogieIcfgContainer [2020-07-08 21:49:02,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 21:49:02,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 21:49:02,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 21:49:02,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 21:49:02,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 09:49:01" (1/3) ... [2020-07-08 21:49:02,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b89162a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:49:02, skipping insertion in model container [2020-07-08 21:49:02,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (2/3) ... [2020-07-08 21:49:02,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b89162a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:49:02, skipping insertion in model container [2020-07-08 21:49:02,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:49:02" (3/3) ... [2020-07-08 21:49:02,639 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-07-08 21:49:02,652 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 21:49:02,662 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 21:49:02,680 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 21:49:02,710 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 21:49:02,710 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 21:49:02,710 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 21:49:02,710 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 21:49:02,710 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 21:49:02,711 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 21:49:02,711 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 21:49:02,711 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 21:49:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-08 21:49:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 21:49:02,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:02,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:02,743 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-07-08 21:49:02,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:02,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [725321188] [2020-07-08 21:49:02,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:03,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-08 21:49:03,042 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-08 21:49:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:03,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} ~m := #in~m; {47#true} is VALID [2020-07-08 21:49:03,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} ~n := #in~n; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:03,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:03,127 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:03,128 INFO L280 TraceCheckUtils]: 4: Hoare triple {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:03,131 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {51#(<= 0 main_~n~0)} #67#return; {58#(<= 1 |main_#t~ret5|)} is VALID [2020-07-08 21:49:03,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-08 21:49:03,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-08 21:49:03,133 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-08 21:49:03,133 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret6 := main(); {47#true} is VALID [2020-07-08 21:49:03,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {47#true} is VALID [2020-07-08 21:49:03,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~m~0 := #t~nondet3; {47#true} is VALID [2020-07-08 21:49:03,135 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#true} havoc #t~nondet3; {47#true} is VALID [2020-07-08 21:49:03,135 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume !(~m~0 < 0 || ~m~0 > 3); {47#true} is VALID [2020-07-08 21:49:03,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {47#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {47#true} is VALID [2020-07-08 21:49:03,136 INFO L280 TraceCheckUtils]: 9: Hoare triple {47#true} ~n~0 := #t~nondet4; {47#true} is VALID [2020-07-08 21:49:03,137 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} havoc #t~nondet4; {47#true} is VALID [2020-07-08 21:49:03,139 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#true} assume !(~n~0 < 0 || ~n~0 > 23); {51#(<= 0 main_~n~0)} is VALID [2020-07-08 21:49:03,140 INFO L263 TraceCheckUtils]: 12: Hoare triple {51#(<= 0 main_~n~0)} call #t~ret5 := ackermann(~m~0, ~n~0); {47#true} is VALID [2020-07-08 21:49:03,140 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#true} ~m := #in~m; {47#true} is VALID [2020-07-08 21:49:03,142 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#true} ~n := #in~n; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:03,143 INFO L280 TraceCheckUtils]: 15: Hoare triple {60#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:03,144 INFO L280 TraceCheckUtils]: 16: Hoare triple {60#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:03,145 INFO L280 TraceCheckUtils]: 17: Hoare triple {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:03,148 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {51#(<= 0 main_~n~0)} #67#return; {58#(<= 1 |main_#t~ret5|)} is VALID [2020-07-08 21:49:03,149 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#(<= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {58#(<= 1 |main_#t~ret5|)} is VALID [2020-07-08 21:49:03,151 INFO L280 TraceCheckUtils]: 20: Hoare triple {58#(<= 1 |main_#t~ret5|)} ~result~0 := #t~ret5; {59#(<= 1 main_~result~0)} is VALID [2020-07-08 21:49:03,152 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#(<= 1 main_~result~0)} havoc #t~ret5; {59#(<= 1 main_~result~0)} is VALID [2020-07-08 21:49:03,154 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#(<= 1 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {48#false} is VALID [2020-07-08 21:49:03,154 INFO L280 TraceCheckUtils]: 23: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-08 21:49:03,158 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 21:49:03,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [725321188] [2020-07-08 21:49:03,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:03,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 21:49:03,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057977830] [2020-07-08 21:49:03,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 21:49:03,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:03,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 21:49:03,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:03,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 21:49:03,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:03,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 21:49:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:49:03,245 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2020-07-08 21:49:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:03,980 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-07-08 21:49:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 21:49:03,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 21:49:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2020-07-08 21:49:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2020-07-08 21:49:04,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2020-07-08 21:49:04,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:04,137 INFO L225 Difference]: With dead ends: 61 [2020-07-08 21:49:04,137 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 21:49:04,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-08 21:49:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 21:49:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-08 21:49:04,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:04,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2020-07-08 21:49:04,225 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-08 21:49:04,225 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-08 21:49:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:04,233 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-08 21:49:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-08 21:49:04,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:04,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:04,235 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-08 21:49:04,235 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-08 21:49:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:04,241 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-08 21:49:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-08 21:49:04,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:04,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:04,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:04,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-08 21:49:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-07-08 21:49:04,250 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2020-07-08 21:49:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:04,251 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-07-08 21:49:04,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 21:49:04,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2020-07-08 21:49:04,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-08 21:49:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 21:49:04,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:04,309 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:04,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 21:49:04,310 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-07-08 21:49:04,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:04,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1665472794] [2020-07-08 21:49:04,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:04,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} assume true; {350#true} is VALID [2020-07-08 21:49:04,382 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {350#true} {350#true} #57#return; {350#true} is VALID [2020-07-08 21:49:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:04,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-08 21:49:04,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#true} ~n := #in~n; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:04,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:04,492 INFO L280 TraceCheckUtils]: 3: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:04,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:04,494 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {350#true} #61#return; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:04,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-08 21:49:04,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#true} ~n := #in~n; {350#true} is VALID [2020-07-08 21:49:04,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {350#true} assume !(0 == ~m); {350#true} is VALID [2020-07-08 21:49:04,496 INFO L280 TraceCheckUtils]: 3: Hoare triple {350#true} assume 0 == ~n; {350#true} is VALID [2020-07-08 21:49:04,496 INFO L263 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret0 := ackermann(~m - 1, 1); {350#true} is VALID [2020-07-08 21:49:04,497 INFO L280 TraceCheckUtils]: 5: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-08 21:49:04,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {350#true} ~n := #in~n; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:04,498 INFO L280 TraceCheckUtils]: 7: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:04,499 INFO L280 TraceCheckUtils]: 8: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:04,500 INFO L280 TraceCheckUtils]: 9: Hoare triple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:04,501 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {350#true} #61#return; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:04,502 INFO L280 TraceCheckUtils]: 11: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:04,503 INFO L280 TraceCheckUtils]: 12: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:04,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {379#(<= 2 |ackermann_#res|)} havoc #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:04,504 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#(<= 2 |ackermann_#res|)} assume true; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:04,506 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {379#(<= 2 |ackermann_#res|)} {350#true} #67#return; {370#(<= 2 |main_#t~ret5|)} is VALID [2020-07-08 21:49:04,507 INFO L263 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {350#true} is VALID [2020-07-08 21:49:04,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2020-07-08 21:49:04,508 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #57#return; {350#true} is VALID [2020-07-08 21:49:04,508 INFO L263 TraceCheckUtils]: 3: Hoare triple {350#true} call #t~ret6 := main(); {350#true} is VALID [2020-07-08 21:49:04,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {350#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {350#true} is VALID [2020-07-08 21:49:04,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {350#true} ~m~0 := #t~nondet3; {350#true} is VALID [2020-07-08 21:49:04,509 INFO L280 TraceCheckUtils]: 6: Hoare triple {350#true} havoc #t~nondet3; {350#true} is VALID [2020-07-08 21:49:04,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {350#true} assume !(~m~0 < 0 || ~m~0 > 3); {350#true} is VALID [2020-07-08 21:49:04,510 INFO L280 TraceCheckUtils]: 8: Hoare triple {350#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {350#true} is VALID [2020-07-08 21:49:04,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {350#true} ~n~0 := #t~nondet4; {350#true} is VALID [2020-07-08 21:49:04,510 INFO L280 TraceCheckUtils]: 10: Hoare triple {350#true} havoc #t~nondet4; {350#true} is VALID [2020-07-08 21:49:04,510 INFO L280 TraceCheckUtils]: 11: Hoare triple {350#true} assume !(~n~0 < 0 || ~n~0 > 23); {350#true} is VALID [2020-07-08 21:49:04,511 INFO L263 TraceCheckUtils]: 12: Hoare triple {350#true} call #t~ret5 := ackermann(~m~0, ~n~0); {350#true} is VALID [2020-07-08 21:49:04,511 INFO L280 TraceCheckUtils]: 13: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-08 21:49:04,512 INFO L280 TraceCheckUtils]: 14: Hoare triple {350#true} ~n := #in~n; {350#true} is VALID [2020-07-08 21:49:04,512 INFO L280 TraceCheckUtils]: 15: Hoare triple {350#true} assume !(0 == ~m); {350#true} is VALID [2020-07-08 21:49:04,512 INFO L280 TraceCheckUtils]: 16: Hoare triple {350#true} assume 0 == ~n; {350#true} is VALID [2020-07-08 21:49:04,513 INFO L263 TraceCheckUtils]: 17: Hoare triple {350#true} call #t~ret0 := ackermann(~m - 1, 1); {350#true} is VALID [2020-07-08 21:49:04,513 INFO L280 TraceCheckUtils]: 18: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-08 21:49:04,514 INFO L280 TraceCheckUtils]: 19: Hoare triple {350#true} ~n := #in~n; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:04,515 INFO L280 TraceCheckUtils]: 20: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:04,516 INFO L280 TraceCheckUtils]: 21: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:04,517 INFO L280 TraceCheckUtils]: 22: Hoare triple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:04,518 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {350#true} #61#return; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:04,519 INFO L280 TraceCheckUtils]: 24: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:04,520 INFO L280 TraceCheckUtils]: 25: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:04,521 INFO L280 TraceCheckUtils]: 26: Hoare triple {379#(<= 2 |ackermann_#res|)} havoc #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:04,521 INFO L280 TraceCheckUtils]: 27: Hoare triple {379#(<= 2 |ackermann_#res|)} assume true; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:04,523 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {379#(<= 2 |ackermann_#res|)} {350#true} #67#return; {370#(<= 2 |main_#t~ret5|)} is VALID [2020-07-08 21:49:04,524 INFO L280 TraceCheckUtils]: 29: Hoare triple {370#(<= 2 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {370#(<= 2 |main_#t~ret5|)} is VALID [2020-07-08 21:49:04,525 INFO L280 TraceCheckUtils]: 30: Hoare triple {370#(<= 2 |main_#t~ret5|)} ~result~0 := #t~ret5; {371#(<= 2 main_~result~0)} is VALID [2020-07-08 21:49:04,526 INFO L280 TraceCheckUtils]: 31: Hoare triple {371#(<= 2 main_~result~0)} havoc #t~ret5; {371#(<= 2 main_~result~0)} is VALID [2020-07-08 21:49:04,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {371#(<= 2 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {351#false} is VALID [2020-07-08 21:49:04,527 INFO L280 TraceCheckUtils]: 33: Hoare triple {351#false} assume !false; {351#false} is VALID [2020-07-08 21:49:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 21:49:04,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1665472794] [2020-07-08 21:49:04,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:04,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 21:49:04,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972756822] [2020-07-08 21:49:04,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-08 21:49:04,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:04,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 21:49:04,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:04,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 21:49:04,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 21:49:04,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 21:49:04,583 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 8 states. [2020-07-08 21:49:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:05,281 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-08 21:49:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 21:49:05,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-08 21:49:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 21:49:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2020-07-08 21:49:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 21:49:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2020-07-08 21:49:05,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2020-07-08 21:49:05,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:05,383 INFO L225 Difference]: With dead ends: 50 [2020-07-08 21:49:05,383 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 21:49:05,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-08 21:49:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 21:49:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-08 21:49:05,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:05,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-08 21:49:05,444 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-08 21:49:05,444 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-08 21:49:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:05,449 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-08 21:49:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-08 21:49:05,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:05,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:05,451 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-08 21:49:05,451 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-08 21:49:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:05,455 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-08 21:49:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-08 21:49:05,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:05,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:05,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:05,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 21:49:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-07-08 21:49:05,461 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2020-07-08 21:49:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:05,461 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-07-08 21:49:05,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 21:49:05,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 48 transitions. [2020-07-08 21:49:05,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-07-08 21:49:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 21:49:05,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:05,530 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:05,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 21:49:05,531 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:05,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2094172607, now seen corresponding path program 1 times [2020-07-08 21:49:05,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:05,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1874985703] [2020-07-08 21:49:05,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-08 21:49:05,613 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {667#true} {667#true} #57#return; {667#true} is VALID [2020-07-08 21:49:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,674 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-08 21:49:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-08 21:49:05,686 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-08 21:49:05,687 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-08 21:49:05,687 INFO L280 TraceCheckUtils]: 3: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-08 21:49:05,687 INFO L280 TraceCheckUtils]: 4: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-08 21:49:05,688 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-08 21:49:05,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-08 21:49:05,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-08 21:49:05,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#true} assume !(0 == ~m); {696#(not (= ackermann_~m 0))} is VALID [2020-07-08 21:49:05,690 INFO L280 TraceCheckUtils]: 3: Hoare triple {696#(not (= ackermann_~m 0))} assume !(0 == ~n); {696#(not (= ackermann_~m 0))} is VALID [2020-07-08 21:49:05,690 INFO L263 TraceCheckUtils]: 4: Hoare triple {696#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {667#true} is VALID [2020-07-08 21:49:05,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,692 INFO L280 TraceCheckUtils]: 7: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,692 INFO L280 TraceCheckUtils]: 8: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,693 INFO L280 TraceCheckUtils]: 9: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,695 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-08 21:49:05,695 INFO L280 TraceCheckUtils]: 11: Hoare triple {668#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {668#false} is VALID [2020-07-08 21:49:05,695 INFO L263 TraceCheckUtils]: 12: Hoare triple {668#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {667#true} is VALID [2020-07-08 21:49:05,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-08 21:49:05,696 INFO L280 TraceCheckUtils]: 14: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-08 21:49:05,696 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-08 21:49:05,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-08 21:49:05,697 INFO L280 TraceCheckUtils]: 17: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-08 21:49:05,698 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-08 21:49:05,698 INFO L280 TraceCheckUtils]: 19: Hoare triple {668#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {668#false} is VALID [2020-07-08 21:49:05,698 INFO L280 TraceCheckUtils]: 20: Hoare triple {668#false} #res := #t~ret2; {668#false} is VALID [2020-07-08 21:49:05,699 INFO L280 TraceCheckUtils]: 21: Hoare triple {668#false} havoc #t~ret2; {668#false} is VALID [2020-07-08 21:49:05,699 INFO L280 TraceCheckUtils]: 22: Hoare triple {668#false} havoc #t~ret1; {668#false} is VALID [2020-07-08 21:49:05,699 INFO L280 TraceCheckUtils]: 23: Hoare triple {668#false} assume true; {668#false} is VALID [2020-07-08 21:49:05,700 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {668#false} {667#true} #67#return; {668#false} is VALID [2020-07-08 21:49:05,701 INFO L263 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2020-07-08 21:49:05,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-08 21:49:05,702 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {667#true} {667#true} #57#return; {667#true} is VALID [2020-07-08 21:49:05,703 INFO L263 TraceCheckUtils]: 3: Hoare triple {667#true} call #t~ret6 := main(); {667#true} is VALID [2020-07-08 21:49:05,703 INFO L280 TraceCheckUtils]: 4: Hoare triple {667#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {667#true} is VALID [2020-07-08 21:49:05,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {667#true} ~m~0 := #t~nondet3; {667#true} is VALID [2020-07-08 21:49:05,703 INFO L280 TraceCheckUtils]: 6: Hoare triple {667#true} havoc #t~nondet3; {667#true} is VALID [2020-07-08 21:49:05,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {667#true} assume !(~m~0 < 0 || ~m~0 > 3); {667#true} is VALID [2020-07-08 21:49:05,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {667#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {667#true} is VALID [2020-07-08 21:49:05,704 INFO L280 TraceCheckUtils]: 9: Hoare triple {667#true} ~n~0 := #t~nondet4; {667#true} is VALID [2020-07-08 21:49:05,705 INFO L280 TraceCheckUtils]: 10: Hoare triple {667#true} havoc #t~nondet4; {667#true} is VALID [2020-07-08 21:49:05,705 INFO L280 TraceCheckUtils]: 11: Hoare triple {667#true} assume !(~n~0 < 0 || ~n~0 > 23); {667#true} is VALID [2020-07-08 21:49:05,705 INFO L263 TraceCheckUtils]: 12: Hoare triple {667#true} call #t~ret5 := ackermann(~m~0, ~n~0); {667#true} is VALID [2020-07-08 21:49:05,706 INFO L280 TraceCheckUtils]: 13: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-08 21:49:05,706 INFO L280 TraceCheckUtils]: 14: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-08 21:49:05,707 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#true} assume !(0 == ~m); {696#(not (= ackermann_~m 0))} is VALID [2020-07-08 21:49:05,708 INFO L280 TraceCheckUtils]: 16: Hoare triple {696#(not (= ackermann_~m 0))} assume !(0 == ~n); {696#(not (= ackermann_~m 0))} is VALID [2020-07-08 21:49:05,708 INFO L263 TraceCheckUtils]: 17: Hoare triple {696#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {667#true} is VALID [2020-07-08 21:49:05,709 INFO L280 TraceCheckUtils]: 18: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,710 INFO L280 TraceCheckUtils]: 19: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,710 INFO L280 TraceCheckUtils]: 20: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,711 INFO L280 TraceCheckUtils]: 21: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,712 INFO L280 TraceCheckUtils]: 22: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:05,713 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-08 21:49:05,714 INFO L280 TraceCheckUtils]: 24: Hoare triple {668#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {668#false} is VALID [2020-07-08 21:49:05,714 INFO L263 TraceCheckUtils]: 25: Hoare triple {668#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {667#true} is VALID [2020-07-08 21:49:05,715 INFO L280 TraceCheckUtils]: 26: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-08 21:49:05,727 INFO L280 TraceCheckUtils]: 27: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-08 21:49:05,727 INFO L280 TraceCheckUtils]: 28: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-08 21:49:05,728 INFO L280 TraceCheckUtils]: 29: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-08 21:49:05,728 INFO L280 TraceCheckUtils]: 30: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-08 21:49:05,728 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-08 21:49:05,730 INFO L280 TraceCheckUtils]: 32: Hoare triple {668#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {668#false} is VALID [2020-07-08 21:49:05,731 INFO L280 TraceCheckUtils]: 33: Hoare triple {668#false} #res := #t~ret2; {668#false} is VALID [2020-07-08 21:49:05,731 INFO L280 TraceCheckUtils]: 34: Hoare triple {668#false} havoc #t~ret2; {668#false} is VALID [2020-07-08 21:49:05,731 INFO L280 TraceCheckUtils]: 35: Hoare triple {668#false} havoc #t~ret1; {668#false} is VALID [2020-07-08 21:49:05,731 INFO L280 TraceCheckUtils]: 36: Hoare triple {668#false} assume true; {668#false} is VALID [2020-07-08 21:49:05,732 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {668#false} {667#true} #67#return; {668#false} is VALID [2020-07-08 21:49:05,732 INFO L280 TraceCheckUtils]: 38: Hoare triple {668#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {668#false} is VALID [2020-07-08 21:49:05,732 INFO L280 TraceCheckUtils]: 39: Hoare triple {668#false} ~result~0 := #t~ret5; {668#false} is VALID [2020-07-08 21:49:05,732 INFO L280 TraceCheckUtils]: 40: Hoare triple {668#false} havoc #t~ret5; {668#false} is VALID [2020-07-08 21:49:05,733 INFO L280 TraceCheckUtils]: 41: Hoare triple {668#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {668#false} is VALID [2020-07-08 21:49:05,733 INFO L280 TraceCheckUtils]: 42: Hoare triple {668#false} assume !false; {668#false} is VALID [2020-07-08 21:49:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-08 21:49:05,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1874985703] [2020-07-08 21:49:05,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:05,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 21:49:05,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691449580] [2020-07-08 21:49:05,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-08 21:49:05,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:05,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 21:49:05,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:05,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 21:49:05,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:05,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 21:49:05,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:49:05,776 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2020-07-08 21:49:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:06,125 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2020-07-08 21:49:06,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 21:49:06,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-08 21:49:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 21:49:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-08 21:49:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 21:49:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-08 21:49:06,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2020-07-08 21:49:06,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:06,227 INFO L225 Difference]: With dead ends: 73 [2020-07-08 21:49:06,227 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 21:49:06,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:49:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 21:49:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-08 21:49:06,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:06,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-08 21:49:06,317 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-08 21:49:06,317 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-08 21:49:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:06,321 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-08 21:49:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-08 21:49:06,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:06,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:06,323 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-08 21:49:06,323 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-08 21:49:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:06,327 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-08 21:49:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-08 21:49:06,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:06,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:06,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:06,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 21:49:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-08 21:49:06,332 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 43 [2020-07-08 21:49:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:06,333 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-08 21:49:06,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 21:49:06,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2020-07-08 21:49:06,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-08 21:49:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-08 21:49:06,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:06,414 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:06,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 21:49:06,415 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-07-08 21:49:06,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:06,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013099316] [2020-07-08 21:49:06,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:06,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} assume true; {1040#true} is VALID [2020-07-08 21:49:06,501 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1040#true} {1040#true} #57#return; {1040#true} is VALID [2020-07-08 21:49:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:06,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:06,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:06,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:06,671 INFO L280 TraceCheckUtils]: 4: Hoare triple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:06,673 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1040#true} #61#return; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:06,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-08 21:49:06,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-08 21:49:06,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-08 21:49:06,674 INFO L263 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-08 21:49:06,675 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#true} ~n := #in~n; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:06,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:06,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:06,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:06,679 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1040#true} #61#return; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:06,679 INFO L280 TraceCheckUtils]: 11: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:06,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,685 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:06,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:06,726 INFO L280 TraceCheckUtils]: 2: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:06,727 INFO L280 TraceCheckUtils]: 3: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:06,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:06,729 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1097#(<= 2 |ackermann_#t~ret1|)} #65#return; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:06,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,730 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-08 21:49:06,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-08 21:49:06,730 INFO L280 TraceCheckUtils]: 3: Hoare triple {1040#true} assume !(0 == ~n); {1040#true} is VALID [2020-07-08 21:49:06,731 INFO L263 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret1 := ackermann(~m, ~n - 1); {1040#true} is VALID [2020-07-08 21:49:06,731 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,731 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-08 21:49:06,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-08 21:49:06,732 INFO L280 TraceCheckUtils]: 8: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-08 21:49:06,732 INFO L263 TraceCheckUtils]: 9: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-08 21:49:06,732 INFO L280 TraceCheckUtils]: 10: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#true} ~n := #in~n; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:06,733 INFO L280 TraceCheckUtils]: 12: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:06,734 INFO L280 TraceCheckUtils]: 13: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:06,735 INFO L280 TraceCheckUtils]: 14: Hoare triple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:06,736 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1040#true} #61#return; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:06,737 INFO L280 TraceCheckUtils]: 16: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:06,738 INFO L280 TraceCheckUtils]: 17: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,742 INFO L280 TraceCheckUtils]: 18: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,743 INFO L280 TraceCheckUtils]: 19: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,744 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:06,744 INFO L280 TraceCheckUtils]: 21: Hoare triple {1097#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:06,744 INFO L263 TraceCheckUtils]: 22: Hoare triple {1097#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1040#true} is VALID [2020-07-08 21:49:06,745 INFO L280 TraceCheckUtils]: 23: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,745 INFO L280 TraceCheckUtils]: 24: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:06,745 INFO L280 TraceCheckUtils]: 25: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:06,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:06,747 INFO L280 TraceCheckUtils]: 27: Hoare triple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:06,752 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1097#(<= 2 |ackermann_#t~ret1|)} #65#return; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:06,753 INFO L280 TraceCheckUtils]: 29: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:06,753 INFO L280 TraceCheckUtils]: 30: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,754 INFO L280 TraceCheckUtils]: 31: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,754 INFO L280 TraceCheckUtils]: 32: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret1; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,755 INFO L280 TraceCheckUtils]: 33: Hoare triple {1105#(<= 3 |ackermann_#res|)} assume true; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,756 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1105#(<= 3 |ackermann_#res|)} {1040#true} #67#return; {1079#(<= 3 |main_#t~ret5|)} is VALID [2020-07-08 21:49:06,758 INFO L263 TraceCheckUtils]: 0: Hoare triple {1040#true} call ULTIMATE.init(); {1040#true} is VALID [2020-07-08 21:49:06,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} assume true; {1040#true} is VALID [2020-07-08 21:49:06,759 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1040#true} {1040#true} #57#return; {1040#true} is VALID [2020-07-08 21:49:06,759 INFO L263 TraceCheckUtils]: 3: Hoare triple {1040#true} call #t~ret6 := main(); {1040#true} is VALID [2020-07-08 21:49:06,759 INFO L280 TraceCheckUtils]: 4: Hoare triple {1040#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1040#true} is VALID [2020-07-08 21:49:06,760 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m~0 := #t~nondet3; {1040#true} is VALID [2020-07-08 21:49:06,760 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#true} havoc #t~nondet3; {1040#true} is VALID [2020-07-08 21:49:06,760 INFO L280 TraceCheckUtils]: 7: Hoare triple {1040#true} assume !(~m~0 < 0 || ~m~0 > 3); {1040#true} is VALID [2020-07-08 21:49:06,760 INFO L280 TraceCheckUtils]: 8: Hoare triple {1040#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1040#true} is VALID [2020-07-08 21:49:06,761 INFO L280 TraceCheckUtils]: 9: Hoare triple {1040#true} ~n~0 := #t~nondet4; {1040#true} is VALID [2020-07-08 21:49:06,761 INFO L280 TraceCheckUtils]: 10: Hoare triple {1040#true} havoc #t~nondet4; {1040#true} is VALID [2020-07-08 21:49:06,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#true} assume !(~n~0 < 0 || ~n~0 > 23); {1040#true} is VALID [2020-07-08 21:49:06,761 INFO L263 TraceCheckUtils]: 12: Hoare triple {1040#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1040#true} is VALID [2020-07-08 21:49:06,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,762 INFO L280 TraceCheckUtils]: 14: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-08 21:49:06,762 INFO L280 TraceCheckUtils]: 15: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-08 21:49:06,762 INFO L280 TraceCheckUtils]: 16: Hoare triple {1040#true} assume !(0 == ~n); {1040#true} is VALID [2020-07-08 21:49:06,763 INFO L263 TraceCheckUtils]: 17: Hoare triple {1040#true} call #t~ret1 := ackermann(~m, ~n - 1); {1040#true} is VALID [2020-07-08 21:49:06,763 INFO L280 TraceCheckUtils]: 18: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,763 INFO L280 TraceCheckUtils]: 19: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-08 21:49:06,763 INFO L280 TraceCheckUtils]: 20: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-08 21:49:06,764 INFO L280 TraceCheckUtils]: 21: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-08 21:49:06,764 INFO L263 TraceCheckUtils]: 22: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-08 21:49:06,764 INFO L280 TraceCheckUtils]: 23: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,766 INFO L280 TraceCheckUtils]: 24: Hoare triple {1040#true} ~n := #in~n; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:06,770 INFO L280 TraceCheckUtils]: 25: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:06,772 INFO L280 TraceCheckUtils]: 26: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:06,772 INFO L280 TraceCheckUtils]: 27: Hoare triple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:06,774 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1040#true} #61#return; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:06,774 INFO L280 TraceCheckUtils]: 29: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:06,775 INFO L280 TraceCheckUtils]: 30: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,776 INFO L280 TraceCheckUtils]: 31: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,776 INFO L280 TraceCheckUtils]: 32: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,778 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:06,778 INFO L280 TraceCheckUtils]: 34: Hoare triple {1097#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:06,779 INFO L263 TraceCheckUtils]: 35: Hoare triple {1097#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1040#true} is VALID [2020-07-08 21:49:06,779 INFO L280 TraceCheckUtils]: 36: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-08 21:49:06,780 INFO L280 TraceCheckUtils]: 37: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:06,780 INFO L280 TraceCheckUtils]: 38: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:06,781 INFO L280 TraceCheckUtils]: 39: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:06,782 INFO L280 TraceCheckUtils]: 40: Hoare triple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:06,783 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1097#(<= 2 |ackermann_#t~ret1|)} #65#return; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:06,784 INFO L280 TraceCheckUtils]: 42: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:06,784 INFO L280 TraceCheckUtils]: 43: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,785 INFO L280 TraceCheckUtils]: 44: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,786 INFO L280 TraceCheckUtils]: 45: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret1; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,786 INFO L280 TraceCheckUtils]: 46: Hoare triple {1105#(<= 3 |ackermann_#res|)} assume true; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:06,787 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1105#(<= 3 |ackermann_#res|)} {1040#true} #67#return; {1079#(<= 3 |main_#t~ret5|)} is VALID [2020-07-08 21:49:06,788 INFO L280 TraceCheckUtils]: 48: Hoare triple {1079#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1079#(<= 3 |main_#t~ret5|)} is VALID [2020-07-08 21:49:06,789 INFO L280 TraceCheckUtils]: 49: Hoare triple {1079#(<= 3 |main_#t~ret5|)} ~result~0 := #t~ret5; {1080#(<= 3 main_~result~0)} is VALID [2020-07-08 21:49:06,789 INFO L280 TraceCheckUtils]: 50: Hoare triple {1080#(<= 3 main_~result~0)} havoc #t~ret5; {1080#(<= 3 main_~result~0)} is VALID [2020-07-08 21:49:06,790 INFO L280 TraceCheckUtils]: 51: Hoare triple {1080#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1041#false} is VALID [2020-07-08 21:49:06,791 INFO L280 TraceCheckUtils]: 52: Hoare triple {1041#false} assume !false; {1041#false} is VALID [2020-07-08 21:49:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-08 21:49:06,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013099316] [2020-07-08 21:49:06,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:06,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 21:49:06,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744045275] [2020-07-08 21:49:06,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-07-08 21:49:06,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:06,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 21:49:06,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:06,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 21:49:06,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:06,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 21:49:06,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-08 21:49:06,848 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 13 states. [2020-07-08 21:49:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:09,062 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2020-07-08 21:49:09,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-08 21:49:09,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-07-08 21:49:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 21:49:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 111 transitions. [2020-07-08 21:49:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 21:49:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 111 transitions. [2020-07-08 21:49:09,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 111 transitions. [2020-07-08 21:49:09,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:09,233 INFO L225 Difference]: With dead ends: 89 [2020-07-08 21:49:09,233 INFO L226 Difference]: Without dead ends: 83 [2020-07-08 21:49:09,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2020-07-08 21:49:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-08 21:49:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2020-07-08 21:49:09,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:09,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 57 states. [2020-07-08 21:49:09,391 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 57 states. [2020-07-08 21:49:09,391 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 57 states. [2020-07-08 21:49:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:09,399 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2020-07-08 21:49:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2020-07-08 21:49:09,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:09,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:09,401 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 83 states. [2020-07-08 21:49:09,401 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 83 states. [2020-07-08 21:49:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:09,408 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2020-07-08 21:49:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2020-07-08 21:49:09,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:09,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:09,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:09,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-08 21:49:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2020-07-08 21:49:09,415 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 53 [2020-07-08 21:49:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:09,416 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2020-07-08 21:49:09,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 21:49:09,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 74 transitions. [2020-07-08 21:49:09,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2020-07-08 21:49:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-08 21:49:09,551 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:09,551 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:09,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 21:49:09,552 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash 358541405, now seen corresponding path program 2 times [2020-07-08 21:49:09,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:09,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [835197757] [2020-07-08 21:49:09,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:09,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {1611#true} assume true; {1611#true} is VALID [2020-07-08 21:49:09,602 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1611#true} {1611#true} #57#return; {1611#true} is VALID [2020-07-08 21:49:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:09,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {1701#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,747 INFO L280 TraceCheckUtils]: 4: Hoare triple {1701#(= 0 |ackermann_#in~m|)} assume true; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,748 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1701#(= 0 |ackermann_#in~m|)} {1693#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,751 INFO L280 TraceCheckUtils]: 3: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,751 INFO L263 TraceCheckUtils]: 4: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1611#true} is VALID [2020-07-08 21:49:09,751 INFO L280 TraceCheckUtils]: 5: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {1701#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {1701#(= 0 |ackermann_#in~m|)} assume true; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,755 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1701#(= 0 |ackermann_#in~m|)} {1693#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {1700#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {1700#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {1700#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {1700#(<= |ackermann_#in~m| 1)} assume true; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,758 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1700#(<= |ackermann_#in~m| 1)} {1611#true} #63#return; {1676#(<= ackermann_~m 1)} is VALID [2020-07-08 21:49:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:09,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,796 INFO L280 TraceCheckUtils]: 3: Hoare triple {1701#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {1701#(= 0 |ackermann_#in~m|)} assume true; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,798 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1701#(= 0 |ackermann_#in~m|)} {1693#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,800 INFO L280 TraceCheckUtils]: 3: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,801 INFO L263 TraceCheckUtils]: 4: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1611#true} is VALID [2020-07-08 21:49:09,801 INFO L280 TraceCheckUtils]: 5: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,803 INFO L280 TraceCheckUtils]: 7: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,803 INFO L280 TraceCheckUtils]: 8: Hoare triple {1701#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,804 INFO L280 TraceCheckUtils]: 9: Hoare triple {1701#(= 0 |ackermann_#in~m|)} assume true; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,805 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1701#(= 0 |ackermann_#in~m|)} {1693#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,806 INFO L280 TraceCheckUtils]: 11: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,806 INFO L280 TraceCheckUtils]: 12: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,807 INFO L280 TraceCheckUtils]: 13: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,807 INFO L280 TraceCheckUtils]: 14: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} assume true; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,809 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1708#(<= 1 |ackermann_#in~m|)} {1676#(<= ackermann_~m 1)} #65#return; {1612#false} is VALID [2020-07-08 21:49:09,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {1611#true} ~m := #in~m; {1611#true} is VALID [2020-07-08 21:49:09,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {1611#true} ~n := #in~n; {1611#true} is VALID [2020-07-08 21:49:09,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {1611#true} assume !(0 == ~m); {1611#true} is VALID [2020-07-08 21:49:09,810 INFO L280 TraceCheckUtils]: 3: Hoare triple {1611#true} assume !(0 == ~n); {1611#true} is VALID [2020-07-08 21:49:09,810 INFO L263 TraceCheckUtils]: 4: Hoare triple {1611#true} call #t~ret1 := ackermann(~m, ~n - 1); {1611#true} is VALID [2020-07-08 21:49:09,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,813 INFO L263 TraceCheckUtils]: 9: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1611#true} is VALID [2020-07-08 21:49:09,814 INFO L280 TraceCheckUtils]: 10: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,815 INFO L280 TraceCheckUtils]: 12: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,815 INFO L280 TraceCheckUtils]: 13: Hoare triple {1701#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,816 INFO L280 TraceCheckUtils]: 14: Hoare triple {1701#(= 0 |ackermann_#in~m|)} assume true; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,817 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1701#(= 0 |ackermann_#in~m|)} {1693#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,818 INFO L280 TraceCheckUtils]: 16: Hoare triple {1700#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,818 INFO L280 TraceCheckUtils]: 17: Hoare triple {1700#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,819 INFO L280 TraceCheckUtils]: 18: Hoare triple {1700#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,820 INFO L280 TraceCheckUtils]: 19: Hoare triple {1700#(<= |ackermann_#in~m| 1)} assume true; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,821 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1700#(<= |ackermann_#in~m| 1)} {1611#true} #63#return; {1676#(<= ackermann_~m 1)} is VALID [2020-07-08 21:49:09,821 INFO L280 TraceCheckUtils]: 21: Hoare triple {1676#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1676#(<= ackermann_~m 1)} is VALID [2020-07-08 21:49:09,821 INFO L263 TraceCheckUtils]: 22: Hoare triple {1676#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1611#true} is VALID [2020-07-08 21:49:09,822 INFO L280 TraceCheckUtils]: 23: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,823 INFO L280 TraceCheckUtils]: 24: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,823 INFO L280 TraceCheckUtils]: 25: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,826 INFO L280 TraceCheckUtils]: 26: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,827 INFO L263 TraceCheckUtils]: 27: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1611#true} is VALID [2020-07-08 21:49:09,828 INFO L280 TraceCheckUtils]: 28: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,830 INFO L280 TraceCheckUtils]: 29: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,831 INFO L280 TraceCheckUtils]: 30: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,831 INFO L280 TraceCheckUtils]: 31: Hoare triple {1701#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,831 INFO L280 TraceCheckUtils]: 32: Hoare triple {1701#(= 0 |ackermann_#in~m|)} assume true; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,832 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1701#(= 0 |ackermann_#in~m|)} {1693#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,833 INFO L280 TraceCheckUtils]: 34: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,833 INFO L280 TraceCheckUtils]: 35: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,834 INFO L280 TraceCheckUtils]: 36: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,834 INFO L280 TraceCheckUtils]: 37: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} assume true; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,835 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1708#(<= 1 |ackermann_#in~m|)} {1676#(<= ackermann_~m 1)} #65#return; {1612#false} is VALID [2020-07-08 21:49:09,835 INFO L280 TraceCheckUtils]: 39: Hoare triple {1612#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1612#false} is VALID [2020-07-08 21:49:09,835 INFO L280 TraceCheckUtils]: 40: Hoare triple {1612#false} #res := #t~ret2; {1612#false} is VALID [2020-07-08 21:49:09,835 INFO L280 TraceCheckUtils]: 41: Hoare triple {1612#false} havoc #t~ret2; {1612#false} is VALID [2020-07-08 21:49:09,836 INFO L280 TraceCheckUtils]: 42: Hoare triple {1612#false} havoc #t~ret1; {1612#false} is VALID [2020-07-08 21:49:09,836 INFO L280 TraceCheckUtils]: 43: Hoare triple {1612#false} assume true; {1612#false} is VALID [2020-07-08 21:49:09,836 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1612#false} {1611#true} #67#return; {1612#false} is VALID [2020-07-08 21:49:09,838 INFO L263 TraceCheckUtils]: 0: Hoare triple {1611#true} call ULTIMATE.init(); {1611#true} is VALID [2020-07-08 21:49:09,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {1611#true} assume true; {1611#true} is VALID [2020-07-08 21:49:09,838 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1611#true} {1611#true} #57#return; {1611#true} is VALID [2020-07-08 21:49:09,838 INFO L263 TraceCheckUtils]: 3: Hoare triple {1611#true} call #t~ret6 := main(); {1611#true} is VALID [2020-07-08 21:49:09,839 INFO L280 TraceCheckUtils]: 4: Hoare triple {1611#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1611#true} is VALID [2020-07-08 21:49:09,839 INFO L280 TraceCheckUtils]: 5: Hoare triple {1611#true} ~m~0 := #t~nondet3; {1611#true} is VALID [2020-07-08 21:49:09,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {1611#true} havoc #t~nondet3; {1611#true} is VALID [2020-07-08 21:49:09,839 INFO L280 TraceCheckUtils]: 7: Hoare triple {1611#true} assume !(~m~0 < 0 || ~m~0 > 3); {1611#true} is VALID [2020-07-08 21:49:09,840 INFO L280 TraceCheckUtils]: 8: Hoare triple {1611#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1611#true} is VALID [2020-07-08 21:49:09,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {1611#true} ~n~0 := #t~nondet4; {1611#true} is VALID [2020-07-08 21:49:09,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {1611#true} havoc #t~nondet4; {1611#true} is VALID [2020-07-08 21:49:09,840 INFO L280 TraceCheckUtils]: 11: Hoare triple {1611#true} assume !(~n~0 < 0 || ~n~0 > 23); {1611#true} is VALID [2020-07-08 21:49:09,840 INFO L263 TraceCheckUtils]: 12: Hoare triple {1611#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1611#true} is VALID [2020-07-08 21:49:09,841 INFO L280 TraceCheckUtils]: 13: Hoare triple {1611#true} ~m := #in~m; {1611#true} is VALID [2020-07-08 21:49:09,841 INFO L280 TraceCheckUtils]: 14: Hoare triple {1611#true} ~n := #in~n; {1611#true} is VALID [2020-07-08 21:49:09,841 INFO L280 TraceCheckUtils]: 15: Hoare triple {1611#true} assume !(0 == ~m); {1611#true} is VALID [2020-07-08 21:49:09,841 INFO L280 TraceCheckUtils]: 16: Hoare triple {1611#true} assume !(0 == ~n); {1611#true} is VALID [2020-07-08 21:49:09,841 INFO L263 TraceCheckUtils]: 17: Hoare triple {1611#true} call #t~ret1 := ackermann(~m, ~n - 1); {1611#true} is VALID [2020-07-08 21:49:09,842 INFO L280 TraceCheckUtils]: 18: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,847 INFO L280 TraceCheckUtils]: 19: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,847 INFO L280 TraceCheckUtils]: 20: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,848 INFO L280 TraceCheckUtils]: 21: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,848 INFO L263 TraceCheckUtils]: 22: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1611#true} is VALID [2020-07-08 21:49:09,849 INFO L280 TraceCheckUtils]: 23: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,851 INFO L280 TraceCheckUtils]: 24: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,852 INFO L280 TraceCheckUtils]: 25: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,853 INFO L280 TraceCheckUtils]: 26: Hoare triple {1701#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,853 INFO L280 TraceCheckUtils]: 27: Hoare triple {1701#(= 0 |ackermann_#in~m|)} assume true; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,854 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1701#(= 0 |ackermann_#in~m|)} {1693#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,854 INFO L280 TraceCheckUtils]: 29: Hoare triple {1700#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,855 INFO L280 TraceCheckUtils]: 30: Hoare triple {1700#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,855 INFO L280 TraceCheckUtils]: 31: Hoare triple {1700#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,856 INFO L280 TraceCheckUtils]: 32: Hoare triple {1700#(<= |ackermann_#in~m| 1)} assume true; {1700#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:09,856 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1700#(<= |ackermann_#in~m| 1)} {1611#true} #63#return; {1676#(<= ackermann_~m 1)} is VALID [2020-07-08 21:49:09,857 INFO L280 TraceCheckUtils]: 34: Hoare triple {1676#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1676#(<= ackermann_~m 1)} is VALID [2020-07-08 21:49:09,857 INFO L263 TraceCheckUtils]: 35: Hoare triple {1676#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1611#true} is VALID [2020-07-08 21:49:09,857 INFO L280 TraceCheckUtils]: 36: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,858 INFO L280 TraceCheckUtils]: 37: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,858 INFO L280 TraceCheckUtils]: 38: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,859 INFO L280 TraceCheckUtils]: 39: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,859 INFO L263 TraceCheckUtils]: 40: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1611#true} is VALID [2020-07-08 21:49:09,859 INFO L280 TraceCheckUtils]: 41: Hoare triple {1611#true} ~m := #in~m; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,859 INFO L280 TraceCheckUtils]: 42: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1693#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,860 INFO L280 TraceCheckUtils]: 43: Hoare triple {1693#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,860 INFO L280 TraceCheckUtils]: 44: Hoare triple {1701#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,861 INFO L280 TraceCheckUtils]: 45: Hoare triple {1701#(= 0 |ackermann_#in~m|)} assume true; {1701#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,862 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1701#(= 0 |ackermann_#in~m|)} {1693#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,862 INFO L280 TraceCheckUtils]: 47: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,862 INFO L280 TraceCheckUtils]: 48: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,863 INFO L280 TraceCheckUtils]: 49: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,863 INFO L280 TraceCheckUtils]: 50: Hoare triple {1708#(<= 1 |ackermann_#in~m|)} assume true; {1708#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:09,864 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1708#(<= 1 |ackermann_#in~m|)} {1676#(<= ackermann_~m 1)} #65#return; {1612#false} is VALID [2020-07-08 21:49:09,864 INFO L280 TraceCheckUtils]: 52: Hoare triple {1612#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1612#false} is VALID [2020-07-08 21:49:09,864 INFO L280 TraceCheckUtils]: 53: Hoare triple {1612#false} #res := #t~ret2; {1612#false} is VALID [2020-07-08 21:49:09,865 INFO L280 TraceCheckUtils]: 54: Hoare triple {1612#false} havoc #t~ret2; {1612#false} is VALID [2020-07-08 21:49:09,865 INFO L280 TraceCheckUtils]: 55: Hoare triple {1612#false} havoc #t~ret1; {1612#false} is VALID [2020-07-08 21:49:09,865 INFO L280 TraceCheckUtils]: 56: Hoare triple {1612#false} assume true; {1612#false} is VALID [2020-07-08 21:49:09,865 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {1612#false} {1611#true} #67#return; {1612#false} is VALID [2020-07-08 21:49:09,865 INFO L280 TraceCheckUtils]: 58: Hoare triple {1612#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1612#false} is VALID [2020-07-08 21:49:09,865 INFO L280 TraceCheckUtils]: 59: Hoare triple {1612#false} ~result~0 := #t~ret5; {1612#false} is VALID [2020-07-08 21:49:09,866 INFO L280 TraceCheckUtils]: 60: Hoare triple {1612#false} havoc #t~ret5; {1612#false} is VALID [2020-07-08 21:49:09,866 INFO L280 TraceCheckUtils]: 61: Hoare triple {1612#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1612#false} is VALID [2020-07-08 21:49:09,866 INFO L280 TraceCheckUtils]: 62: Hoare triple {1612#false} assume !false; {1612#false} is VALID [2020-07-08 21:49:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-08 21:49:09,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [835197757] [2020-07-08 21:49:09,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:09,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 21:49:09,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137796160] [2020-07-08 21:49:09,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-07-08 21:49:09,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:09,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 21:49:09,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:09,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 21:49:09,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 21:49:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:49:09,936 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 7 states. [2020-07-08 21:49:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:10,603 INFO L93 Difference]: Finished difference Result 125 states and 192 transitions. [2020-07-08 21:49:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 21:49:10,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-07-08 21:49:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2020-07-08 21:49:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2020-07-08 21:49:10,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2020-07-08 21:49:10,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:10,726 INFO L225 Difference]: With dead ends: 125 [2020-07-08 21:49:10,726 INFO L226 Difference]: Without dead ends: 81 [2020-07-08 21:49:10,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-08 21:49:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-08 21:49:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-08 21:49:10,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:10,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-08 21:49:10,958 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-08 21:49:10,958 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-08 21:49:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:10,965 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2020-07-08 21:49:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-08 21:49:10,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:10,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:10,966 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-08 21:49:10,966 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-08 21:49:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:10,973 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2020-07-08 21:49:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-08 21:49:10,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:10,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:10,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:10,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-08 21:49:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2020-07-08 21:49:10,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 63 [2020-07-08 21:49:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:10,981 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2020-07-08 21:49:10,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 21:49:10,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 110 transitions. [2020-07-08 21:49:11,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-08 21:49:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-08 21:49:11,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:11,196 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:11,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 21:49:11,197 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:11,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:11,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1096450289, now seen corresponding path program 3 times [2020-07-08 21:49:11,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:11,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440007065] [2020-07-08 21:49:11,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:11,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {2292#true} assume true; {2292#true} is VALID [2020-07-08 21:49:11,261 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2292#true} {2292#true} #57#return; {2292#true} is VALID [2020-07-08 21:49:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:11,439 INFO L280 TraceCheckUtils]: 0: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {2292#true} ~n := #in~n; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,441 INFO L280 TraceCheckUtils]: 2: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,442 INFO L280 TraceCheckUtils]: 3: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,443 INFO L280 TraceCheckUtils]: 4: Hoare triple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,444 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2292#true} #61#return; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,445 INFO L280 TraceCheckUtils]: 2: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,445 INFO L280 TraceCheckUtils]: 3: Hoare triple {2292#true} assume 0 == ~n; {2292#true} is VALID [2020-07-08 21:49:11,445 INFO L263 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret0 := ackermann(~m - 1, 1); {2292#true} is VALID [2020-07-08 21:49:11,446 INFO L280 TraceCheckUtils]: 5: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {2292#true} ~n := #in~n; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,447 INFO L280 TraceCheckUtils]: 7: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,448 INFO L280 TraceCheckUtils]: 8: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,449 INFO L280 TraceCheckUtils]: 9: Hoare triple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,450 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2292#true} #61#return; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,451 INFO L280 TraceCheckUtils]: 11: Hoare triple {2410#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,452 INFO L280 TraceCheckUtils]: 12: Hoare triple {2410#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {2411#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,453 INFO L280 TraceCheckUtils]: 14: Hoare triple {2411#(<= 2 |ackermann_#res|)} assume true; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,455 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2411#(<= 2 |ackermann_#res|)} {2292#true} #63#return; {2396#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:11,502 INFO L280 TraceCheckUtils]: 0: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {2292#true} ~n := #in~n; {2414#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:11,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2414#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:11,504 INFO L280 TraceCheckUtils]: 3: Hoare triple {2414#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:11,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:11,506 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2396#(<= 2 |ackermann_#t~ret1|)} #65#return; {2403#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:11,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {2292#true} assume !(0 == ~n); {2292#true} is VALID [2020-07-08 21:49:11,507 INFO L263 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret1 := ackermann(~m, ~n - 1); {2292#true} is VALID [2020-07-08 21:49:11,508 INFO L280 TraceCheckUtils]: 5: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,508 INFO L280 TraceCheckUtils]: 7: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,508 INFO L280 TraceCheckUtils]: 8: Hoare triple {2292#true} assume 0 == ~n; {2292#true} is VALID [2020-07-08 21:49:11,509 INFO L263 TraceCheckUtils]: 9: Hoare triple {2292#true} call #t~ret0 := ackermann(~m - 1, 1); {2292#true} is VALID [2020-07-08 21:49:11,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,510 INFO L280 TraceCheckUtils]: 11: Hoare triple {2292#true} ~n := #in~n; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,511 INFO L280 TraceCheckUtils]: 13: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,512 INFO L280 TraceCheckUtils]: 14: Hoare triple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,513 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2292#true} #61#return; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,514 INFO L280 TraceCheckUtils]: 16: Hoare triple {2410#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,515 INFO L280 TraceCheckUtils]: 17: Hoare triple {2410#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,516 INFO L280 TraceCheckUtils]: 18: Hoare triple {2411#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,517 INFO L280 TraceCheckUtils]: 19: Hoare triple {2411#(<= 2 |ackermann_#res|)} assume true; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,518 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2411#(<= 2 |ackermann_#res|)} {2292#true} #63#return; {2396#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:11,519 INFO L280 TraceCheckUtils]: 21: Hoare triple {2396#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2396#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:11,519 INFO L263 TraceCheckUtils]: 22: Hoare triple {2396#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2292#true} is VALID [2020-07-08 21:49:11,519 INFO L280 TraceCheckUtils]: 23: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,520 INFO L280 TraceCheckUtils]: 24: Hoare triple {2292#true} ~n := #in~n; {2414#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:11,521 INFO L280 TraceCheckUtils]: 25: Hoare triple {2414#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2414#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:11,522 INFO L280 TraceCheckUtils]: 26: Hoare triple {2414#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:11,523 INFO L280 TraceCheckUtils]: 27: Hoare triple {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:11,524 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2396#(<= 2 |ackermann_#t~ret1|)} #65#return; {2403#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:11,525 INFO L280 TraceCheckUtils]: 29: Hoare triple {2403#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2403#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:11,525 INFO L280 TraceCheckUtils]: 30: Hoare triple {2403#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,526 INFO L280 TraceCheckUtils]: 31: Hoare triple {2379#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,526 INFO L280 TraceCheckUtils]: 32: Hoare triple {2379#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,527 INFO L280 TraceCheckUtils]: 33: Hoare triple {2379#(<= 3 |ackermann_#res|)} assume true; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,528 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2379#(<= 3 |ackermann_#res|)} {2292#true} #61#return; {2378#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,549 INFO L280 TraceCheckUtils]: 3: Hoare triple {2292#true} assume 0 == ~n; {2292#true} is VALID [2020-07-08 21:49:11,550 INFO L263 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret0 := ackermann(~m - 1, 1); {2292#true} is VALID [2020-07-08 21:49:11,550 INFO L280 TraceCheckUtils]: 5: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,550 INFO L280 TraceCheckUtils]: 6: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,550 INFO L280 TraceCheckUtils]: 7: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,550 INFO L280 TraceCheckUtils]: 8: Hoare triple {2292#true} assume !(0 == ~n); {2292#true} is VALID [2020-07-08 21:49:11,551 INFO L263 TraceCheckUtils]: 9: Hoare triple {2292#true} call #t~ret1 := ackermann(~m, ~n - 1); {2292#true} is VALID [2020-07-08 21:49:11,551 INFO L280 TraceCheckUtils]: 10: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,551 INFO L280 TraceCheckUtils]: 11: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,551 INFO L280 TraceCheckUtils]: 12: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,552 INFO L280 TraceCheckUtils]: 13: Hoare triple {2292#true} assume 0 == ~n; {2292#true} is VALID [2020-07-08 21:49:11,552 INFO L263 TraceCheckUtils]: 14: Hoare triple {2292#true} call #t~ret0 := ackermann(~m - 1, 1); {2292#true} is VALID [2020-07-08 21:49:11,552 INFO L280 TraceCheckUtils]: 15: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,556 INFO L280 TraceCheckUtils]: 16: Hoare triple {2292#true} ~n := #in~n; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,557 INFO L280 TraceCheckUtils]: 17: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,558 INFO L280 TraceCheckUtils]: 18: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,559 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2292#true} #61#return; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,560 INFO L280 TraceCheckUtils]: 21: Hoare triple {2410#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,561 INFO L280 TraceCheckUtils]: 22: Hoare triple {2410#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,561 INFO L280 TraceCheckUtils]: 23: Hoare triple {2411#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,562 INFO L280 TraceCheckUtils]: 24: Hoare triple {2411#(<= 2 |ackermann_#res|)} assume true; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,563 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2411#(<= 2 |ackermann_#res|)} {2292#true} #63#return; {2396#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:11,564 INFO L280 TraceCheckUtils]: 26: Hoare triple {2396#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2396#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:11,564 INFO L263 TraceCheckUtils]: 27: Hoare triple {2396#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2292#true} is VALID [2020-07-08 21:49:11,564 INFO L280 TraceCheckUtils]: 28: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,565 INFO L280 TraceCheckUtils]: 29: Hoare triple {2292#true} ~n := #in~n; {2414#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:11,566 INFO L280 TraceCheckUtils]: 30: Hoare triple {2414#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2414#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:11,567 INFO L280 TraceCheckUtils]: 31: Hoare triple {2414#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:11,567 INFO L280 TraceCheckUtils]: 32: Hoare triple {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:11,569 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2396#(<= 2 |ackermann_#t~ret1|)} #65#return; {2403#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:11,570 INFO L280 TraceCheckUtils]: 34: Hoare triple {2403#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2403#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:11,570 INFO L280 TraceCheckUtils]: 35: Hoare triple {2403#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,571 INFO L280 TraceCheckUtils]: 36: Hoare triple {2379#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,572 INFO L280 TraceCheckUtils]: 37: Hoare triple {2379#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,572 INFO L280 TraceCheckUtils]: 38: Hoare triple {2379#(<= 3 |ackermann_#res|)} assume true; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,573 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2379#(<= 3 |ackermann_#res|)} {2292#true} #61#return; {2378#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,574 INFO L280 TraceCheckUtils]: 40: Hoare triple {2378#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2378#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,575 INFO L280 TraceCheckUtils]: 41: Hoare triple {2378#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,575 INFO L280 TraceCheckUtils]: 42: Hoare triple {2379#(<= 3 |ackermann_#res|)} havoc #t~ret0; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,576 INFO L280 TraceCheckUtils]: 43: Hoare triple {2379#(<= 3 |ackermann_#res|)} assume true; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,576 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2379#(<= 3 |ackermann_#res|)} {2292#true} #67#return; {2341#(<= 3 |main_#t~ret5|)} is VALID [2020-07-08 21:49:11,579 INFO L263 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2292#true} is VALID [2020-07-08 21:49:11,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {2292#true} assume true; {2292#true} is VALID [2020-07-08 21:49:11,579 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2292#true} {2292#true} #57#return; {2292#true} is VALID [2020-07-08 21:49:11,579 INFO L263 TraceCheckUtils]: 3: Hoare triple {2292#true} call #t~ret6 := main(); {2292#true} is VALID [2020-07-08 21:49:11,579 INFO L280 TraceCheckUtils]: 4: Hoare triple {2292#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2292#true} is VALID [2020-07-08 21:49:11,579 INFO L280 TraceCheckUtils]: 5: Hoare triple {2292#true} ~m~0 := #t~nondet3; {2292#true} is VALID [2020-07-08 21:49:11,580 INFO L280 TraceCheckUtils]: 6: Hoare triple {2292#true} havoc #t~nondet3; {2292#true} is VALID [2020-07-08 21:49:11,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {2292#true} assume !(~m~0 < 0 || ~m~0 > 3); {2292#true} is VALID [2020-07-08 21:49:11,580 INFO L280 TraceCheckUtils]: 8: Hoare triple {2292#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2292#true} is VALID [2020-07-08 21:49:11,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {2292#true} ~n~0 := #t~nondet4; {2292#true} is VALID [2020-07-08 21:49:11,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {2292#true} havoc #t~nondet4; {2292#true} is VALID [2020-07-08 21:49:11,580 INFO L280 TraceCheckUtils]: 11: Hoare triple {2292#true} assume !(~n~0 < 0 || ~n~0 > 23); {2292#true} is VALID [2020-07-08 21:49:11,581 INFO L263 TraceCheckUtils]: 12: Hoare triple {2292#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2292#true} is VALID [2020-07-08 21:49:11,581 INFO L280 TraceCheckUtils]: 13: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,581 INFO L280 TraceCheckUtils]: 14: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,581 INFO L280 TraceCheckUtils]: 15: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,581 INFO L280 TraceCheckUtils]: 16: Hoare triple {2292#true} assume 0 == ~n; {2292#true} is VALID [2020-07-08 21:49:11,582 INFO L263 TraceCheckUtils]: 17: Hoare triple {2292#true} call #t~ret0 := ackermann(~m - 1, 1); {2292#true} is VALID [2020-07-08 21:49:11,582 INFO L280 TraceCheckUtils]: 18: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,582 INFO L280 TraceCheckUtils]: 19: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,582 INFO L280 TraceCheckUtils]: 20: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,582 INFO L280 TraceCheckUtils]: 21: Hoare triple {2292#true} assume !(0 == ~n); {2292#true} is VALID [2020-07-08 21:49:11,582 INFO L263 TraceCheckUtils]: 22: Hoare triple {2292#true} call #t~ret1 := ackermann(~m, ~n - 1); {2292#true} is VALID [2020-07-08 21:49:11,583 INFO L280 TraceCheckUtils]: 23: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,583 INFO L280 TraceCheckUtils]: 24: Hoare triple {2292#true} ~n := #in~n; {2292#true} is VALID [2020-07-08 21:49:11,583 INFO L280 TraceCheckUtils]: 25: Hoare triple {2292#true} assume !(0 == ~m); {2292#true} is VALID [2020-07-08 21:49:11,583 INFO L280 TraceCheckUtils]: 26: Hoare triple {2292#true} assume 0 == ~n; {2292#true} is VALID [2020-07-08 21:49:11,583 INFO L263 TraceCheckUtils]: 27: Hoare triple {2292#true} call #t~ret0 := ackermann(~m - 1, 1); {2292#true} is VALID [2020-07-08 21:49:11,584 INFO L280 TraceCheckUtils]: 28: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,584 INFO L280 TraceCheckUtils]: 29: Hoare triple {2292#true} ~n := #in~n; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,585 INFO L280 TraceCheckUtils]: 30: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:11,585 INFO L280 TraceCheckUtils]: 31: Hoare triple {2412#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,586 INFO L280 TraceCheckUtils]: 32: Hoare triple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:11,587 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2413#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2292#true} #61#return; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,587 INFO L280 TraceCheckUtils]: 34: Hoare triple {2410#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2410#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,588 INFO L280 TraceCheckUtils]: 35: Hoare triple {2410#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,588 INFO L280 TraceCheckUtils]: 36: Hoare triple {2411#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,589 INFO L280 TraceCheckUtils]: 37: Hoare triple {2411#(<= 2 |ackermann_#res|)} assume true; {2411#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,590 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2411#(<= 2 |ackermann_#res|)} {2292#true} #63#return; {2396#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:11,590 INFO L280 TraceCheckUtils]: 39: Hoare triple {2396#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2396#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:11,591 INFO L263 TraceCheckUtils]: 40: Hoare triple {2396#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2292#true} is VALID [2020-07-08 21:49:11,591 INFO L280 TraceCheckUtils]: 41: Hoare triple {2292#true} ~m := #in~m; {2292#true} is VALID [2020-07-08 21:49:11,591 INFO L280 TraceCheckUtils]: 42: Hoare triple {2292#true} ~n := #in~n; {2414#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:11,592 INFO L280 TraceCheckUtils]: 43: Hoare triple {2414#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2414#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:11,593 INFO L280 TraceCheckUtils]: 44: Hoare triple {2414#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:11,593 INFO L280 TraceCheckUtils]: 45: Hoare triple {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:11,595 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2415#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2396#(<= 2 |ackermann_#t~ret1|)} #65#return; {2403#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:11,595 INFO L280 TraceCheckUtils]: 47: Hoare triple {2403#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2403#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:11,596 INFO L280 TraceCheckUtils]: 48: Hoare triple {2403#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,597 INFO L280 TraceCheckUtils]: 49: Hoare triple {2379#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,597 INFO L280 TraceCheckUtils]: 50: Hoare triple {2379#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,598 INFO L280 TraceCheckUtils]: 51: Hoare triple {2379#(<= 3 |ackermann_#res|)} assume true; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,598 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2379#(<= 3 |ackermann_#res|)} {2292#true} #61#return; {2378#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,599 INFO L280 TraceCheckUtils]: 53: Hoare triple {2378#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2378#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:11,599 INFO L280 TraceCheckUtils]: 54: Hoare triple {2378#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,600 INFO L280 TraceCheckUtils]: 55: Hoare triple {2379#(<= 3 |ackermann_#res|)} havoc #t~ret0; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,600 INFO L280 TraceCheckUtils]: 56: Hoare triple {2379#(<= 3 |ackermann_#res|)} assume true; {2379#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:11,601 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2379#(<= 3 |ackermann_#res|)} {2292#true} #67#return; {2341#(<= 3 |main_#t~ret5|)} is VALID [2020-07-08 21:49:11,602 INFO L280 TraceCheckUtils]: 58: Hoare triple {2341#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2341#(<= 3 |main_#t~ret5|)} is VALID [2020-07-08 21:49:11,602 INFO L280 TraceCheckUtils]: 59: Hoare triple {2341#(<= 3 |main_#t~ret5|)} ~result~0 := #t~ret5; {2342#(<= 3 main_~result~0)} is VALID [2020-07-08 21:49:11,603 INFO L280 TraceCheckUtils]: 60: Hoare triple {2342#(<= 3 main_~result~0)} havoc #t~ret5; {2342#(<= 3 main_~result~0)} is VALID [2020-07-08 21:49:11,604 INFO L280 TraceCheckUtils]: 61: Hoare triple {2342#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2293#false} is VALID [2020-07-08 21:49:11,604 INFO L280 TraceCheckUtils]: 62: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2020-07-08 21:49:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-08 21:49:11,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [440007065] [2020-07-08 21:49:11,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:11,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-08 21:49:11,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952880410] [2020-07-08 21:49:11,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-07-08 21:49:11,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:11,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 21:49:11,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:11,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 21:49:11,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:11,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 21:49:11,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-08 21:49:11,658 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand 14 states. [2020-07-08 21:49:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:13,855 INFO L93 Difference]: Finished difference Result 157 states and 248 transitions. [2020-07-08 21:49:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-08 21:49:13,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-07-08 21:49:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 21:49:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2020-07-08 21:49:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 21:49:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2020-07-08 21:49:13,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 113 transitions. [2020-07-08 21:49:14,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:14,030 INFO L225 Difference]: With dead ends: 157 [2020-07-08 21:49:14,030 INFO L226 Difference]: Without dead ends: 151 [2020-07-08 21:49:14,032 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2020-07-08 21:49:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-07-08 21:49:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 79. [2020-07-08 21:49:14,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:14,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 79 states. [2020-07-08 21:49:14,270 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 79 states. [2020-07-08 21:49:14,270 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 79 states. [2020-07-08 21:49:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:14,284 INFO L93 Difference]: Finished difference Result 151 states and 240 transitions. [2020-07-08 21:49:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 240 transitions. [2020-07-08 21:49:14,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:14,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:14,287 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 151 states. [2020-07-08 21:49:14,287 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 151 states. [2020-07-08 21:49:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:14,301 INFO L93 Difference]: Finished difference Result 151 states and 240 transitions. [2020-07-08 21:49:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 240 transitions. [2020-07-08 21:49:14,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:14,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:14,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:14,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-08 21:49:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2020-07-08 21:49:14,310 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 63 [2020-07-08 21:49:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:14,310 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2020-07-08 21:49:14,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 21:49:14,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 104 transitions. [2020-07-08 21:49:14,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2020-07-08 21:49:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-08 21:49:14,554 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:14,554 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:14,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 21:49:14,555 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash 449882030, now seen corresponding path program 4 times [2020-07-08 21:49:14,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:14,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624808724] [2020-07-08 21:49:14,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:14,606 INFO L280 TraceCheckUtils]: 0: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,607 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3229#true} {3229#true} #57#return; {3229#true} is VALID [2020-07-08 21:49:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:14,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,675 INFO L280 TraceCheckUtils]: 4: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,676 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3229#true} {3347#(= 0 |ackermann_#in~n|)} #61#return; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {3229#true} ~n := #in~n; {3346#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {3346#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3346#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {3346#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,678 INFO L263 TraceCheckUtils]: 4: Hoare triple {3347#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,678 INFO L280 TraceCheckUtils]: 6: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,679 INFO L280 TraceCheckUtils]: 7: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,679 INFO L280 TraceCheckUtils]: 9: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,680 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3229#true} {3347#(= 0 |ackermann_#in~n|)} #61#return; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,681 INFO L280 TraceCheckUtils]: 11: Hoare triple {3347#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {3347#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,682 INFO L280 TraceCheckUtils]: 13: Hoare triple {3347#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,682 INFO L280 TraceCheckUtils]: 14: Hoare triple {3347#(= 0 |ackermann_#in~n|)} assume true; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,684 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3347#(= 0 |ackermann_#in~n|)} {3229#true} #61#return; {3230#false} is VALID [2020-07-08 21:49:14,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {3229#true} assume !(0 == ~m); {3229#true} is VALID [2020-07-08 21:49:14,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {3229#true} assume 0 == ~n; {3229#true} is VALID [2020-07-08 21:49:14,685 INFO L263 TraceCheckUtils]: 4: Hoare triple {3229#true} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,685 INFO L280 TraceCheckUtils]: 5: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {3229#true} ~n := #in~n; {3346#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,686 INFO L280 TraceCheckUtils]: 7: Hoare triple {3346#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3346#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,687 INFO L280 TraceCheckUtils]: 8: Hoare triple {3346#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,687 INFO L263 TraceCheckUtils]: 9: Hoare triple {3347#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,688 INFO L280 TraceCheckUtils]: 11: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,688 INFO L280 TraceCheckUtils]: 12: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,688 INFO L280 TraceCheckUtils]: 13: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,688 INFO L280 TraceCheckUtils]: 14: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,689 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3229#true} {3347#(= 0 |ackermann_#in~n|)} #61#return; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,690 INFO L280 TraceCheckUtils]: 16: Hoare triple {3347#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,691 INFO L280 TraceCheckUtils]: 17: Hoare triple {3347#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,691 INFO L280 TraceCheckUtils]: 18: Hoare triple {3347#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,692 INFO L280 TraceCheckUtils]: 19: Hoare triple {3347#(= 0 |ackermann_#in~n|)} assume true; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,693 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3347#(= 0 |ackermann_#in~n|)} {3229#true} #61#return; {3230#false} is VALID [2020-07-08 21:49:14,693 INFO L280 TraceCheckUtils]: 21: Hoare triple {3230#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3230#false} is VALID [2020-07-08 21:49:14,693 INFO L280 TraceCheckUtils]: 22: Hoare triple {3230#false} #res := #t~ret0; {3230#false} is VALID [2020-07-08 21:49:14,693 INFO L280 TraceCheckUtils]: 23: Hoare triple {3230#false} havoc #t~ret0; {3230#false} is VALID [2020-07-08 21:49:14,694 INFO L280 TraceCheckUtils]: 24: Hoare triple {3230#false} assume true; {3230#false} is VALID [2020-07-08 21:49:14,694 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3230#false} {3229#true} #63#return; {3230#false} is VALID [2020-07-08 21:49:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:14,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,704 INFO L280 TraceCheckUtils]: 3: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,705 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3229#true} {3229#true} #61#return; {3229#true} is VALID [2020-07-08 21:49:14,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {3229#true} assume !(0 == ~m); {3229#true} is VALID [2020-07-08 21:49:14,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {3229#true} assume 0 == ~n; {3229#true} is VALID [2020-07-08 21:49:14,706 INFO L263 TraceCheckUtils]: 4: Hoare triple {3229#true} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,706 INFO L280 TraceCheckUtils]: 5: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,706 INFO L280 TraceCheckUtils]: 6: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,707 INFO L280 TraceCheckUtils]: 7: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,707 INFO L280 TraceCheckUtils]: 8: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,707 INFO L280 TraceCheckUtils]: 9: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,707 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3229#true} {3229#true} #61#return; {3229#true} is VALID [2020-07-08 21:49:14,707 INFO L280 TraceCheckUtils]: 11: Hoare triple {3229#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3229#true} is VALID [2020-07-08 21:49:14,708 INFO L280 TraceCheckUtils]: 12: Hoare triple {3229#true} #res := #t~ret0; {3229#true} is VALID [2020-07-08 21:49:14,708 INFO L280 TraceCheckUtils]: 13: Hoare triple {3229#true} havoc #t~ret0; {3229#true} is VALID [2020-07-08 21:49:14,708 INFO L280 TraceCheckUtils]: 14: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,708 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3229#true} {3230#false} #65#return; {3230#false} is VALID [2020-07-08 21:49:14,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {3229#true} assume !(0 == ~m); {3229#true} is VALID [2020-07-08 21:49:14,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {3229#true} assume !(0 == ~n); {3229#true} is VALID [2020-07-08 21:49:14,709 INFO L263 TraceCheckUtils]: 4: Hoare triple {3229#true} call #t~ret1 := ackermann(~m, ~n - 1); {3229#true} is VALID [2020-07-08 21:49:14,710 INFO L280 TraceCheckUtils]: 5: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,710 INFO L280 TraceCheckUtils]: 7: Hoare triple {3229#true} assume !(0 == ~m); {3229#true} is VALID [2020-07-08 21:49:14,710 INFO L280 TraceCheckUtils]: 8: Hoare triple {3229#true} assume 0 == ~n; {3229#true} is VALID [2020-07-08 21:49:14,710 INFO L263 TraceCheckUtils]: 9: Hoare triple {3229#true} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,711 INFO L280 TraceCheckUtils]: 10: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {3229#true} ~n := #in~n; {3346#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,712 INFO L280 TraceCheckUtils]: 12: Hoare triple {3346#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3346#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,712 INFO L280 TraceCheckUtils]: 13: Hoare triple {3346#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,713 INFO L263 TraceCheckUtils]: 14: Hoare triple {3347#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,713 INFO L280 TraceCheckUtils]: 16: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,713 INFO L280 TraceCheckUtils]: 17: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,713 INFO L280 TraceCheckUtils]: 18: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,714 INFO L280 TraceCheckUtils]: 19: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,715 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3229#true} {3347#(= 0 |ackermann_#in~n|)} #61#return; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,715 INFO L280 TraceCheckUtils]: 21: Hoare triple {3347#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,716 INFO L280 TraceCheckUtils]: 22: Hoare triple {3347#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,716 INFO L280 TraceCheckUtils]: 23: Hoare triple {3347#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {3347#(= 0 |ackermann_#in~n|)} assume true; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,718 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3347#(= 0 |ackermann_#in~n|)} {3229#true} #61#return; {3230#false} is VALID [2020-07-08 21:49:14,718 INFO L280 TraceCheckUtils]: 26: Hoare triple {3230#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3230#false} is VALID [2020-07-08 21:49:14,718 INFO L280 TraceCheckUtils]: 27: Hoare triple {3230#false} #res := #t~ret0; {3230#false} is VALID [2020-07-08 21:49:14,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {3230#false} havoc #t~ret0; {3230#false} is VALID [2020-07-08 21:49:14,718 INFO L280 TraceCheckUtils]: 29: Hoare triple {3230#false} assume true; {3230#false} is VALID [2020-07-08 21:49:14,718 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3230#false} {3229#true} #63#return; {3230#false} is VALID [2020-07-08 21:49:14,719 INFO L280 TraceCheckUtils]: 31: Hoare triple {3230#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3230#false} is VALID [2020-07-08 21:49:14,719 INFO L263 TraceCheckUtils]: 32: Hoare triple {3230#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3229#true} is VALID [2020-07-08 21:49:14,719 INFO L280 TraceCheckUtils]: 33: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,719 INFO L280 TraceCheckUtils]: 34: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,719 INFO L280 TraceCheckUtils]: 35: Hoare triple {3229#true} assume !(0 == ~m); {3229#true} is VALID [2020-07-08 21:49:14,719 INFO L280 TraceCheckUtils]: 36: Hoare triple {3229#true} assume 0 == ~n; {3229#true} is VALID [2020-07-08 21:49:14,719 INFO L263 TraceCheckUtils]: 37: Hoare triple {3229#true} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,720 INFO L280 TraceCheckUtils]: 38: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,720 INFO L280 TraceCheckUtils]: 39: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,720 INFO L280 TraceCheckUtils]: 40: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,720 INFO L280 TraceCheckUtils]: 41: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,720 INFO L280 TraceCheckUtils]: 42: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,720 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3229#true} {3229#true} #61#return; {3229#true} is VALID [2020-07-08 21:49:14,720 INFO L280 TraceCheckUtils]: 44: Hoare triple {3229#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3229#true} is VALID [2020-07-08 21:49:14,720 INFO L280 TraceCheckUtils]: 45: Hoare triple {3229#true} #res := #t~ret0; {3229#true} is VALID [2020-07-08 21:49:14,721 INFO L280 TraceCheckUtils]: 46: Hoare triple {3229#true} havoc #t~ret0; {3229#true} is VALID [2020-07-08 21:49:14,721 INFO L280 TraceCheckUtils]: 47: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,721 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3229#true} {3230#false} #65#return; {3230#false} is VALID [2020-07-08 21:49:14,721 INFO L280 TraceCheckUtils]: 49: Hoare triple {3230#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3230#false} is VALID [2020-07-08 21:49:14,721 INFO L280 TraceCheckUtils]: 50: Hoare triple {3230#false} #res := #t~ret2; {3230#false} is VALID [2020-07-08 21:49:14,721 INFO L280 TraceCheckUtils]: 51: Hoare triple {3230#false} havoc #t~ret2; {3230#false} is VALID [2020-07-08 21:49:14,721 INFO L280 TraceCheckUtils]: 52: Hoare triple {3230#false} havoc #t~ret1; {3230#false} is VALID [2020-07-08 21:49:14,722 INFO L280 TraceCheckUtils]: 53: Hoare triple {3230#false} assume true; {3230#false} is VALID [2020-07-08 21:49:14,722 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {3230#false} {3229#true} #67#return; {3230#false} is VALID [2020-07-08 21:49:14,723 INFO L263 TraceCheckUtils]: 0: Hoare triple {3229#true} call ULTIMATE.init(); {3229#true} is VALID [2020-07-08 21:49:14,723 INFO L280 TraceCheckUtils]: 1: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,723 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3229#true} {3229#true} #57#return; {3229#true} is VALID [2020-07-08 21:49:14,723 INFO L263 TraceCheckUtils]: 3: Hoare triple {3229#true} call #t~ret6 := main(); {3229#true} is VALID [2020-07-08 21:49:14,724 INFO L280 TraceCheckUtils]: 4: Hoare triple {3229#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3229#true} is VALID [2020-07-08 21:49:14,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {3229#true} ~m~0 := #t~nondet3; {3229#true} is VALID [2020-07-08 21:49:14,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {3229#true} havoc #t~nondet3; {3229#true} is VALID [2020-07-08 21:49:14,724 INFO L280 TraceCheckUtils]: 7: Hoare triple {3229#true} assume !(~m~0 < 0 || ~m~0 > 3); {3229#true} is VALID [2020-07-08 21:49:14,724 INFO L280 TraceCheckUtils]: 8: Hoare triple {3229#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3229#true} is VALID [2020-07-08 21:49:14,724 INFO L280 TraceCheckUtils]: 9: Hoare triple {3229#true} ~n~0 := #t~nondet4; {3229#true} is VALID [2020-07-08 21:49:14,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {3229#true} havoc #t~nondet4; {3229#true} is VALID [2020-07-08 21:49:14,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {3229#true} assume !(~n~0 < 0 || ~n~0 > 23); {3229#true} is VALID [2020-07-08 21:49:14,725 INFO L263 TraceCheckUtils]: 12: Hoare triple {3229#true} call #t~ret5 := ackermann(~m~0, ~n~0); {3229#true} is VALID [2020-07-08 21:49:14,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,725 INFO L280 TraceCheckUtils]: 14: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,725 INFO L280 TraceCheckUtils]: 15: Hoare triple {3229#true} assume !(0 == ~m); {3229#true} is VALID [2020-07-08 21:49:14,725 INFO L280 TraceCheckUtils]: 16: Hoare triple {3229#true} assume !(0 == ~n); {3229#true} is VALID [2020-07-08 21:49:14,725 INFO L263 TraceCheckUtils]: 17: Hoare triple {3229#true} call #t~ret1 := ackermann(~m, ~n - 1); {3229#true} is VALID [2020-07-08 21:49:14,725 INFO L280 TraceCheckUtils]: 18: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,725 INFO L280 TraceCheckUtils]: 19: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,726 INFO L280 TraceCheckUtils]: 20: Hoare triple {3229#true} assume !(0 == ~m); {3229#true} is VALID [2020-07-08 21:49:14,726 INFO L280 TraceCheckUtils]: 21: Hoare triple {3229#true} assume 0 == ~n; {3229#true} is VALID [2020-07-08 21:49:14,726 INFO L263 TraceCheckUtils]: 22: Hoare triple {3229#true} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,726 INFO L280 TraceCheckUtils]: 23: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,726 INFO L280 TraceCheckUtils]: 24: Hoare triple {3229#true} ~n := #in~n; {3346#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,728 INFO L280 TraceCheckUtils]: 25: Hoare triple {3346#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3346#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,730 INFO L280 TraceCheckUtils]: 26: Hoare triple {3346#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,730 INFO L263 TraceCheckUtils]: 27: Hoare triple {3347#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,730 INFO L280 TraceCheckUtils]: 28: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,730 INFO L280 TraceCheckUtils]: 29: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,731 INFO L280 TraceCheckUtils]: 30: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,731 INFO L280 TraceCheckUtils]: 31: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,731 INFO L280 TraceCheckUtils]: 32: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,733 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3229#true} {3347#(= 0 |ackermann_#in~n|)} #61#return; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,734 INFO L280 TraceCheckUtils]: 34: Hoare triple {3347#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,738 INFO L280 TraceCheckUtils]: 35: Hoare triple {3347#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,738 INFO L280 TraceCheckUtils]: 36: Hoare triple {3347#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,739 INFO L280 TraceCheckUtils]: 37: Hoare triple {3347#(= 0 |ackermann_#in~n|)} assume true; {3347#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:14,740 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3347#(= 0 |ackermann_#in~n|)} {3229#true} #61#return; {3230#false} is VALID [2020-07-08 21:49:14,740 INFO L280 TraceCheckUtils]: 39: Hoare triple {3230#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3230#false} is VALID [2020-07-08 21:49:14,740 INFO L280 TraceCheckUtils]: 40: Hoare triple {3230#false} #res := #t~ret0; {3230#false} is VALID [2020-07-08 21:49:14,740 INFO L280 TraceCheckUtils]: 41: Hoare triple {3230#false} havoc #t~ret0; {3230#false} is VALID [2020-07-08 21:49:14,741 INFO L280 TraceCheckUtils]: 42: Hoare triple {3230#false} assume true; {3230#false} is VALID [2020-07-08 21:49:14,741 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3230#false} {3229#true} #63#return; {3230#false} is VALID [2020-07-08 21:49:14,741 INFO L280 TraceCheckUtils]: 44: Hoare triple {3230#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3230#false} is VALID [2020-07-08 21:49:14,741 INFO L263 TraceCheckUtils]: 45: Hoare triple {3230#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3229#true} is VALID [2020-07-08 21:49:14,741 INFO L280 TraceCheckUtils]: 46: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,742 INFO L280 TraceCheckUtils]: 47: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,742 INFO L280 TraceCheckUtils]: 48: Hoare triple {3229#true} assume !(0 == ~m); {3229#true} is VALID [2020-07-08 21:49:14,742 INFO L280 TraceCheckUtils]: 49: Hoare triple {3229#true} assume 0 == ~n; {3229#true} is VALID [2020-07-08 21:49:14,742 INFO L263 TraceCheckUtils]: 50: Hoare triple {3229#true} call #t~ret0 := ackermann(~m - 1, 1); {3229#true} is VALID [2020-07-08 21:49:14,742 INFO L280 TraceCheckUtils]: 51: Hoare triple {3229#true} ~m := #in~m; {3229#true} is VALID [2020-07-08 21:49:14,742 INFO L280 TraceCheckUtils]: 52: Hoare triple {3229#true} ~n := #in~n; {3229#true} is VALID [2020-07-08 21:49:14,743 INFO L280 TraceCheckUtils]: 53: Hoare triple {3229#true} assume 0 == ~m; {3229#true} is VALID [2020-07-08 21:49:14,743 INFO L280 TraceCheckUtils]: 54: Hoare triple {3229#true} #res := 1 + ~n; {3229#true} is VALID [2020-07-08 21:49:14,743 INFO L280 TraceCheckUtils]: 55: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,743 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3229#true} {3229#true} #61#return; {3229#true} is VALID [2020-07-08 21:49:14,743 INFO L280 TraceCheckUtils]: 57: Hoare triple {3229#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3229#true} is VALID [2020-07-08 21:49:14,744 INFO L280 TraceCheckUtils]: 58: Hoare triple {3229#true} #res := #t~ret0; {3229#true} is VALID [2020-07-08 21:49:14,744 INFO L280 TraceCheckUtils]: 59: Hoare triple {3229#true} havoc #t~ret0; {3229#true} is VALID [2020-07-08 21:49:14,744 INFO L280 TraceCheckUtils]: 60: Hoare triple {3229#true} assume true; {3229#true} is VALID [2020-07-08 21:49:14,744 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {3229#true} {3230#false} #65#return; {3230#false} is VALID [2020-07-08 21:49:14,744 INFO L280 TraceCheckUtils]: 62: Hoare triple {3230#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3230#false} is VALID [2020-07-08 21:49:14,744 INFO L280 TraceCheckUtils]: 63: Hoare triple {3230#false} #res := #t~ret2; {3230#false} is VALID [2020-07-08 21:49:14,745 INFO L280 TraceCheckUtils]: 64: Hoare triple {3230#false} havoc #t~ret2; {3230#false} is VALID [2020-07-08 21:49:14,745 INFO L280 TraceCheckUtils]: 65: Hoare triple {3230#false} havoc #t~ret1; {3230#false} is VALID [2020-07-08 21:49:14,745 INFO L280 TraceCheckUtils]: 66: Hoare triple {3230#false} assume true; {3230#false} is VALID [2020-07-08 21:49:14,745 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3230#false} {3229#true} #67#return; {3230#false} is VALID [2020-07-08 21:49:14,745 INFO L280 TraceCheckUtils]: 68: Hoare triple {3230#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3230#false} is VALID [2020-07-08 21:49:14,745 INFO L280 TraceCheckUtils]: 69: Hoare triple {3230#false} ~result~0 := #t~ret5; {3230#false} is VALID [2020-07-08 21:49:14,746 INFO L280 TraceCheckUtils]: 70: Hoare triple {3230#false} havoc #t~ret5; {3230#false} is VALID [2020-07-08 21:49:14,746 INFO L280 TraceCheckUtils]: 71: Hoare triple {3230#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {3230#false} is VALID [2020-07-08 21:49:14,746 INFO L280 TraceCheckUtils]: 72: Hoare triple {3230#false} assume !false; {3230#false} is VALID [2020-07-08 21:49:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-07-08 21:49:14,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [624808724] [2020-07-08 21:49:14,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:14,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-08 21:49:14,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437226456] [2020-07-08 21:49:14,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-07-08 21:49:14,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:14,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 21:49:14,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:14,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 21:49:14,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:14,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 21:49:14,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 21:49:14,804 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand 4 states. [2020-07-08 21:49:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:15,194 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2020-07-08 21:49:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 21:49:15,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-07-08 21:49:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:49:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-08 21:49:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:49:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-08 21:49:15,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2020-07-08 21:49:15,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:15,281 INFO L225 Difference]: With dead ends: 144 [2020-07-08 21:49:15,282 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 21:49:15,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:49:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 21:49:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-08 21:49:15,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:15,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-08 21:49:15,511 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-08 21:49:15,512 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-08 21:49:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:15,516 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-07-08 21:49:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-08 21:49:15,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:15,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:15,518 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-08 21:49:15,518 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-08 21:49:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:15,524 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-07-08 21:49:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-08 21:49:15,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:15,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:15,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:15,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-08 21:49:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2020-07-08 21:49:15,530 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 73 [2020-07-08 21:49:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:15,531 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2020-07-08 21:49:15,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 21:49:15,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 104 transitions. [2020-07-08 21:49:15,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-08 21:49:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-08 21:49:15,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:15,776 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:15,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 21:49:15,776 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:15,777 INFO L82 PathProgramCache]: Analyzing trace with hash 990403329, now seen corresponding path program 5 times [2020-07-08 21:49:15,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:15,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1944008851] [2020-07-08 21:49:15,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:15,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} assume true; {3964#true} is VALID [2020-07-08 21:49:15,858 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3964#true} {3964#true} #57#return; {3964#true} is VALID [2020-07-08 21:49:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} ~n := #in~n; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,070 INFO L280 TraceCheckUtils]: 2: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,071 INFO L280 TraceCheckUtils]: 3: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,073 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3964#true} #61#return; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,073 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,074 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,074 INFO L280 TraceCheckUtils]: 2: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,074 INFO L280 TraceCheckUtils]: 3: Hoare triple {3964#true} assume 0 == ~n; {3964#true} is VALID [2020-07-08 21:49:16,074 INFO L263 TraceCheckUtils]: 4: Hoare triple {3964#true} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,075 INFO L280 TraceCheckUtils]: 5: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,075 INFO L280 TraceCheckUtils]: 6: Hoare triple {3964#true} ~n := #in~n; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,076 INFO L280 TraceCheckUtils]: 7: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,077 INFO L280 TraceCheckUtils]: 8: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,078 INFO L280 TraceCheckUtils]: 9: Hoare triple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,079 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3964#true} #61#return; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,080 INFO L280 TraceCheckUtils]: 11: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,080 INFO L280 TraceCheckUtils]: 12: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,081 INFO L280 TraceCheckUtils]: 13: Hoare triple {4174#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,082 INFO L280 TraceCheckUtils]: 14: Hoare triple {4174#(<= 2 |ackermann_#res|)} assume true; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,083 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4174#(<= 2 |ackermann_#res|)} {3964#true} #63#return; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,123 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} ~n := #in~n; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,125 INFO L280 TraceCheckUtils]: 3: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,126 INFO L280 TraceCheckUtils]: 4: Hoare triple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,127 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4159#(<= 2 |ackermann_#t~ret1|)} #65#return; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,128 INFO L280 TraceCheckUtils]: 3: Hoare triple {3964#true} assume !(0 == ~n); {3964#true} is VALID [2020-07-08 21:49:16,128 INFO L263 TraceCheckUtils]: 4: Hoare triple {3964#true} call #t~ret1 := ackermann(~m, ~n - 1); {3964#true} is VALID [2020-07-08 21:49:16,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,129 INFO L280 TraceCheckUtils]: 7: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,129 INFO L280 TraceCheckUtils]: 8: Hoare triple {3964#true} assume 0 == ~n; {3964#true} is VALID [2020-07-08 21:49:16,129 INFO L263 TraceCheckUtils]: 9: Hoare triple {3964#true} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,130 INFO L280 TraceCheckUtils]: 10: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,130 INFO L280 TraceCheckUtils]: 11: Hoare triple {3964#true} ~n := #in~n; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,131 INFO L280 TraceCheckUtils]: 12: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,132 INFO L280 TraceCheckUtils]: 13: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,132 INFO L280 TraceCheckUtils]: 14: Hoare triple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,134 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3964#true} #61#return; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,134 INFO L280 TraceCheckUtils]: 16: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,135 INFO L280 TraceCheckUtils]: 17: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,136 INFO L280 TraceCheckUtils]: 18: Hoare triple {4174#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,136 INFO L280 TraceCheckUtils]: 19: Hoare triple {4174#(<= 2 |ackermann_#res|)} assume true; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,137 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4174#(<= 2 |ackermann_#res|)} {3964#true} #63#return; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,138 INFO L280 TraceCheckUtils]: 21: Hoare triple {4159#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,138 INFO L263 TraceCheckUtils]: 22: Hoare triple {4159#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3964#true} is VALID [2020-07-08 21:49:16,138 INFO L280 TraceCheckUtils]: 23: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,139 INFO L280 TraceCheckUtils]: 24: Hoare triple {3964#true} ~n := #in~n; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,139 INFO L280 TraceCheckUtils]: 25: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,140 INFO L280 TraceCheckUtils]: 26: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,141 INFO L280 TraceCheckUtils]: 27: Hoare triple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,142 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4159#(<= 2 |ackermann_#t~ret1|)} #65#return; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,143 INFO L280 TraceCheckUtils]: 29: Hoare triple {4166#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,143 INFO L280 TraceCheckUtils]: 30: Hoare triple {4166#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,144 INFO L280 TraceCheckUtils]: 31: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,144 INFO L280 TraceCheckUtils]: 32: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,145 INFO L280 TraceCheckUtils]: 33: Hoare triple {4142#(<= 3 |ackermann_#res|)} assume true; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,146 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4142#(<= 3 |ackermann_#res|)} {3964#true} #61#return; {4141#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,148 INFO L280 TraceCheckUtils]: 2: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,148 INFO L280 TraceCheckUtils]: 3: Hoare triple {3964#true} assume 0 == ~n; {3964#true} is VALID [2020-07-08 21:49:16,148 INFO L263 TraceCheckUtils]: 4: Hoare triple {3964#true} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,149 INFO L280 TraceCheckUtils]: 8: Hoare triple {3964#true} assume !(0 == ~n); {3964#true} is VALID [2020-07-08 21:49:16,150 INFO L263 TraceCheckUtils]: 9: Hoare triple {3964#true} call #t~ret1 := ackermann(~m, ~n - 1); {3964#true} is VALID [2020-07-08 21:49:16,150 INFO L280 TraceCheckUtils]: 10: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,150 INFO L280 TraceCheckUtils]: 11: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,150 INFO L280 TraceCheckUtils]: 12: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,150 INFO L280 TraceCheckUtils]: 13: Hoare triple {3964#true} assume 0 == ~n; {3964#true} is VALID [2020-07-08 21:49:16,151 INFO L263 TraceCheckUtils]: 14: Hoare triple {3964#true} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,151 INFO L280 TraceCheckUtils]: 15: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,151 INFO L280 TraceCheckUtils]: 16: Hoare triple {3964#true} ~n := #in~n; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,152 INFO L280 TraceCheckUtils]: 17: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,153 INFO L280 TraceCheckUtils]: 18: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,153 INFO L280 TraceCheckUtils]: 19: Hoare triple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,155 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3964#true} #61#return; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,155 INFO L280 TraceCheckUtils]: 21: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,156 INFO L280 TraceCheckUtils]: 22: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,156 INFO L280 TraceCheckUtils]: 23: Hoare triple {4174#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,157 INFO L280 TraceCheckUtils]: 24: Hoare triple {4174#(<= 2 |ackermann_#res|)} assume true; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,158 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {4174#(<= 2 |ackermann_#res|)} {3964#true} #63#return; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,159 INFO L280 TraceCheckUtils]: 26: Hoare triple {4159#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,159 INFO L263 TraceCheckUtils]: 27: Hoare triple {4159#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3964#true} is VALID [2020-07-08 21:49:16,159 INFO L280 TraceCheckUtils]: 28: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,160 INFO L280 TraceCheckUtils]: 29: Hoare triple {3964#true} ~n := #in~n; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,160 INFO L280 TraceCheckUtils]: 30: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,161 INFO L280 TraceCheckUtils]: 31: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,162 INFO L280 TraceCheckUtils]: 32: Hoare triple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,163 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4159#(<= 2 |ackermann_#t~ret1|)} #65#return; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,163 INFO L280 TraceCheckUtils]: 34: Hoare triple {4166#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,164 INFO L280 TraceCheckUtils]: 35: Hoare triple {4166#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,165 INFO L280 TraceCheckUtils]: 36: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,165 INFO L280 TraceCheckUtils]: 37: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,166 INFO L280 TraceCheckUtils]: 38: Hoare triple {4142#(<= 3 |ackermann_#res|)} assume true; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,167 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4142#(<= 3 |ackermann_#res|)} {3964#true} #61#return; {4141#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,167 INFO L280 TraceCheckUtils]: 40: Hoare triple {4141#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4141#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,168 INFO L280 TraceCheckUtils]: 41: Hoare triple {4141#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,169 INFO L280 TraceCheckUtils]: 42: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,169 INFO L280 TraceCheckUtils]: 43: Hoare triple {4142#(<= 3 |ackermann_#res|)} assume true; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,170 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4142#(<= 3 |ackermann_#res|)} {3964#true} #63#return; {4089#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,207 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {3964#true} assume 0 == ~m; {3964#true} is VALID [2020-07-08 21:49:16,208 INFO L280 TraceCheckUtils]: 3: Hoare triple {3964#true} #res := 1 + ~n; {3964#true} is VALID [2020-07-08 21:49:16,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {3964#true} assume true; {3964#true} is VALID [2020-07-08 21:49:16,209 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3964#true} {4179#(= 0 |ackermann_#in~n|)} #61#return; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,210 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} ~n := #in~n; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,211 INFO L280 TraceCheckUtils]: 3: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,212 INFO L263 TraceCheckUtils]: 4: Hoare triple {4179#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,212 INFO L280 TraceCheckUtils]: 5: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,212 INFO L280 TraceCheckUtils]: 6: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,212 INFO L280 TraceCheckUtils]: 7: Hoare triple {3964#true} assume 0 == ~m; {3964#true} is VALID [2020-07-08 21:49:16,212 INFO L280 TraceCheckUtils]: 8: Hoare triple {3964#true} #res := 1 + ~n; {3964#true} is VALID [2020-07-08 21:49:16,213 INFO L280 TraceCheckUtils]: 9: Hoare triple {3964#true} assume true; {3964#true} is VALID [2020-07-08 21:49:16,214 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3964#true} {4179#(= 0 |ackermann_#in~n|)} #61#return; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,215 INFO L280 TraceCheckUtils]: 11: Hoare triple {4179#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,215 INFO L280 TraceCheckUtils]: 12: Hoare triple {4179#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,216 INFO L280 TraceCheckUtils]: 13: Hoare triple {4179#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,216 INFO L280 TraceCheckUtils]: 14: Hoare triple {4179#(= 0 |ackermann_#in~n|)} assume true; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,218 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4179#(= 0 |ackermann_#in~n|)} {4089#(<= 3 |ackermann_#t~ret1|)} #65#return; {3965#false} is VALID [2020-07-08 21:49:16,218 INFO L280 TraceCheckUtils]: 0: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,219 INFO L280 TraceCheckUtils]: 2: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,219 INFO L280 TraceCheckUtils]: 3: Hoare triple {3964#true} assume !(0 == ~n); {3964#true} is VALID [2020-07-08 21:49:16,219 INFO L263 TraceCheckUtils]: 4: Hoare triple {3964#true} call #t~ret1 := ackermann(~m, ~n - 1); {3964#true} is VALID [2020-07-08 21:49:16,219 INFO L280 TraceCheckUtils]: 5: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,220 INFO L280 TraceCheckUtils]: 8: Hoare triple {3964#true} assume 0 == ~n; {3964#true} is VALID [2020-07-08 21:49:16,220 INFO L263 TraceCheckUtils]: 9: Hoare triple {3964#true} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,220 INFO L280 TraceCheckUtils]: 10: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,220 INFO L280 TraceCheckUtils]: 11: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,220 INFO L280 TraceCheckUtils]: 12: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,221 INFO L280 TraceCheckUtils]: 13: Hoare triple {3964#true} assume !(0 == ~n); {3964#true} is VALID [2020-07-08 21:49:16,221 INFO L263 TraceCheckUtils]: 14: Hoare triple {3964#true} call #t~ret1 := ackermann(~m, ~n - 1); {3964#true} is VALID [2020-07-08 21:49:16,221 INFO L280 TraceCheckUtils]: 15: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,221 INFO L280 TraceCheckUtils]: 16: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,221 INFO L280 TraceCheckUtils]: 17: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,222 INFO L280 TraceCheckUtils]: 18: Hoare triple {3964#true} assume 0 == ~n; {3964#true} is VALID [2020-07-08 21:49:16,222 INFO L263 TraceCheckUtils]: 19: Hoare triple {3964#true} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,222 INFO L280 TraceCheckUtils]: 20: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,223 INFO L280 TraceCheckUtils]: 21: Hoare triple {3964#true} ~n := #in~n; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,223 INFO L280 TraceCheckUtils]: 22: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,224 INFO L280 TraceCheckUtils]: 23: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,225 INFO L280 TraceCheckUtils]: 24: Hoare triple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,226 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3964#true} #61#return; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,227 INFO L280 TraceCheckUtils]: 26: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,227 INFO L280 TraceCheckUtils]: 27: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,228 INFO L280 TraceCheckUtils]: 28: Hoare triple {4174#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,228 INFO L280 TraceCheckUtils]: 29: Hoare triple {4174#(<= 2 |ackermann_#res|)} assume true; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,230 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4174#(<= 2 |ackermann_#res|)} {3964#true} #63#return; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,230 INFO L280 TraceCheckUtils]: 31: Hoare triple {4159#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,230 INFO L263 TraceCheckUtils]: 32: Hoare triple {4159#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3964#true} is VALID [2020-07-08 21:49:16,231 INFO L280 TraceCheckUtils]: 33: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,231 INFO L280 TraceCheckUtils]: 34: Hoare triple {3964#true} ~n := #in~n; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,232 INFO L280 TraceCheckUtils]: 35: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,232 INFO L280 TraceCheckUtils]: 36: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,233 INFO L280 TraceCheckUtils]: 37: Hoare triple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,234 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4159#(<= 2 |ackermann_#t~ret1|)} #65#return; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,235 INFO L280 TraceCheckUtils]: 39: Hoare triple {4166#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,235 INFO L280 TraceCheckUtils]: 40: Hoare triple {4166#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,236 INFO L280 TraceCheckUtils]: 41: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,237 INFO L280 TraceCheckUtils]: 42: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,237 INFO L280 TraceCheckUtils]: 43: Hoare triple {4142#(<= 3 |ackermann_#res|)} assume true; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,238 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4142#(<= 3 |ackermann_#res|)} {3964#true} #61#return; {4141#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,239 INFO L280 TraceCheckUtils]: 45: Hoare triple {4141#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4141#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,239 INFO L280 TraceCheckUtils]: 46: Hoare triple {4141#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,240 INFO L280 TraceCheckUtils]: 47: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,240 INFO L280 TraceCheckUtils]: 48: Hoare triple {4142#(<= 3 |ackermann_#res|)} assume true; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,242 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {4142#(<= 3 |ackermann_#res|)} {3964#true} #63#return; {4089#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,242 INFO L280 TraceCheckUtils]: 50: Hoare triple {4089#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4089#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,242 INFO L263 TraceCheckUtils]: 51: Hoare triple {4089#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3964#true} is VALID [2020-07-08 21:49:16,243 INFO L280 TraceCheckUtils]: 52: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,243 INFO L280 TraceCheckUtils]: 53: Hoare triple {3964#true} ~n := #in~n; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,244 INFO L280 TraceCheckUtils]: 54: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,244 INFO L280 TraceCheckUtils]: 55: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,245 INFO L263 TraceCheckUtils]: 56: Hoare triple {4179#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,245 INFO L280 TraceCheckUtils]: 57: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,245 INFO L280 TraceCheckUtils]: 58: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,245 INFO L280 TraceCheckUtils]: 59: Hoare triple {3964#true} assume 0 == ~m; {3964#true} is VALID [2020-07-08 21:49:16,245 INFO L280 TraceCheckUtils]: 60: Hoare triple {3964#true} #res := 1 + ~n; {3964#true} is VALID [2020-07-08 21:49:16,246 INFO L280 TraceCheckUtils]: 61: Hoare triple {3964#true} assume true; {3964#true} is VALID [2020-07-08 21:49:16,247 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {3964#true} {4179#(= 0 |ackermann_#in~n|)} #61#return; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,247 INFO L280 TraceCheckUtils]: 63: Hoare triple {4179#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,248 INFO L280 TraceCheckUtils]: 64: Hoare triple {4179#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,248 INFO L280 TraceCheckUtils]: 65: Hoare triple {4179#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,249 INFO L280 TraceCheckUtils]: 66: Hoare triple {4179#(= 0 |ackermann_#in~n|)} assume true; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,250 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {4179#(= 0 |ackermann_#in~n|)} {4089#(<= 3 |ackermann_#t~ret1|)} #65#return; {3965#false} is VALID [2020-07-08 21:49:16,250 INFO L280 TraceCheckUtils]: 68: Hoare triple {3965#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3965#false} is VALID [2020-07-08 21:49:16,250 INFO L280 TraceCheckUtils]: 69: Hoare triple {3965#false} #res := #t~ret2; {3965#false} is VALID [2020-07-08 21:49:16,250 INFO L280 TraceCheckUtils]: 70: Hoare triple {3965#false} havoc #t~ret2; {3965#false} is VALID [2020-07-08 21:49:16,251 INFO L280 TraceCheckUtils]: 71: Hoare triple {3965#false} havoc #t~ret1; {3965#false} is VALID [2020-07-08 21:49:16,251 INFO L280 TraceCheckUtils]: 72: Hoare triple {3965#false} assume true; {3965#false} is VALID [2020-07-08 21:49:16,251 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3965#false} {3964#true} #67#return; {4042#(<= 5 |main_#t~ret5|)} is VALID [2020-07-08 21:49:16,257 INFO L263 TraceCheckUtils]: 0: Hoare triple {3964#true} call ULTIMATE.init(); {3964#true} is VALID [2020-07-08 21:49:16,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {3964#true} assume true; {3964#true} is VALID [2020-07-08 21:49:16,257 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3964#true} {3964#true} #57#return; {3964#true} is VALID [2020-07-08 21:49:16,257 INFO L263 TraceCheckUtils]: 3: Hoare triple {3964#true} call #t~ret6 := main(); {3964#true} is VALID [2020-07-08 21:49:16,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {3964#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3964#true} is VALID [2020-07-08 21:49:16,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {3964#true} ~m~0 := #t~nondet3; {3964#true} is VALID [2020-07-08 21:49:16,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {3964#true} havoc #t~nondet3; {3964#true} is VALID [2020-07-08 21:49:16,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {3964#true} assume !(~m~0 < 0 || ~m~0 > 3); {3964#true} is VALID [2020-07-08 21:49:16,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {3964#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3964#true} is VALID [2020-07-08 21:49:16,258 INFO L280 TraceCheckUtils]: 9: Hoare triple {3964#true} ~n~0 := #t~nondet4; {3964#true} is VALID [2020-07-08 21:49:16,258 INFO L280 TraceCheckUtils]: 10: Hoare triple {3964#true} havoc #t~nondet4; {3964#true} is VALID [2020-07-08 21:49:16,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {3964#true} assume !(~n~0 < 0 || ~n~0 > 23); {3964#true} is VALID [2020-07-08 21:49:16,259 INFO L263 TraceCheckUtils]: 12: Hoare triple {3964#true} call #t~ret5 := ackermann(~m~0, ~n~0); {3964#true} is VALID [2020-07-08 21:49:16,259 INFO L280 TraceCheckUtils]: 13: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,259 INFO L280 TraceCheckUtils]: 14: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,259 INFO L280 TraceCheckUtils]: 15: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,259 INFO L280 TraceCheckUtils]: 16: Hoare triple {3964#true} assume !(0 == ~n); {3964#true} is VALID [2020-07-08 21:49:16,260 INFO L263 TraceCheckUtils]: 17: Hoare triple {3964#true} call #t~ret1 := ackermann(~m, ~n - 1); {3964#true} is VALID [2020-07-08 21:49:16,260 INFO L280 TraceCheckUtils]: 18: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,260 INFO L280 TraceCheckUtils]: 19: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,260 INFO L280 TraceCheckUtils]: 20: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,260 INFO L280 TraceCheckUtils]: 21: Hoare triple {3964#true} assume 0 == ~n; {3964#true} is VALID [2020-07-08 21:49:16,260 INFO L263 TraceCheckUtils]: 22: Hoare triple {3964#true} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,261 INFO L280 TraceCheckUtils]: 23: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,261 INFO L280 TraceCheckUtils]: 24: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,261 INFO L280 TraceCheckUtils]: 25: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,261 INFO L280 TraceCheckUtils]: 26: Hoare triple {3964#true} assume !(0 == ~n); {3964#true} is VALID [2020-07-08 21:49:16,261 INFO L263 TraceCheckUtils]: 27: Hoare triple {3964#true} call #t~ret1 := ackermann(~m, ~n - 1); {3964#true} is VALID [2020-07-08 21:49:16,261 INFO L280 TraceCheckUtils]: 28: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,262 INFO L280 TraceCheckUtils]: 29: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,262 INFO L280 TraceCheckUtils]: 30: Hoare triple {3964#true} assume !(0 == ~m); {3964#true} is VALID [2020-07-08 21:49:16,262 INFO L280 TraceCheckUtils]: 31: Hoare triple {3964#true} assume 0 == ~n; {3964#true} is VALID [2020-07-08 21:49:16,262 INFO L263 TraceCheckUtils]: 32: Hoare triple {3964#true} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,262 INFO L280 TraceCheckUtils]: 33: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,263 INFO L280 TraceCheckUtils]: 34: Hoare triple {3964#true} ~n := #in~n; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,263 INFO L280 TraceCheckUtils]: 35: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-08 21:49:16,264 INFO L280 TraceCheckUtils]: 36: Hoare triple {4175#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,265 INFO L280 TraceCheckUtils]: 37: Hoare triple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-08 21:49:16,266 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4176#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3964#true} #61#return; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,267 INFO L280 TraceCheckUtils]: 39: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,267 INFO L280 TraceCheckUtils]: 40: Hoare triple {4173#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,268 INFO L280 TraceCheckUtils]: 41: Hoare triple {4174#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,268 INFO L280 TraceCheckUtils]: 42: Hoare triple {4174#(<= 2 |ackermann_#res|)} assume true; {4174#(<= 2 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,269 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4174#(<= 2 |ackermann_#res|)} {3964#true} #63#return; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,270 INFO L280 TraceCheckUtils]: 44: Hoare triple {4159#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4159#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,270 INFO L263 TraceCheckUtils]: 45: Hoare triple {4159#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3964#true} is VALID [2020-07-08 21:49:16,270 INFO L280 TraceCheckUtils]: 46: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,271 INFO L280 TraceCheckUtils]: 47: Hoare triple {3964#true} ~n := #in~n; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,272 INFO L280 TraceCheckUtils]: 48: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,272 INFO L280 TraceCheckUtils]: 49: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,273 INFO L280 TraceCheckUtils]: 50: Hoare triple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-08 21:49:16,274 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {4178#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4159#(<= 2 |ackermann_#t~ret1|)} #65#return; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,275 INFO L280 TraceCheckUtils]: 52: Hoare triple {4166#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4166#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-08 21:49:16,276 INFO L280 TraceCheckUtils]: 53: Hoare triple {4166#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,276 INFO L280 TraceCheckUtils]: 54: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,276 INFO L280 TraceCheckUtils]: 55: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,277 INFO L280 TraceCheckUtils]: 56: Hoare triple {4142#(<= 3 |ackermann_#res|)} assume true; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,277 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {4142#(<= 3 |ackermann_#res|)} {3964#true} #61#return; {4141#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,278 INFO L280 TraceCheckUtils]: 58: Hoare triple {4141#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4141#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-08 21:49:16,278 INFO L280 TraceCheckUtils]: 59: Hoare triple {4141#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,279 INFO L280 TraceCheckUtils]: 60: Hoare triple {4142#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,279 INFO L280 TraceCheckUtils]: 61: Hoare triple {4142#(<= 3 |ackermann_#res|)} assume true; {4142#(<= 3 |ackermann_#res|)} is VALID [2020-07-08 21:49:16,280 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4142#(<= 3 |ackermann_#res|)} {3964#true} #63#return; {4089#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,281 INFO L280 TraceCheckUtils]: 63: Hoare triple {4089#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4089#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-08 21:49:16,281 INFO L263 TraceCheckUtils]: 64: Hoare triple {4089#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3964#true} is VALID [2020-07-08 21:49:16,281 INFO L280 TraceCheckUtils]: 65: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,282 INFO L280 TraceCheckUtils]: 66: Hoare triple {3964#true} ~n := #in~n; {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,282 INFO L280 TraceCheckUtils]: 67: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4177#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,282 INFO L280 TraceCheckUtils]: 68: Hoare triple {4177#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,283 INFO L263 TraceCheckUtils]: 69: Hoare triple {4179#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3964#true} is VALID [2020-07-08 21:49:16,283 INFO L280 TraceCheckUtils]: 70: Hoare triple {3964#true} ~m := #in~m; {3964#true} is VALID [2020-07-08 21:49:16,283 INFO L280 TraceCheckUtils]: 71: Hoare triple {3964#true} ~n := #in~n; {3964#true} is VALID [2020-07-08 21:49:16,283 INFO L280 TraceCheckUtils]: 72: Hoare triple {3964#true} assume 0 == ~m; {3964#true} is VALID [2020-07-08 21:49:16,283 INFO L280 TraceCheckUtils]: 73: Hoare triple {3964#true} #res := 1 + ~n; {3964#true} is VALID [2020-07-08 21:49:16,283 INFO L280 TraceCheckUtils]: 74: Hoare triple {3964#true} assume true; {3964#true} is VALID [2020-07-08 21:49:16,284 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3964#true} {4179#(= 0 |ackermann_#in~n|)} #61#return; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,284 INFO L280 TraceCheckUtils]: 76: Hoare triple {4179#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,285 INFO L280 TraceCheckUtils]: 77: Hoare triple {4179#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,285 INFO L280 TraceCheckUtils]: 78: Hoare triple {4179#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,285 INFO L280 TraceCheckUtils]: 79: Hoare triple {4179#(= 0 |ackermann_#in~n|)} assume true; {4179#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:16,286 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {4179#(= 0 |ackermann_#in~n|)} {4089#(<= 3 |ackermann_#t~ret1|)} #65#return; {3965#false} is VALID [2020-07-08 21:49:16,286 INFO L280 TraceCheckUtils]: 81: Hoare triple {3965#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3965#false} is VALID [2020-07-08 21:49:16,286 INFO L280 TraceCheckUtils]: 82: Hoare triple {3965#false} #res := #t~ret2; {3965#false} is VALID [2020-07-08 21:49:16,287 INFO L280 TraceCheckUtils]: 83: Hoare triple {3965#false} havoc #t~ret2; {3965#false} is VALID [2020-07-08 21:49:16,287 INFO L280 TraceCheckUtils]: 84: Hoare triple {3965#false} havoc #t~ret1; {3965#false} is VALID [2020-07-08 21:49:16,287 INFO L280 TraceCheckUtils]: 85: Hoare triple {3965#false} assume true; {3965#false} is VALID [2020-07-08 21:49:16,287 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {3965#false} {3964#true} #67#return; {4042#(<= 5 |main_#t~ret5|)} is VALID [2020-07-08 21:49:16,288 INFO L280 TraceCheckUtils]: 87: Hoare triple {4042#(<= 5 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4042#(<= 5 |main_#t~ret5|)} is VALID [2020-07-08 21:49:16,288 INFO L280 TraceCheckUtils]: 88: Hoare triple {4042#(<= 5 |main_#t~ret5|)} ~result~0 := #t~ret5; {4043#(<= 5 main_~result~0)} is VALID [2020-07-08 21:49:16,288 INFO L280 TraceCheckUtils]: 89: Hoare triple {4043#(<= 5 main_~result~0)} havoc #t~ret5; {4043#(<= 5 main_~result~0)} is VALID [2020-07-08 21:49:16,289 INFO L280 TraceCheckUtils]: 90: Hoare triple {4043#(<= 5 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {3965#false} is VALID [2020-07-08 21:49:16,289 INFO L280 TraceCheckUtils]: 91: Hoare triple {3965#false} assume !false; {3965#false} is VALID [2020-07-08 21:49:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 60 proven. 35 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-07-08 21:49:16,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1944008851] [2020-07-08 21:49:16,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:16,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-08 21:49:16,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178751667] [2020-07-08 21:49:16,296 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-07-08 21:49:16,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:16,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 21:49:16,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:16,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 21:49:16,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 21:49:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-08 21:49:16,382 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 16 states. [2020-07-08 21:49:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:18,503 INFO L93 Difference]: Finished difference Result 146 states and 235 transitions. [2020-07-08 21:49:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-08 21:49:18,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-07-08 21:49:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 21:49:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2020-07-08 21:49:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 21:49:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2020-07-08 21:49:18,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2020-07-08 21:49:18,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:18,684 INFO L225 Difference]: With dead ends: 146 [2020-07-08 21:49:18,685 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 21:49:18,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=1242, Unknown=0, NotChecked=0, Total=1560 [2020-07-08 21:49:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 21:49:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 21:49:18,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:18,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:18,688 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:18,689 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:18,689 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 21:49:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 21:49:18,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:18,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:18,690 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:18,690 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 21:49:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:18,691 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 21:49:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 21:49:18,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:18,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:18,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:18,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 21:49:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 21:49:18,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2020-07-08 21:49:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:18,692 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 21:49:18,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 21:49:18,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 21:49:18,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 21:49:18,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:18,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 21:49:18,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 21:49:20,877 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2020-07-08 21:49:21,144 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2020-07-08 21:49:21,410 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-07-08 21:49:21,576 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-07-08 21:49:21,864 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2020-07-08 21:49:22,176 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2020-07-08 21:49:22,594 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-07-08 21:49:22,850 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-07-08 21:49:22,858 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 21:49:22,858 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 21:49:22,858 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 21:49:22,858 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 21:49:22,858 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 21:49:22,859 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 21:49:22,859 INFO L264 CegarLoopResult]: At program point ackermannEXIT(lines 15 23) the Hoare annotation is: (let ((.cse2 (= ackermann_~m |ackermann_#in~m|)) (.cse6 (= ackermann_~n |ackermann_#in~n|)) (.cse5 (<= 1 |ackermann_#in~m|))) (let ((.cse1 (and .cse2 .cse6 (<= 3 |ackermann_#res|) .cse5)) (.cse0 (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (and (or .cse0 .cse1) (let ((.cse4 (<= 2 |ackermann_#res|))) (let ((.cse3 (or (and .cse4 .cse6) (and .cse6 .cse0)))) (or (and (= 0 |ackermann_#in~m|) .cse2 .cse3) (and .cse4 .cse2 (<= ackermann_~m 1) (= 0 |ackermann_#in~n|) .cse5 .cse3) .cse1)))))) [2020-07-08 21:49:22,859 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|)) [2020-07-08 21:49:22,860 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-07-08 21:49:22,860 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (let ((.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 (<= ackermann_~m 1) (<= 2 |ackermann_#t~ret1|) .cse3))) (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))))) [2020-07-08 21:49:22,860 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|) (= 0 |ackermann_#in~n|)) [2020-07-08 21:49:22,861 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (let ((.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 (<= ackermann_~m 1) (<= 2 |ackermann_#t~ret1|) .cse3))) (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))))) [2020-07-08 21:49:22,861 INFO L264 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|)) [2020-07-08 21:49:22,861 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|))) (or (and .cse0 (<= 3 |ackermann_#t~ret0|) .cse1) (and .cse0 .cse1 (<= 2 |ackermann_#t~ret0|) (<= ackermann_~m 1)))) (= 0 |ackermann_#in~n|) (<= 1 |ackermann_#in~m|)) [2020-07-08 21:49:22,861 INFO L264 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (<= 3 |ackermann_#t~ret2|) (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1) (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse1))))) [2020-07-08 21:49:22,862 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|))) (or (and .cse0 (<= 3 |ackermann_#t~ret0|) .cse1) (and .cse0 .cse1 (<= 2 |ackermann_#t~ret0|) (<= ackermann_~m 1)))) (= 0 |ackermann_#in~n|) (<= 1 |ackermann_#in~m|)) [2020-07-08 21:49:22,862 INFO L264 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (<= 3 |ackermann_#t~ret2|) (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1) (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse1))))) [2020-07-08 21:49:22,862 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= 0 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-07-08 21:49:22,862 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (and (<= 2 |ackermann_#res|) (= ackermann_~n |ackermann_#in~n|) (<= 2 |ackermann_#t~ret0|) (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= 0 |ackermann_#in~n|)) (.cse1 (<= 1 |ackermann_#in~m|))) (or (and .cse0 (<= 3 |ackermann_#t~ret0|) (<= 3 |ackermann_#res|) .cse1 .cse2) (and .cse0 (<= ackermann_~m 1) .cse2 .cse1)))) [2020-07-08 21:49:22,862 INFO L264 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= 3 |ackermann_#t~ret2|)) (.cse3 (<= 3 |ackermann_#res|)) (.cse4 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse4) (and .cse0 (<= 3 |ackermann_#t~ret1|) .cse1 .cse2 .cse3 .cse4))) [2020-07-08 21:49:22,862 INFO L264 CegarLoopResult]: At program point L16(lines 16 18) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-07-08 21:49:22,862 INFO L264 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= 3 |ackermann_#res|)) (.cse3 (<= 1 |ackermann_#in~m|))) (or (and (<= 3 |ackermann_#t~ret1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse3))) [2020-07-08 21:49:22,862 INFO L264 CegarLoopResult]: At program point L15(lines 15 23) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-07-08 21:49:22,863 INFO L264 CegarLoopResult]: At program point ackermannFINAL(lines 15 23) the Hoare annotation is: (let ((.cse2 (= ackermann_~m |ackermann_#in~m|)) (.cse6 (= ackermann_~n |ackermann_#in~n|)) (.cse5 (<= 1 |ackermann_#in~m|))) (let ((.cse1 (and .cse2 .cse6 (<= 3 |ackermann_#res|) .cse5)) (.cse0 (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (and (or .cse0 .cse1) (let ((.cse4 (<= 2 |ackermann_#res|))) (let ((.cse3 (or (and .cse4 .cse6) (and .cse6 .cse0)))) (or (and (= 0 |ackermann_#in~m|) .cse2 .cse3) (and .cse4 .cse2 (<= ackermann_~m 1) (= 0 |ackermann_#in~n|) .cse5 .cse3) .cse1)))))) [2020-07-08 21:49:22,863 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-08 21:49:22,863 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-07-08 21:49:22,863 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-08 21:49:22,863 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-07-08 21:49:22,863 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-08 21:49:22,863 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-08 21:49:22,863 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 26 46) the Hoare annotation is: true [2020-07-08 21:49:22,863 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 26 46) the Hoare annotation is: true [2020-07-08 21:49:22,863 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: false [2020-07-08 21:49:22,864 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-08 21:49:22,864 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-08 21:49:22,864 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-07-08 21:49:22,864 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-08 21:49:22,864 INFO L264 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-07-08 21:49:22,864 INFO L264 CegarLoopResult]: At program point L40-3(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|) (<= 1 main_~result~0)) [2020-07-08 21:49:22,864 INFO L271 CegarLoopResult]: At program point L34(lines 34 39) the Hoare annotation is: true [2020-07-08 21:49:22,864 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2020-07-08 21:49:22,864 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2020-07-08 21:49:22,864 INFO L271 CegarLoopResult]: At program point L28(lines 28 32) the Hoare annotation is: true [2020-07-08 21:49:22,865 INFO L264 CegarLoopResult]: At program point L41(lines 41 45) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 main_~result~0)) [2020-07-08 21:49:22,892 INFO L163 areAnnotationChecker]: CFG has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 21:49:22,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 09:49:22 BoogieIcfgContainer [2020-07-08 21:49:22,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 21:49:22,912 INFO L168 Benchmark]: Toolchain (without parser) took 21055.67 ms. Allocated memory was 134.7 MB in the beginning and 453.0 MB in the end (delta: 318.2 MB). Free memory was 100.3 MB in the beginning and 414.5 MB in the end (delta: -314.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:22,913 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 21:49:22,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.19 ms. Allocated memory is still 134.7 MB. Free memory was 99.9 MB in the beginning and 89.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:22,914 INFO L168 Benchmark]: Boogie Preprocessor took 27.08 ms. Allocated memory is still 134.7 MB. Free memory was 89.6 MB in the beginning and 88.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:22,914 INFO L168 Benchmark]: RCFGBuilder took 496.44 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 88.2 MB in the beginning and 156.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:22,919 INFO L168 Benchmark]: TraceAbstraction took 20275.05 ms. Allocated memory was 199.8 MB in the beginning and 453.0 MB in the end (delta: 253.2 MB). Free memory was 156.0 MB in the beginning and 414.5 MB in the end (delta: -258.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 21:49:22,921 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.20 ms. Allocated memory is still 134.7 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 251.19 ms. Allocated memory is still 134.7 MB. Free memory was 99.9 MB in the beginning and 89.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.08 ms. Allocated memory is still 134.7 MB. Free memory was 89.6 MB in the beginning and 88.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 496.44 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 88.2 MB in the beginning and 156.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20275.05 ms. Allocated memory was 199.8 MB in the beginning and 453.0 MB in the end (delta: 253.2 MB). Free memory was 156.0 MB in the beginning and 414.5 MB in the end (delta: -258.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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 - ProcedureContractResult [Line: 15]: Procedure Contract for ackermann Derived contract for procedure ackermann: (\old(n) + 1 <= \result || (((m == \old(m) && n == \old(n)) && 3 <= \result) && 1 <= \old(m))) && ((((0 == \old(m) && m == \old(m)) && ((2 <= \result && n == \old(n)) || (n == \old(n) && \old(n) + 1 <= \result))) || (((((2 <= \result && m == \old(m)) && m <= 1) && 0 == \old(n)) && 1 <= \old(m)) && ((2 <= \result && n == \old(n)) || (n == \old(n) && \old(n) + 1 <= \result)))) || (((m == \old(m) && n == \old(n)) && 3 <= \result) && 1 <= \old(m))) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.9s, OverallIterations: 8, TraceHistogramMax: 8, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 288 SDtfs, 349 SDslu, 1249 SDs, 0 SdLazy, 1389 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 100 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 566 PreInvPairs, 1015 NumberOfFragments, 658 HoareAnnotationTreeSize, 566 FomulaSimplifications, 74704 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 44 FomulaSimplificationsInter, 2927 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 52851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 355/435 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...