/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-8fc6572 [2020-07-11 00:33:43,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:43,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:43,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:43,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:43,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:43,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:43,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:43,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:43,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:43,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:43,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:43,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:43,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:43,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:43,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:43,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:43,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:43,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:43,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:43,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:43,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:43,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:43,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:43,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:43,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:43,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:43,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:43,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:43,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:43,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:43,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:43,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:43,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:43,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:43,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:43,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:43,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:43,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:43,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:43,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:43,632 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:43,659 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:43,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:43,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:43,662 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:43,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:43,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:43,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:43,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:43,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:43,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:43,664 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:43,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:43,664 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:43,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:43,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:43,665 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:43,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:43,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:43,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:43,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:43,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:43,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:43,669 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-11 00:33:43,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:43,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:43,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:43,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:43,975 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:43,976 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-11 00:33:44,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffb9cd62/d1a48a7815b44cbf98e1442b87eb1ad3/FLAG9a904df26 [2020-07-11 00:33:44,478 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:44,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-07-11 00:33:44,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffb9cd62/d1a48a7815b44cbf98e1442b87eb1ad3/FLAG9a904df26 [2020-07-11 00:33:44,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffb9cd62/d1a48a7815b44cbf98e1442b87eb1ad3 [2020-07-11 00:33:44,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:44,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:44,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:44,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:44,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:44,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:44" (1/1) ... [2020-07-11 00:33:44,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5785b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:44, skipping insertion in model container [2020-07-11 00:33:44,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:44" (1/1) ... [2020-07-11 00:33:44,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:44,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:45,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:45,141 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:45,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:45,176 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:45,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45 WrapperNode [2020-07-11 00:33:45,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:45,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:45,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:45,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:45,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (1/1) ... [2020-07-11 00:33:45,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (1/1) ... [2020-07-11 00:33:45,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (1/1) ... [2020-07-11 00:33:45,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (1/1) ... [2020-07-11 00:33:45,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (1/1) ... [2020-07-11 00:33:45,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (1/1) ... [2020-07-11 00:33:45,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (1/1) ... [2020-07-11 00:33:45,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:45,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:45,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:45,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:45,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (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-11 00:33:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-11 00:33:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:33:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-11 00:33:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:45,787 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:45,788 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:33:45,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:45 BoogieIcfgContainer [2020-07-11 00:33:45,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:45,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:45,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:45,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:45,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:44" (1/3) ... [2020-07-11 00:33:45,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b11668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:45, skipping insertion in model container [2020-07-11 00:33:45,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:45" (2/3) ... [2020-07-11 00:33:45,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b11668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:45, skipping insertion in model container [2020-07-11 00:33:45,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:45" (3/3) ... [2020-07-11 00:33:45,800 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-07-11 00:33:45,809 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:45,817 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:45,832 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:45,858 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:45,859 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:45,859 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:45,859 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:45,859 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:45,859 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:45,860 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:45,860 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-11 00:33:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:33:45,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:45,890 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-11 00:33:45,891 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-07-11 00:33:45,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:45,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [212228135] [2020-07-11 00:33:45,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:46,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-11 00:33:46,147 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-11 00:33:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:46,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} ~m := #in~m; {47#true} is VALID [2020-07-11 00:33:46,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} ~n := #in~n; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:46,247 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-11 00:33:46,250 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-11 00:33:46,251 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-11 00:33:46,254 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-11 00:33:46,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-11 00:33:46,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-11 00:33:46,257 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-11 00:33:46,258 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret6 := main(); {47#true} is VALID [2020-07-11 00:33:46,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {47#true} is VALID [2020-07-11 00:33:46,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~m~0 := #t~nondet3; {47#true} is VALID [2020-07-11 00:33:46,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#true} havoc #t~nondet3; {47#true} is VALID [2020-07-11 00:33:46,261 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume !(~m~0 < 0 || ~m~0 > 3); {47#true} is VALID [2020-07-11 00:33:46,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {47#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {47#true} is VALID [2020-07-11 00:33:46,264 INFO L280 TraceCheckUtils]: 9: Hoare triple {47#true} ~n~0 := #t~nondet4; {47#true} is VALID [2020-07-11 00:33:46,264 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} havoc #t~nondet4; {47#true} is VALID [2020-07-11 00:33:46,266 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#true} assume !(~n~0 < 0 || ~n~0 > 23); {51#(<= 0 main_~n~0)} is VALID [2020-07-11 00:33:46,267 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-11 00:33:46,267 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#true} ~m := #in~m; {47#true} is VALID [2020-07-11 00:33:46,269 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#true} ~n := #in~n; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:46,270 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-11 00:33:46,271 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-11 00:33:46,272 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-11 00:33:46,274 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-11 00:33:46,275 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-11 00:33:46,277 INFO L280 TraceCheckUtils]: 20: Hoare triple {58#(<= 1 |main_#t~ret5|)} ~result~0 := #t~ret5; {59#(<= 1 main_~result~0)} is VALID [2020-07-11 00:33:46,278 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#(<= 1 main_~result~0)} havoc #t~ret5; {59#(<= 1 main_~result~0)} is VALID [2020-07-11 00:33:46,280 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-11 00:33:46,281 INFO L280 TraceCheckUtils]: 23: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-11 00:33:46,287 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-11 00:33:46,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [212228135] [2020-07-11 00:33:46,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:46,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:33:46,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948468477] [2020-07-11 00:33:46,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 00:33:46,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:46,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:33:46,382 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-11 00:33:46,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:33:46,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:46,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:33:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:33:46,395 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2020-07-11 00:33:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:47,100 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-07-11 00:33:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:33:47,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 00:33:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:33:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2020-07-11 00:33:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:33:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2020-07-11 00:33:47,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2020-07-11 00:33:47,242 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-11 00:33:47,264 INFO L225 Difference]: With dead ends: 61 [2020-07-11 00:33:47,264 INFO L226 Difference]: Without dead ends: 39 [2020-07-11 00:33:47,274 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-11 00:33:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-11 00:33:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-11 00:33:47,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:47,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2020-07-11 00:33:47,354 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-11 00:33:47,354 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-11 00:33:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:47,362 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-11 00:33:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-11 00:33:47,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:47,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:47,364 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-11 00:33:47,365 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-11 00:33:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:47,371 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-11 00:33:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-11 00:33:47,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:47,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:47,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:47,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-11 00:33:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-07-11 00:33:47,380 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2020-07-11 00:33:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:47,380 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-07-11 00:33:47,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:33:47,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2020-07-11 00:33:47,441 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-11 00:33:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-11 00:33:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:33:47,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:47,444 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-11 00:33:47,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:47,445 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-07-11 00:33:47,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:47,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068984785] [2020-07-11 00:33:47,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:47,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} assume true; {350#true} is VALID [2020-07-11 00:33:47,518 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {350#true} {350#true} #57#return; {350#true} is VALID [2020-07-11 00:33:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:47,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-11 00:33:47,626 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-11 00:33:47,627 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-11 00:33:47,628 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-11 00:33:47,629 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-11 00:33:47,631 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-11 00:33:47,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-11 00:33:47,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#true} ~n := #in~n; {350#true} is VALID [2020-07-11 00:33:47,632 INFO L280 TraceCheckUtils]: 2: Hoare triple {350#true} assume !(0 == ~m); {350#true} is VALID [2020-07-11 00:33:47,633 INFO L280 TraceCheckUtils]: 3: Hoare triple {350#true} assume 0 == ~n; {350#true} is VALID [2020-07-11 00:33:47,633 INFO L263 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret0 := ackermann(~m - 1, 1); {350#true} is VALID [2020-07-11 00:33:47,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-11 00:33:47,635 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-11 00:33:47,636 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-11 00:33:47,637 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-11 00:33:47,638 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-11 00:33:47,640 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-11 00:33:47,641 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-11 00:33:47,642 INFO L280 TraceCheckUtils]: 12: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:47,643 INFO L280 TraceCheckUtils]: 13: Hoare triple {379#(<= 2 |ackermann_#res|)} havoc #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:47,643 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#(<= 2 |ackermann_#res|)} assume true; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:47,645 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {379#(<= 2 |ackermann_#res|)} {350#true} #67#return; {370#(<= 2 |main_#t~ret5|)} is VALID [2020-07-11 00:33:47,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {350#true} is VALID [2020-07-11 00:33:47,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2020-07-11 00:33:47,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #57#return; {350#true} is VALID [2020-07-11 00:33:47,647 INFO L263 TraceCheckUtils]: 3: Hoare triple {350#true} call #t~ret6 := main(); {350#true} is VALID [2020-07-11 00:33:47,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {350#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {350#true} is VALID [2020-07-11 00:33:47,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {350#true} ~m~0 := #t~nondet3; {350#true} is VALID [2020-07-11 00:33:47,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {350#true} havoc #t~nondet3; {350#true} is VALID [2020-07-11 00:33:47,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {350#true} assume !(~m~0 < 0 || ~m~0 > 3); {350#true} is VALID [2020-07-11 00:33:47,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {350#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {350#true} is VALID [2020-07-11 00:33:47,649 INFO L280 TraceCheckUtils]: 9: Hoare triple {350#true} ~n~0 := #t~nondet4; {350#true} is VALID [2020-07-11 00:33:47,650 INFO L280 TraceCheckUtils]: 10: Hoare triple {350#true} havoc #t~nondet4; {350#true} is VALID [2020-07-11 00:33:47,650 INFO L280 TraceCheckUtils]: 11: Hoare triple {350#true} assume !(~n~0 < 0 || ~n~0 > 23); {350#true} is VALID [2020-07-11 00:33:47,651 INFO L263 TraceCheckUtils]: 12: Hoare triple {350#true} call #t~ret5 := ackermann(~m~0, ~n~0); {350#true} is VALID [2020-07-11 00:33:47,651 INFO L280 TraceCheckUtils]: 13: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-11 00:33:47,651 INFO L280 TraceCheckUtils]: 14: Hoare triple {350#true} ~n := #in~n; {350#true} is VALID [2020-07-11 00:33:47,652 INFO L280 TraceCheckUtils]: 15: Hoare triple {350#true} assume !(0 == ~m); {350#true} is VALID [2020-07-11 00:33:47,652 INFO L280 TraceCheckUtils]: 16: Hoare triple {350#true} assume 0 == ~n; {350#true} is VALID [2020-07-11 00:33:47,652 INFO L263 TraceCheckUtils]: 17: Hoare triple {350#true} call #t~ret0 := ackermann(~m - 1, 1); {350#true} is VALID [2020-07-11 00:33:47,653 INFO L280 TraceCheckUtils]: 18: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-11 00:33:47,654 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-11 00:33:47,655 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-11 00:33:47,656 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-11 00:33:47,657 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-11 00:33:47,658 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-11 00:33:47,659 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-11 00:33:47,660 INFO L280 TraceCheckUtils]: 25: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:47,661 INFO L280 TraceCheckUtils]: 26: Hoare triple {379#(<= 2 |ackermann_#res|)} havoc #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:47,662 INFO L280 TraceCheckUtils]: 27: Hoare triple {379#(<= 2 |ackermann_#res|)} assume true; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:47,663 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {379#(<= 2 |ackermann_#res|)} {350#true} #67#return; {370#(<= 2 |main_#t~ret5|)} is VALID [2020-07-11 00:33:47,664 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-11 00:33:47,665 INFO L280 TraceCheckUtils]: 30: Hoare triple {370#(<= 2 |main_#t~ret5|)} ~result~0 := #t~ret5; {371#(<= 2 main_~result~0)} is VALID [2020-07-11 00:33:47,666 INFO L280 TraceCheckUtils]: 31: Hoare triple {371#(<= 2 main_~result~0)} havoc #t~ret5; {371#(<= 2 main_~result~0)} is VALID [2020-07-11 00:33:47,667 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-11 00:33:47,667 INFO L280 TraceCheckUtils]: 33: Hoare triple {351#false} assume !false; {351#false} is VALID [2020-07-11 00:33:47,671 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-11 00:33:47,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068984785] [2020-07-11 00:33:47,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:47,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 00:33:47,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885766336] [2020-07-11 00:33:47,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-11 00:33:47,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:47,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:33:47,715 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-11 00:33:47,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:33:47,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:47,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:33:47,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:33:47,717 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 8 states. [2020-07-11 00:33:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:48,464 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-11 00:33:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:33:48,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-11 00:33:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:33:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2020-07-11 00:33:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:33:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2020-07-11 00:33:48,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2020-07-11 00:33:48,577 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-11 00:33:48,583 INFO L225 Difference]: With dead ends: 50 [2020-07-11 00:33:48,583 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 00:33:48,585 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-11 00:33:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 00:33:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-11 00:33:48,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:48,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-11 00:33:48,689 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-11 00:33:48,689 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-11 00:33:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:48,694 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-11 00:33:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-11 00:33:48,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:48,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:48,696 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-11 00:33:48,696 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-11 00:33:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:48,700 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-11 00:33:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-11 00:33:48,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:48,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:48,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:48,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 00:33:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-07-11 00:33:48,706 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2020-07-11 00:33:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:48,706 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-07-11 00:33:48,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:33:48,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 48 transitions. [2020-07-11 00:33:48,776 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-11 00:33:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-07-11 00:33:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 00:33:48,779 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:48,779 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-11 00:33:48,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:48,780 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:48,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:48,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2094172607, now seen corresponding path program 1 times [2020-07-11 00:33:48,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:48,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [585251755] [2020-07-11 00:33:48,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-11 00:33:48,824 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {667#true} {667#true} #57#return; {667#true} is VALID [2020-07-11 00:33:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,892 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-11 00:33:48,892 INFO L280 TraceCheckUtils]: 2: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,893 INFO L280 TraceCheckUtils]: 3: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,895 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-11 00:33:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-11 00:33:48,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-11 00:33:48,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-11 00:33:48,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-11 00:33:48,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-11 00:33:48,909 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-11 00:33:48,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-11 00:33:48,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-11 00:33:48,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#true} assume !(0 == ~m); {696#(not (= ackermann_~m 0))} is VALID [2020-07-11 00:33:48,911 INFO L280 TraceCheckUtils]: 3: Hoare triple {696#(not (= ackermann_~m 0))} assume !(0 == ~n); {696#(not (= ackermann_~m 0))} is VALID [2020-07-11 00:33:48,912 INFO L263 TraceCheckUtils]: 4: Hoare triple {696#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {667#true} is VALID [2020-07-11 00:33:48,912 INFO L280 TraceCheckUtils]: 5: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,913 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-11 00:33:48,913 INFO L280 TraceCheckUtils]: 7: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,914 INFO L280 TraceCheckUtils]: 8: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,915 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-11 00:33:48,915 INFO L280 TraceCheckUtils]: 11: Hoare triple {668#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {668#false} is VALID [2020-07-11 00:33:48,915 INFO L263 TraceCheckUtils]: 12: Hoare triple {668#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {667#true} is VALID [2020-07-11 00:33:48,915 INFO L280 TraceCheckUtils]: 13: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-11 00:33:48,916 INFO L280 TraceCheckUtils]: 14: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-11 00:33:48,916 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-11 00:33:48,916 INFO L280 TraceCheckUtils]: 16: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-11 00:33:48,916 INFO L280 TraceCheckUtils]: 17: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-11 00:33:48,917 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-11 00:33:48,917 INFO L280 TraceCheckUtils]: 19: Hoare triple {668#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {668#false} is VALID [2020-07-11 00:33:48,917 INFO L280 TraceCheckUtils]: 20: Hoare triple {668#false} #res := #t~ret2; {668#false} is VALID [2020-07-11 00:33:48,918 INFO L280 TraceCheckUtils]: 21: Hoare triple {668#false} havoc #t~ret1; {668#false} is VALID [2020-07-11 00:33:48,918 INFO L280 TraceCheckUtils]: 22: Hoare triple {668#false} havoc #t~ret2; {668#false} is VALID [2020-07-11 00:33:48,918 INFO L280 TraceCheckUtils]: 23: Hoare triple {668#false} assume true; {668#false} is VALID [2020-07-11 00:33:48,918 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {668#false} {667#true} #67#return; {668#false} is VALID [2020-07-11 00:33:48,920 INFO L263 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2020-07-11 00:33:48,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-11 00:33:48,921 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {667#true} {667#true} #57#return; {667#true} is VALID [2020-07-11 00:33:48,921 INFO L263 TraceCheckUtils]: 3: Hoare triple {667#true} call #t~ret6 := main(); {667#true} is VALID [2020-07-11 00:33:48,921 INFO L280 TraceCheckUtils]: 4: Hoare triple {667#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {667#true} is VALID [2020-07-11 00:33:48,921 INFO L280 TraceCheckUtils]: 5: Hoare triple {667#true} ~m~0 := #t~nondet3; {667#true} is VALID [2020-07-11 00:33:48,922 INFO L280 TraceCheckUtils]: 6: Hoare triple {667#true} havoc #t~nondet3; {667#true} is VALID [2020-07-11 00:33:48,922 INFO L280 TraceCheckUtils]: 7: Hoare triple {667#true} assume !(~m~0 < 0 || ~m~0 > 3); {667#true} is VALID [2020-07-11 00:33:48,922 INFO L280 TraceCheckUtils]: 8: Hoare triple {667#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {667#true} is VALID [2020-07-11 00:33:48,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {667#true} ~n~0 := #t~nondet4; {667#true} is VALID [2020-07-11 00:33:48,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {667#true} havoc #t~nondet4; {667#true} is VALID [2020-07-11 00:33:48,923 INFO L280 TraceCheckUtils]: 11: Hoare triple {667#true} assume !(~n~0 < 0 || ~n~0 > 23); {667#true} is VALID [2020-07-11 00:33:48,923 INFO L263 TraceCheckUtils]: 12: Hoare triple {667#true} call #t~ret5 := ackermann(~m~0, ~n~0); {667#true} is VALID [2020-07-11 00:33:48,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-11 00:33:48,924 INFO L280 TraceCheckUtils]: 14: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-11 00:33:48,942 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#true} assume !(0 == ~m); {696#(not (= ackermann_~m 0))} is VALID [2020-07-11 00:33:48,943 INFO L280 TraceCheckUtils]: 16: Hoare triple {696#(not (= ackermann_~m 0))} assume !(0 == ~n); {696#(not (= ackermann_~m 0))} is VALID [2020-07-11 00:33:48,943 INFO L263 TraceCheckUtils]: 17: Hoare triple {696#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {667#true} is VALID [2020-07-11 00:33:48,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,944 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-11 00:33:48,945 INFO L280 TraceCheckUtils]: 20: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,945 INFO L280 TraceCheckUtils]: 21: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,946 INFO L280 TraceCheckUtils]: 22: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,948 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-11 00:33:48,948 INFO L280 TraceCheckUtils]: 24: Hoare triple {668#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {668#false} is VALID [2020-07-11 00:33:48,948 INFO L263 TraceCheckUtils]: 25: Hoare triple {668#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {667#true} is VALID [2020-07-11 00:33:48,949 INFO L280 TraceCheckUtils]: 26: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-11 00:33:48,949 INFO L280 TraceCheckUtils]: 27: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-11 00:33:48,949 INFO L280 TraceCheckUtils]: 28: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-11 00:33:48,949 INFO L280 TraceCheckUtils]: 29: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-11 00:33:48,950 INFO L280 TraceCheckUtils]: 30: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-11 00:33:48,950 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-11 00:33:48,950 INFO L280 TraceCheckUtils]: 32: Hoare triple {668#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {668#false} is VALID [2020-07-11 00:33:48,950 INFO L280 TraceCheckUtils]: 33: Hoare triple {668#false} #res := #t~ret2; {668#false} is VALID [2020-07-11 00:33:48,951 INFO L280 TraceCheckUtils]: 34: Hoare triple {668#false} havoc #t~ret1; {668#false} is VALID [2020-07-11 00:33:48,951 INFO L280 TraceCheckUtils]: 35: Hoare triple {668#false} havoc #t~ret2; {668#false} is VALID [2020-07-11 00:33:48,951 INFO L280 TraceCheckUtils]: 36: Hoare triple {668#false} assume true; {668#false} is VALID [2020-07-11 00:33:48,951 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {668#false} {667#true} #67#return; {668#false} is VALID [2020-07-11 00:33:48,951 INFO L280 TraceCheckUtils]: 38: Hoare triple {668#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {668#false} is VALID [2020-07-11 00:33:48,952 INFO L280 TraceCheckUtils]: 39: Hoare triple {668#false} ~result~0 := #t~ret5; {668#false} is VALID [2020-07-11 00:33:48,952 INFO L280 TraceCheckUtils]: 40: Hoare triple {668#false} havoc #t~ret5; {668#false} is VALID [2020-07-11 00:33:48,952 INFO L280 TraceCheckUtils]: 41: Hoare triple {668#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {668#false} is VALID [2020-07-11 00:33:48,953 INFO L280 TraceCheckUtils]: 42: Hoare triple {668#false} assume !false; {668#false} is VALID [2020-07-11 00:33:48,955 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-11 00:33:48,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [585251755] [2020-07-11 00:33:48,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:48,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-11 00:33:48,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066405561] [2020-07-11 00:33:48,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-11 00:33:48,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:48,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:33:49,004 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-11 00:33:49,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:33:49,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:49,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:33:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:33:49,006 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2020-07-11 00:33:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:49,353 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2020-07-11 00:33:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:33:49,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-11 00:33:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:33:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-11 00:33:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:33:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-11 00:33:49,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2020-07-11 00:33:49,458 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-11 00:33:49,462 INFO L225 Difference]: With dead ends: 73 [2020-07-11 00:33:49,463 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 00:33:49,464 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-11 00:33:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 00:33:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-11 00:33:49,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:49,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-11 00:33:49,538 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-11 00:33:49,538 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-11 00:33:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:49,543 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-11 00:33:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-11 00:33:49,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:49,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:49,544 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-11 00:33:49,544 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-11 00:33:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:49,554 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-11 00:33:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-11 00:33:49,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:49,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:49,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:49,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-11 00:33:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-11 00:33:49,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 43 [2020-07-11 00:33:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:49,559 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-11 00:33:49,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:33:49,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2020-07-11 00:33:49,634 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-11 00:33:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-11 00:33:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-11 00:33:49,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:49,636 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-11 00:33:49,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:49,637 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-07-11 00:33:49,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:49,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [389819571] [2020-07-11 00:33:49,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} assume true; {1040#true} is VALID [2020-07-11 00:33:49,723 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1040#true} {1040#true} #57#return; {1040#true} is VALID [2020-07-11 00:33:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,866 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-11 00:33:49,867 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-11 00:33:49,868 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-11 00:33:49,869 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-11 00:33:49,870 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-11 00:33:49,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-11 00:33:49,871 INFO L280 TraceCheckUtils]: 2: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-11 00:33:49,871 INFO L280 TraceCheckUtils]: 3: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-11 00:33:49,871 INFO L263 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-11 00:33:49,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,873 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-11 00:33:49,873 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-11 00:33:49,874 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-11 00:33:49,875 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-11 00:33:49,876 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-11 00:33:49,876 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-11 00:33:49,880 INFO L280 TraceCheckUtils]: 12: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,881 INFO L280 TraceCheckUtils]: 13: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,881 INFO L280 TraceCheckUtils]: 14: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,882 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,923 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-11 00:33:49,924 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-11 00:33:49,925 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-11 00:33:49,926 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-11 00:33:49,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-11 00:33:49,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-11 00:33:49,927 INFO L280 TraceCheckUtils]: 3: Hoare triple {1040#true} assume !(0 == ~n); {1040#true} is VALID [2020-07-11 00:33:49,928 INFO L263 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret1 := ackermann(~m, ~n - 1); {1040#true} is VALID [2020-07-11 00:33:49,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,928 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-11 00:33:49,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-11 00:33:49,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-11 00:33:49,929 INFO L263 TraceCheckUtils]: 9: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-11 00:33:49,929 INFO L280 TraceCheckUtils]: 10: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,931 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-11 00:33:49,932 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-11 00:33:49,933 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-11 00:33:49,934 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-11 00:33:49,935 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-11 00:33:49,936 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-11 00:33:49,937 INFO L280 TraceCheckUtils]: 17: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,937 INFO L280 TraceCheckUtils]: 18: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,938 INFO L280 TraceCheckUtils]: 19: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,939 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:49,940 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-11 00:33:49,940 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-11 00:33:49,940 INFO L280 TraceCheckUtils]: 23: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,941 INFO L280 TraceCheckUtils]: 24: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,941 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-11 00:33:49,942 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-11 00:33:49,943 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-11 00:33:49,945 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-11 00:33:49,946 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-11 00:33:49,947 INFO L280 TraceCheckUtils]: 30: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,947 INFO L280 TraceCheckUtils]: 31: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret1; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,948 INFO L280 TraceCheckUtils]: 32: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,949 INFO L280 TraceCheckUtils]: 33: Hoare triple {1105#(<= 3 |ackermann_#res|)} assume true; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,950 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1105#(<= 3 |ackermann_#res|)} {1040#true} #67#return; {1079#(<= 3 |main_#t~ret5|)} is VALID [2020-07-11 00:33:49,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {1040#true} call ULTIMATE.init(); {1040#true} is VALID [2020-07-11 00:33:49,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} assume true; {1040#true} is VALID [2020-07-11 00:33:49,953 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1040#true} {1040#true} #57#return; {1040#true} is VALID [2020-07-11 00:33:49,954 INFO L263 TraceCheckUtils]: 3: Hoare triple {1040#true} call #t~ret6 := main(); {1040#true} is VALID [2020-07-11 00:33:49,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {1040#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1040#true} is VALID [2020-07-11 00:33:49,954 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m~0 := #t~nondet3; {1040#true} is VALID [2020-07-11 00:33:49,954 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#true} havoc #t~nondet3; {1040#true} is VALID [2020-07-11 00:33:49,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {1040#true} assume !(~m~0 < 0 || ~m~0 > 3); {1040#true} is VALID [2020-07-11 00:33:49,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {1040#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1040#true} is VALID [2020-07-11 00:33:49,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {1040#true} ~n~0 := #t~nondet4; {1040#true} is VALID [2020-07-11 00:33:49,956 INFO L280 TraceCheckUtils]: 10: Hoare triple {1040#true} havoc #t~nondet4; {1040#true} is VALID [2020-07-11 00:33:49,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#true} assume !(~n~0 < 0 || ~n~0 > 23); {1040#true} is VALID [2020-07-11 00:33:49,956 INFO L263 TraceCheckUtils]: 12: Hoare triple {1040#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1040#true} is VALID [2020-07-11 00:33:49,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,957 INFO L280 TraceCheckUtils]: 14: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-11 00:33:49,957 INFO L280 TraceCheckUtils]: 15: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-11 00:33:49,957 INFO L280 TraceCheckUtils]: 16: Hoare triple {1040#true} assume !(0 == ~n); {1040#true} is VALID [2020-07-11 00:33:49,958 INFO L263 TraceCheckUtils]: 17: Hoare triple {1040#true} call #t~ret1 := ackermann(~m, ~n - 1); {1040#true} is VALID [2020-07-11 00:33:49,958 INFO L280 TraceCheckUtils]: 18: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,958 INFO L280 TraceCheckUtils]: 19: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-11 00:33:49,958 INFO L280 TraceCheckUtils]: 20: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-11 00:33:49,959 INFO L280 TraceCheckUtils]: 21: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-11 00:33:49,959 INFO L263 TraceCheckUtils]: 22: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-11 00:33:49,959 INFO L280 TraceCheckUtils]: 23: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,962 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-11 00:33:49,964 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-11 00:33:49,965 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-11 00:33:49,965 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-11 00:33:49,967 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-11 00:33:49,968 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-11 00:33:49,969 INFO L280 TraceCheckUtils]: 30: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,972 INFO L280 TraceCheckUtils]: 31: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,976 INFO L280 TraceCheckUtils]: 32: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,978 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:49,979 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-11 00:33:49,979 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-11 00:33:49,980 INFO L280 TraceCheckUtils]: 36: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-11 00:33:49,980 INFO L280 TraceCheckUtils]: 37: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,981 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-11 00:33:49,982 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-11 00:33:49,982 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-11 00:33:49,984 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-11 00:33:49,984 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-11 00:33:49,985 INFO L280 TraceCheckUtils]: 43: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,986 INFO L280 TraceCheckUtils]: 44: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret1; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,987 INFO L280 TraceCheckUtils]: 45: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,987 INFO L280 TraceCheckUtils]: 46: Hoare triple {1105#(<= 3 |ackermann_#res|)} assume true; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:49,989 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1105#(<= 3 |ackermann_#res|)} {1040#true} #67#return; {1079#(<= 3 |main_#t~ret5|)} is VALID [2020-07-11 00:33:49,989 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-11 00:33:49,990 INFO L280 TraceCheckUtils]: 49: Hoare triple {1079#(<= 3 |main_#t~ret5|)} ~result~0 := #t~ret5; {1080#(<= 3 main_~result~0)} is VALID [2020-07-11 00:33:49,991 INFO L280 TraceCheckUtils]: 50: Hoare triple {1080#(<= 3 main_~result~0)} havoc #t~ret5; {1080#(<= 3 main_~result~0)} is VALID [2020-07-11 00:33:49,992 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-11 00:33:49,993 INFO L280 TraceCheckUtils]: 52: Hoare triple {1041#false} assume !false; {1041#false} is VALID [2020-07-11 00:33:49,996 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-11 00:33:49,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [389819571] [2020-07-11 00:33:49,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:49,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 00:33:49,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455450438] [2020-07-11 00:33:49,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-07-11 00:33:49,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:49,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 00:33:50,054 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-11 00:33:50,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 00:33:50,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:50,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 00:33:50,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-11 00:33:50,056 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 13 states. [2020-07-11 00:33:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:52,198 INFO L93 Difference]: Finished difference Result 87 states and 120 transitions. [2020-07-11 00:33:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 00:33:52,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-07-11 00:33:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 00:33:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 109 transitions. [2020-07-11 00:33:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 00:33:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 109 transitions. [2020-07-11 00:33:52,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 109 transitions. [2020-07-11 00:33:52,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:52,356 INFO L225 Difference]: With dead ends: 87 [2020-07-11 00:33:52,356 INFO L226 Difference]: Without dead ends: 81 [2020-07-11 00:33:52,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2020-07-11 00:33:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-11 00:33:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2020-07-11 00:33:52,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:52,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 57 states. [2020-07-11 00:33:52,494 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 57 states. [2020-07-11 00:33:52,495 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 57 states. [2020-07-11 00:33:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:52,503 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2020-07-11 00:33:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2020-07-11 00:33:52,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:52,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:52,505 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 81 states. [2020-07-11 00:33:52,505 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 81 states. [2020-07-11 00:33:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:52,513 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2020-07-11 00:33:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2020-07-11 00:33:52,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:52,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:52,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:52,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-11 00:33:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2020-07-11 00:33:52,520 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 53 [2020-07-11 00:33:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:52,520 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2020-07-11 00:33:52,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 00:33:52,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 74 transitions. [2020-07-11 00:33:52,646 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-11 00:33:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2020-07-11 00:33:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-11 00:33:52,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:52,650 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-11 00:33:52,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:33:52,650 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:52,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash 358541405, now seen corresponding path program 2 times [2020-07-11 00:33:52,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:52,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398129854] [2020-07-11 00:33:52,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:52,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} assume true; {1601#true} is VALID [2020-07-11 00:33:52,699 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1601#true} {1601#true} #57#return; {1601#true} is VALID [2020-07-11 00:33:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:52,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,781 INFO L280 TraceCheckUtils]: 2: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,782 INFO L280 TraceCheckUtils]: 3: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,784 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,787 INFO L263 TraceCheckUtils]: 4: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-11 00:33:52,787 INFO L280 TraceCheckUtils]: 5: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,789 INFO L280 TraceCheckUtils]: 7: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,790 INFO L280 TraceCheckUtils]: 8: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,791 INFO L280 TraceCheckUtils]: 9: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,795 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,796 INFO L280 TraceCheckUtils]: 11: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {1690#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {1690#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume true; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,799 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1690#(<= |ackermann_#in~m| 1)} {1601#true} #63#return; {1666#(<= ackermann_~m 1)} is VALID [2020-07-11 00:33:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:52,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,845 INFO L280 TraceCheckUtils]: 3: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,847 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,850 INFO L280 TraceCheckUtils]: 2: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,851 INFO L280 TraceCheckUtils]: 3: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,851 INFO L263 TraceCheckUtils]: 4: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-11 00:33:52,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,853 INFO L280 TraceCheckUtils]: 7: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,854 INFO L280 TraceCheckUtils]: 8: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,855 INFO L280 TraceCheckUtils]: 9: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,857 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,858 INFO L280 TraceCheckUtils]: 12: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,859 INFO L280 TraceCheckUtils]: 13: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,860 INFO L280 TraceCheckUtils]: 14: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume true; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,862 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1698#(<= 1 |ackermann_#in~m|)} {1666#(<= ackermann_~m 1)} #65#return; {1602#false} is VALID [2020-07-11 00:33:52,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1601#true} is VALID [2020-07-11 00:33:52,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {1601#true} ~n := #in~n; {1601#true} is VALID [2020-07-11 00:33:52,863 INFO L280 TraceCheckUtils]: 2: Hoare triple {1601#true} assume !(0 == ~m); {1601#true} is VALID [2020-07-11 00:33:52,863 INFO L280 TraceCheckUtils]: 3: Hoare triple {1601#true} assume !(0 == ~n); {1601#true} is VALID [2020-07-11 00:33:52,864 INFO L263 TraceCheckUtils]: 4: Hoare triple {1601#true} call #t~ret1 := ackermann(~m, ~n - 1); {1601#true} is VALID [2020-07-11 00:33:52,865 INFO L280 TraceCheckUtils]: 5: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,865 INFO L280 TraceCheckUtils]: 6: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,867 INFO L280 TraceCheckUtils]: 8: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,867 INFO L263 TraceCheckUtils]: 9: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-11 00:33:52,868 INFO L280 TraceCheckUtils]: 10: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,869 INFO L280 TraceCheckUtils]: 11: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,870 INFO L280 TraceCheckUtils]: 12: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,871 INFO L280 TraceCheckUtils]: 13: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,871 INFO L280 TraceCheckUtils]: 14: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,873 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,874 INFO L280 TraceCheckUtils]: 17: Hoare triple {1690#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,875 INFO L280 TraceCheckUtils]: 18: Hoare triple {1690#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,876 INFO L280 TraceCheckUtils]: 19: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume true; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,877 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1690#(<= |ackermann_#in~m| 1)} {1601#true} #63#return; {1666#(<= ackermann_~m 1)} is VALID [2020-07-11 00:33:52,878 INFO L280 TraceCheckUtils]: 21: Hoare triple {1666#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1666#(<= ackermann_~m 1)} is VALID [2020-07-11 00:33:52,879 INFO L263 TraceCheckUtils]: 22: Hoare triple {1666#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1601#true} is VALID [2020-07-11 00:33:52,879 INFO L280 TraceCheckUtils]: 23: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,880 INFO L280 TraceCheckUtils]: 24: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,881 INFO L280 TraceCheckUtils]: 25: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,882 INFO L280 TraceCheckUtils]: 26: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,882 INFO L263 TraceCheckUtils]: 27: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-11 00:33:52,883 INFO L280 TraceCheckUtils]: 28: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,884 INFO L280 TraceCheckUtils]: 29: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,885 INFO L280 TraceCheckUtils]: 30: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,886 INFO L280 TraceCheckUtils]: 31: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,886 INFO L280 TraceCheckUtils]: 32: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,888 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,889 INFO L280 TraceCheckUtils]: 34: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,889 INFO L280 TraceCheckUtils]: 35: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,890 INFO L280 TraceCheckUtils]: 36: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,891 INFO L280 TraceCheckUtils]: 37: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume true; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,893 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1698#(<= 1 |ackermann_#in~m|)} {1666#(<= ackermann_~m 1)} #65#return; {1602#false} is VALID [2020-07-11 00:33:52,893 INFO L280 TraceCheckUtils]: 39: Hoare triple {1602#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1602#false} is VALID [2020-07-11 00:33:52,893 INFO L280 TraceCheckUtils]: 40: Hoare triple {1602#false} #res := #t~ret2; {1602#false} is VALID [2020-07-11 00:33:52,894 INFO L280 TraceCheckUtils]: 41: Hoare triple {1602#false} havoc #t~ret1; {1602#false} is VALID [2020-07-11 00:33:52,894 INFO L280 TraceCheckUtils]: 42: Hoare triple {1602#false} havoc #t~ret2; {1602#false} is VALID [2020-07-11 00:33:52,894 INFO L280 TraceCheckUtils]: 43: Hoare triple {1602#false} assume true; {1602#false} is VALID [2020-07-11 00:33:52,895 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1602#false} {1601#true} #67#return; {1602#false} is VALID [2020-07-11 00:33:52,911 INFO L263 TraceCheckUtils]: 0: Hoare triple {1601#true} call ULTIMATE.init(); {1601#true} is VALID [2020-07-11 00:33:52,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {1601#true} assume true; {1601#true} is VALID [2020-07-11 00:33:52,912 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1601#true} {1601#true} #57#return; {1601#true} is VALID [2020-07-11 00:33:52,912 INFO L263 TraceCheckUtils]: 3: Hoare triple {1601#true} call #t~ret6 := main(); {1601#true} is VALID [2020-07-11 00:33:52,912 INFO L280 TraceCheckUtils]: 4: Hoare triple {1601#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1601#true} is VALID [2020-07-11 00:33:52,912 INFO L280 TraceCheckUtils]: 5: Hoare triple {1601#true} ~m~0 := #t~nondet3; {1601#true} is VALID [2020-07-11 00:33:52,913 INFO L280 TraceCheckUtils]: 6: Hoare triple {1601#true} havoc #t~nondet3; {1601#true} is VALID [2020-07-11 00:33:52,913 INFO L280 TraceCheckUtils]: 7: Hoare triple {1601#true} assume !(~m~0 < 0 || ~m~0 > 3); {1601#true} is VALID [2020-07-11 00:33:52,913 INFO L280 TraceCheckUtils]: 8: Hoare triple {1601#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1601#true} is VALID [2020-07-11 00:33:52,913 INFO L280 TraceCheckUtils]: 9: Hoare triple {1601#true} ~n~0 := #t~nondet4; {1601#true} is VALID [2020-07-11 00:33:52,914 INFO L280 TraceCheckUtils]: 10: Hoare triple {1601#true} havoc #t~nondet4; {1601#true} is VALID [2020-07-11 00:33:52,914 INFO L280 TraceCheckUtils]: 11: Hoare triple {1601#true} assume !(~n~0 < 0 || ~n~0 > 23); {1601#true} is VALID [2020-07-11 00:33:52,914 INFO L263 TraceCheckUtils]: 12: Hoare triple {1601#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1601#true} is VALID [2020-07-11 00:33:52,914 INFO L280 TraceCheckUtils]: 13: Hoare triple {1601#true} ~m := #in~m; {1601#true} is VALID [2020-07-11 00:33:52,915 INFO L280 TraceCheckUtils]: 14: Hoare triple {1601#true} ~n := #in~n; {1601#true} is VALID [2020-07-11 00:33:52,915 INFO L280 TraceCheckUtils]: 15: Hoare triple {1601#true} assume !(0 == ~m); {1601#true} is VALID [2020-07-11 00:33:52,915 INFO L280 TraceCheckUtils]: 16: Hoare triple {1601#true} assume !(0 == ~n); {1601#true} is VALID [2020-07-11 00:33:52,915 INFO L263 TraceCheckUtils]: 17: Hoare triple {1601#true} call #t~ret1 := ackermann(~m, ~n - 1); {1601#true} is VALID [2020-07-11 00:33:52,916 INFO L280 TraceCheckUtils]: 18: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,918 INFO L280 TraceCheckUtils]: 19: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,919 INFO L280 TraceCheckUtils]: 20: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,920 INFO L280 TraceCheckUtils]: 21: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,920 INFO L263 TraceCheckUtils]: 22: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-11 00:33:52,921 INFO L280 TraceCheckUtils]: 23: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,922 INFO L280 TraceCheckUtils]: 24: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,923 INFO L280 TraceCheckUtils]: 25: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,924 INFO L280 TraceCheckUtils]: 26: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,925 INFO L280 TraceCheckUtils]: 27: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,928 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,929 INFO L280 TraceCheckUtils]: 29: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,930 INFO L280 TraceCheckUtils]: 30: Hoare triple {1690#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,931 INFO L280 TraceCheckUtils]: 31: Hoare triple {1690#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,932 INFO L280 TraceCheckUtils]: 32: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume true; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:52,933 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1690#(<= |ackermann_#in~m| 1)} {1601#true} #63#return; {1666#(<= ackermann_~m 1)} is VALID [2020-07-11 00:33:52,934 INFO L280 TraceCheckUtils]: 34: Hoare triple {1666#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1666#(<= ackermann_~m 1)} is VALID [2020-07-11 00:33:52,935 INFO L263 TraceCheckUtils]: 35: Hoare triple {1666#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1601#true} is VALID [2020-07-11 00:33:52,935 INFO L280 TraceCheckUtils]: 36: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,936 INFO L280 TraceCheckUtils]: 37: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,937 INFO L280 TraceCheckUtils]: 38: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,938 INFO L280 TraceCheckUtils]: 39: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,938 INFO L263 TraceCheckUtils]: 40: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-11 00:33:52,939 INFO L280 TraceCheckUtils]: 41: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,940 INFO L280 TraceCheckUtils]: 42: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,941 INFO L280 TraceCheckUtils]: 43: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,941 INFO L280 TraceCheckUtils]: 44: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,942 INFO L280 TraceCheckUtils]: 45: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,943 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,944 INFO L280 TraceCheckUtils]: 47: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,944 INFO L280 TraceCheckUtils]: 48: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,945 INFO L280 TraceCheckUtils]: 49: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,946 INFO L280 TraceCheckUtils]: 50: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume true; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:52,947 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1698#(<= 1 |ackermann_#in~m|)} {1666#(<= ackermann_~m 1)} #65#return; {1602#false} is VALID [2020-07-11 00:33:52,947 INFO L280 TraceCheckUtils]: 52: Hoare triple {1602#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1602#false} is VALID [2020-07-11 00:33:52,947 INFO L280 TraceCheckUtils]: 53: Hoare triple {1602#false} #res := #t~ret2; {1602#false} is VALID [2020-07-11 00:33:52,948 INFO L280 TraceCheckUtils]: 54: Hoare triple {1602#false} havoc #t~ret1; {1602#false} is VALID [2020-07-11 00:33:52,948 INFO L280 TraceCheckUtils]: 55: Hoare triple {1602#false} havoc #t~ret2; {1602#false} is VALID [2020-07-11 00:33:52,949 INFO L280 TraceCheckUtils]: 56: Hoare triple {1602#false} assume true; {1602#false} is VALID [2020-07-11 00:33:52,949 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {1602#false} {1601#true} #67#return; {1602#false} is VALID [2020-07-11 00:33:52,949 INFO L280 TraceCheckUtils]: 58: Hoare triple {1602#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1602#false} is VALID [2020-07-11 00:33:52,950 INFO L280 TraceCheckUtils]: 59: Hoare triple {1602#false} ~result~0 := #t~ret5; {1602#false} is VALID [2020-07-11 00:33:52,950 INFO L280 TraceCheckUtils]: 60: Hoare triple {1602#false} havoc #t~ret5; {1602#false} is VALID [2020-07-11 00:33:52,950 INFO L280 TraceCheckUtils]: 61: Hoare triple {1602#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1602#false} is VALID [2020-07-11 00:33:52,950 INFO L280 TraceCheckUtils]: 62: Hoare triple {1602#false} assume !false; {1602#false} is VALID [2020-07-11 00:33:52,956 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-11 00:33:52,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398129854] [2020-07-11 00:33:52,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:52,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:33:52,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495029108] [2020-07-11 00:33:52,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-07-11 00:33:52,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:52,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:33:53,018 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-11 00:33:53,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:33:53,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:53,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:33:53,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:33:53,019 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 7 states. [2020-07-11 00:33:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:53,629 INFO L93 Difference]: Finished difference Result 125 states and 192 transitions. [2020-07-11 00:33:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:33:53,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-07-11 00:33:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:33:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2020-07-11 00:33:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:33:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2020-07-11 00:33:53,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2020-07-11 00:33:53,792 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-11 00:33:53,797 INFO L225 Difference]: With dead ends: 125 [2020-07-11 00:33:53,797 INFO L226 Difference]: Without dead ends: 81 [2020-07-11 00:33:53,800 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-11 00:33:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-11 00:33:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-11 00:33:54,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:54,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:54,073 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:54,073 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:54,079 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2020-07-11 00:33:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-11 00:33:54,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:54,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:54,081 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:54,081 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:54,087 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2020-07-11 00:33:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-11 00:33:54,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:54,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:54,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:54,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-11 00:33:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2020-07-11 00:33:54,095 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 63 [2020-07-11 00:33:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:54,095 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2020-07-11 00:33:54,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:33:54,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 110 transitions. [2020-07-11 00:33:54,303 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-11 00:33:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-11 00:33:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-11 00:33:54,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:54,305 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-11 00:33:54,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:33:54,306 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:54,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1096450289, now seen corresponding path program 3 times [2020-07-11 00:33:54,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:54,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [832031210] [2020-07-11 00:33:54,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:54,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} assume true; {2282#true} is VALID [2020-07-11 00:33:54,354 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2282#true} {2282#true} #57#return; {2282#true} is VALID [2020-07-11 00:33:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:54,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,534 INFO L280 TraceCheckUtils]: 4: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,535 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,536 INFO L280 TraceCheckUtils]: 3: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-11 00:33:54,536 INFO L263 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-11 00:33:54,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,540 INFO L280 TraceCheckUtils]: 9: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,541 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,543 INFO L280 TraceCheckUtils]: 13: Hoare triple {2401#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,543 INFO L280 TraceCheckUtils]: 14: Hoare triple {2401#(<= 2 |ackermann_#res|)} assume true; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,545 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2401#(<= 2 |ackermann_#res|)} {2282#true} #63#return; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:54,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:54,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:54,586 INFO L280 TraceCheckUtils]: 3: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:54,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:54,588 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2386#(<= 2 |ackermann_#t~ret1|)} #65#return; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:54,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,589 INFO L280 TraceCheckUtils]: 3: Hoare triple {2282#true} assume !(0 == ~n); {2282#true} is VALID [2020-07-11 00:33:54,590 INFO L263 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret1 := ackermann(~m, ~n - 1); {2282#true} is VALID [2020-07-11 00:33:54,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,590 INFO L280 TraceCheckUtils]: 6: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,590 INFO L280 TraceCheckUtils]: 7: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,591 INFO L280 TraceCheckUtils]: 8: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-11 00:33:54,591 INFO L263 TraceCheckUtils]: 9: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-11 00:33:54,591 INFO L280 TraceCheckUtils]: 10: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,592 INFO L280 TraceCheckUtils]: 11: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,593 INFO L280 TraceCheckUtils]: 12: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,593 INFO L280 TraceCheckUtils]: 13: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,594 INFO L280 TraceCheckUtils]: 14: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,595 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,596 INFO L280 TraceCheckUtils]: 16: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,596 INFO L280 TraceCheckUtils]: 17: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,597 INFO L280 TraceCheckUtils]: 18: Hoare triple {2401#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,597 INFO L280 TraceCheckUtils]: 19: Hoare triple {2401#(<= 2 |ackermann_#res|)} assume true; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,598 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2401#(<= 2 |ackermann_#res|)} {2282#true} #63#return; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:54,599 INFO L280 TraceCheckUtils]: 21: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:54,599 INFO L263 TraceCheckUtils]: 22: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2282#true} is VALID [2020-07-11 00:33:54,600 INFO L280 TraceCheckUtils]: 23: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,600 INFO L280 TraceCheckUtils]: 24: Hoare triple {2282#true} ~n := #in~n; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:54,601 INFO L280 TraceCheckUtils]: 25: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:54,602 INFO L280 TraceCheckUtils]: 26: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:54,602 INFO L280 TraceCheckUtils]: 27: Hoare triple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:54,604 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2386#(<= 2 |ackermann_#t~ret1|)} #65#return; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:54,605 INFO L280 TraceCheckUtils]: 29: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:54,605 INFO L280 TraceCheckUtils]: 30: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,606 INFO L280 TraceCheckUtils]: 31: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,607 INFO L280 TraceCheckUtils]: 32: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,607 INFO L280 TraceCheckUtils]: 33: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,609 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #61#return; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,611 INFO L280 TraceCheckUtils]: 3: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-11 00:33:54,611 INFO L263 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-11 00:33:54,611 INFO L280 TraceCheckUtils]: 5: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,612 INFO L280 TraceCheckUtils]: 6: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,612 INFO L280 TraceCheckUtils]: 7: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,612 INFO L280 TraceCheckUtils]: 8: Hoare triple {2282#true} assume !(0 == ~n); {2282#true} is VALID [2020-07-11 00:33:54,612 INFO L263 TraceCheckUtils]: 9: Hoare triple {2282#true} call #t~ret1 := ackermann(~m, ~n - 1); {2282#true} is VALID [2020-07-11 00:33:54,613 INFO L280 TraceCheckUtils]: 10: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,613 INFO L280 TraceCheckUtils]: 11: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,613 INFO L280 TraceCheckUtils]: 12: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,613 INFO L280 TraceCheckUtils]: 13: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-11 00:33:54,613 INFO L263 TraceCheckUtils]: 14: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-11 00:33:54,614 INFO L280 TraceCheckUtils]: 15: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,614 INFO L280 TraceCheckUtils]: 16: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,615 INFO L280 TraceCheckUtils]: 17: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,616 INFO L280 TraceCheckUtils]: 18: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,616 INFO L280 TraceCheckUtils]: 19: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,618 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,618 INFO L280 TraceCheckUtils]: 21: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,619 INFO L280 TraceCheckUtils]: 22: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,619 INFO L280 TraceCheckUtils]: 23: Hoare triple {2401#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,620 INFO L280 TraceCheckUtils]: 24: Hoare triple {2401#(<= 2 |ackermann_#res|)} assume true; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,621 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2401#(<= 2 |ackermann_#res|)} {2282#true} #63#return; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:54,622 INFO L280 TraceCheckUtils]: 26: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:54,622 INFO L263 TraceCheckUtils]: 27: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2282#true} is VALID [2020-07-11 00:33:54,622 INFO L280 TraceCheckUtils]: 28: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,622 INFO L280 TraceCheckUtils]: 29: Hoare triple {2282#true} ~n := #in~n; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:54,623 INFO L280 TraceCheckUtils]: 30: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:54,624 INFO L280 TraceCheckUtils]: 31: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:54,624 INFO L280 TraceCheckUtils]: 32: Hoare triple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:54,626 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2386#(<= 2 |ackermann_#t~ret1|)} #65#return; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:54,626 INFO L280 TraceCheckUtils]: 34: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:54,627 INFO L280 TraceCheckUtils]: 35: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,628 INFO L280 TraceCheckUtils]: 36: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,629 INFO L280 TraceCheckUtils]: 37: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,629 INFO L280 TraceCheckUtils]: 38: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,630 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #61#return; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,631 INFO L280 TraceCheckUtils]: 40: Hoare triple {2368#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,632 INFO L280 TraceCheckUtils]: 41: Hoare triple {2368#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,633 INFO L280 TraceCheckUtils]: 42: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret0; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,633 INFO L280 TraceCheckUtils]: 43: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,634 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #67#return; {2331#(<= 3 |main_#t~ret5|)} is VALID [2020-07-11 00:33:54,637 INFO L263 TraceCheckUtils]: 0: Hoare triple {2282#true} call ULTIMATE.init(); {2282#true} is VALID [2020-07-11 00:33:54,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} assume true; {2282#true} is VALID [2020-07-11 00:33:54,637 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2282#true} {2282#true} #57#return; {2282#true} is VALID [2020-07-11 00:33:54,637 INFO L263 TraceCheckUtils]: 3: Hoare triple {2282#true} call #t~ret6 := main(); {2282#true} is VALID [2020-07-11 00:33:54,638 INFO L280 TraceCheckUtils]: 4: Hoare triple {2282#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2282#true} is VALID [2020-07-11 00:33:54,638 INFO L280 TraceCheckUtils]: 5: Hoare triple {2282#true} ~m~0 := #t~nondet3; {2282#true} is VALID [2020-07-11 00:33:54,638 INFO L280 TraceCheckUtils]: 6: Hoare triple {2282#true} havoc #t~nondet3; {2282#true} is VALID [2020-07-11 00:33:54,638 INFO L280 TraceCheckUtils]: 7: Hoare triple {2282#true} assume !(~m~0 < 0 || ~m~0 > 3); {2282#true} is VALID [2020-07-11 00:33:54,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {2282#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2282#true} is VALID [2020-07-11 00:33:54,638 INFO L280 TraceCheckUtils]: 9: Hoare triple {2282#true} ~n~0 := #t~nondet4; {2282#true} is VALID [2020-07-11 00:33:54,639 INFO L280 TraceCheckUtils]: 10: Hoare triple {2282#true} havoc #t~nondet4; {2282#true} is VALID [2020-07-11 00:33:54,639 INFO L280 TraceCheckUtils]: 11: Hoare triple {2282#true} assume !(~n~0 < 0 || ~n~0 > 23); {2282#true} is VALID [2020-07-11 00:33:54,639 INFO L263 TraceCheckUtils]: 12: Hoare triple {2282#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2282#true} is VALID [2020-07-11 00:33:54,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,639 INFO L280 TraceCheckUtils]: 14: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,639 INFO L280 TraceCheckUtils]: 15: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,640 INFO L280 TraceCheckUtils]: 16: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-11 00:33:54,640 INFO L263 TraceCheckUtils]: 17: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-11 00:33:54,640 INFO L280 TraceCheckUtils]: 18: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,640 INFO L280 TraceCheckUtils]: 19: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,640 INFO L280 TraceCheckUtils]: 20: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,641 INFO L280 TraceCheckUtils]: 21: Hoare triple {2282#true} assume !(0 == ~n); {2282#true} is VALID [2020-07-11 00:33:54,641 INFO L263 TraceCheckUtils]: 22: Hoare triple {2282#true} call #t~ret1 := ackermann(~m, ~n - 1); {2282#true} is VALID [2020-07-11 00:33:54,641 INFO L280 TraceCheckUtils]: 23: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,641 INFO L280 TraceCheckUtils]: 24: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-11 00:33:54,641 INFO L280 TraceCheckUtils]: 25: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-11 00:33:54,641 INFO L280 TraceCheckUtils]: 26: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-11 00:33:54,642 INFO L263 TraceCheckUtils]: 27: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-11 00:33:54,642 INFO L280 TraceCheckUtils]: 28: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,643 INFO L280 TraceCheckUtils]: 29: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,643 INFO L280 TraceCheckUtils]: 30: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:54,644 INFO L280 TraceCheckUtils]: 31: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,645 INFO L280 TraceCheckUtils]: 32: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:54,646 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,646 INFO L280 TraceCheckUtils]: 34: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,647 INFO L280 TraceCheckUtils]: 35: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,648 INFO L280 TraceCheckUtils]: 36: Hoare triple {2401#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,648 INFO L280 TraceCheckUtils]: 37: Hoare triple {2401#(<= 2 |ackermann_#res|)} assume true; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,649 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2401#(<= 2 |ackermann_#res|)} {2282#true} #63#return; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:54,650 INFO L280 TraceCheckUtils]: 39: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:54,650 INFO L263 TraceCheckUtils]: 40: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2282#true} is VALID [2020-07-11 00:33:54,650 INFO L280 TraceCheckUtils]: 41: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-11 00:33:54,651 INFO L280 TraceCheckUtils]: 42: Hoare triple {2282#true} ~n := #in~n; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:54,651 INFO L280 TraceCheckUtils]: 43: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:54,652 INFO L280 TraceCheckUtils]: 44: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:54,653 INFO L280 TraceCheckUtils]: 45: Hoare triple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:54,654 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2386#(<= 2 |ackermann_#t~ret1|)} #65#return; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:54,655 INFO L280 TraceCheckUtils]: 47: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:54,655 INFO L280 TraceCheckUtils]: 48: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,656 INFO L280 TraceCheckUtils]: 49: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,656 INFO L280 TraceCheckUtils]: 50: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,657 INFO L280 TraceCheckUtils]: 51: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,658 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #61#return; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,658 INFO L280 TraceCheckUtils]: 53: Hoare triple {2368#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:54,659 INFO L280 TraceCheckUtils]: 54: Hoare triple {2368#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,659 INFO L280 TraceCheckUtils]: 55: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret0; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,660 INFO L280 TraceCheckUtils]: 56: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:54,661 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #67#return; {2331#(<= 3 |main_#t~ret5|)} is VALID [2020-07-11 00:33:54,661 INFO L280 TraceCheckUtils]: 58: Hoare triple {2331#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2331#(<= 3 |main_#t~ret5|)} is VALID [2020-07-11 00:33:54,662 INFO L280 TraceCheckUtils]: 59: Hoare triple {2331#(<= 3 |main_#t~ret5|)} ~result~0 := #t~ret5; {2332#(<= 3 main_~result~0)} is VALID [2020-07-11 00:33:54,662 INFO L280 TraceCheckUtils]: 60: Hoare triple {2332#(<= 3 main_~result~0)} havoc #t~ret5; {2332#(<= 3 main_~result~0)} is VALID [2020-07-11 00:33:54,663 INFO L280 TraceCheckUtils]: 61: Hoare triple {2332#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2283#false} is VALID [2020-07-11 00:33:54,663 INFO L280 TraceCheckUtils]: 62: Hoare triple {2283#false} assume !false; {2283#false} is VALID [2020-07-11 00:33:54,667 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-11 00:33:54,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [832031210] [2020-07-11 00:33:54,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:54,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-11 00:33:54,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741321599] [2020-07-11 00:33:54,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-07-11 00:33:54,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:54,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 00:33:54,735 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-11 00:33:54,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 00:33:54,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 00:33:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-11 00:33:54,737 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand 14 states. [2020-07-11 00:33:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:56,983 INFO L93 Difference]: Finished difference Result 154 states and 245 transitions. [2020-07-11 00:33:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-11 00:33:56,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-07-11 00:33:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 00:33:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 111 transitions. [2020-07-11 00:33:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 00:33:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 111 transitions. [2020-07-11 00:33:56,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 111 transitions. [2020-07-11 00:33:57,132 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-11 00:33:57,142 INFO L225 Difference]: With dead ends: 154 [2020-07-11 00:33:57,142 INFO L226 Difference]: Without dead ends: 148 [2020-07-11 00:33:57,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2020-07-11 00:33:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-07-11 00:33:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 79. [2020-07-11 00:33:57,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:57,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 79 states. [2020-07-11 00:33:57,382 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 79 states. [2020-07-11 00:33:57,383 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 79 states. [2020-07-11 00:33:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:57,396 INFO L93 Difference]: Finished difference Result 148 states and 237 transitions. [2020-07-11 00:33:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 237 transitions. [2020-07-11 00:33:57,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:57,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:57,399 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 148 states. [2020-07-11 00:33:57,399 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 148 states. [2020-07-11 00:33:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:57,412 INFO L93 Difference]: Finished difference Result 148 states and 237 transitions. [2020-07-11 00:33:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 237 transitions. [2020-07-11 00:33:57,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:57,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:57,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:57,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-11 00:33:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2020-07-11 00:33:57,420 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 63 [2020-07-11 00:33:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:57,420 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2020-07-11 00:33:57,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 00:33:57,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 104 transitions. [2020-07-11 00:33:57,662 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-11 00:33:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2020-07-11 00:33:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-11 00:33:57,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:57,664 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-11 00:33:57,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:33:57,664 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:57,665 INFO L82 PathProgramCache]: Analyzing trace with hash 449882030, now seen corresponding path program 4 times [2020-07-11 00:33:57,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:57,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [602504381] [2020-07-11 00:33:57,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,710 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3205#true} {3205#true} #57#return; {3205#true} is VALID [2020-07-11 00:33:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,777 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,779 INFO L280 TraceCheckUtils]: 3: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,779 INFO L263 TraceCheckUtils]: 4: Hoare triple {3323#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,779 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,780 INFO L280 TraceCheckUtils]: 7: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,780 INFO L280 TraceCheckUtils]: 8: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,781 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,782 INFO L280 TraceCheckUtils]: 11: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,782 INFO L280 TraceCheckUtils]: 12: Hoare triple {3323#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,783 INFO L280 TraceCheckUtils]: 13: Hoare triple {3323#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,783 INFO L280 TraceCheckUtils]: 14: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume true; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,784 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3323#(= 0 |ackermann_#in~n|)} {3205#true} #61#return; {3206#false} is VALID [2020-07-11 00:33:57,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,787 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-11 00:33:57,787 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-11 00:33:57,787 INFO L263 TraceCheckUtils]: 4: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,787 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} ~n := #in~n; {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,789 INFO L280 TraceCheckUtils]: 7: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,790 INFO L280 TraceCheckUtils]: 8: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,790 INFO L263 TraceCheckUtils]: 9: Hoare triple {3323#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,790 INFO L280 TraceCheckUtils]: 10: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,790 INFO L280 TraceCheckUtils]: 11: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,791 INFO L280 TraceCheckUtils]: 12: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,791 INFO L280 TraceCheckUtils]: 13: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,791 INFO L280 TraceCheckUtils]: 14: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,796 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,800 INFO L280 TraceCheckUtils]: 16: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,800 INFO L280 TraceCheckUtils]: 17: Hoare triple {3323#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,801 INFO L280 TraceCheckUtils]: 18: Hoare triple {3323#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,802 INFO L280 TraceCheckUtils]: 19: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume true; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,804 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3323#(= 0 |ackermann_#in~n|)} {3205#true} #61#return; {3206#false} is VALID [2020-07-11 00:33:57,805 INFO L280 TraceCheckUtils]: 21: Hoare triple {3206#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#false} is VALID [2020-07-11 00:33:57,805 INFO L280 TraceCheckUtils]: 22: Hoare triple {3206#false} #res := #t~ret0; {3206#false} is VALID [2020-07-11 00:33:57,805 INFO L280 TraceCheckUtils]: 23: Hoare triple {3206#false} havoc #t~ret0; {3206#false} is VALID [2020-07-11 00:33:57,805 INFO L280 TraceCheckUtils]: 24: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-11 00:33:57,806 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3206#false} {3205#true} #63#return; {3206#false} is VALID [2020-07-11 00:33:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,832 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,832 INFO L280 TraceCheckUtils]: 4: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,832 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3205#true} {3205#true} #61#return; {3205#true} is VALID [2020-07-11 00:33:57,833 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-11 00:33:57,833 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-11 00:33:57,833 INFO L263 TraceCheckUtils]: 4: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,834 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,834 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,835 INFO L280 TraceCheckUtils]: 9: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,835 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3205#true} {3205#true} #61#return; {3205#true} is VALID [2020-07-11 00:33:57,835 INFO L280 TraceCheckUtils]: 11: Hoare triple {3205#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3205#true} is VALID [2020-07-11 00:33:57,835 INFO L280 TraceCheckUtils]: 12: Hoare triple {3205#true} #res := #t~ret0; {3205#true} is VALID [2020-07-11 00:33:57,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {3205#true} havoc #t~ret0; {3205#true} is VALID [2020-07-11 00:33:57,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,836 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3205#true} {3206#false} #65#return; {3206#false} is VALID [2020-07-11 00:33:57,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,837 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-11 00:33:57,837 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} assume !(0 == ~n); {3205#true} is VALID [2020-07-11 00:33:57,837 INFO L263 TraceCheckUtils]: 4: Hoare triple {3205#true} call #t~ret1 := ackermann(~m, ~n - 1); {3205#true} is VALID [2020-07-11 00:33:57,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-11 00:33:57,838 INFO L280 TraceCheckUtils]: 8: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-11 00:33:57,838 INFO L263 TraceCheckUtils]: 9: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {3205#true} ~n := #in~n; {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,839 INFO L280 TraceCheckUtils]: 12: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,840 INFO L280 TraceCheckUtils]: 13: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,840 INFO L263 TraceCheckUtils]: 14: Hoare triple {3323#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,840 INFO L280 TraceCheckUtils]: 15: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,841 INFO L280 TraceCheckUtils]: 16: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,841 INFO L280 TraceCheckUtils]: 17: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,841 INFO L280 TraceCheckUtils]: 18: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,841 INFO L280 TraceCheckUtils]: 19: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,842 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,843 INFO L280 TraceCheckUtils]: 21: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,843 INFO L280 TraceCheckUtils]: 22: Hoare triple {3323#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,844 INFO L280 TraceCheckUtils]: 23: Hoare triple {3323#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,844 INFO L280 TraceCheckUtils]: 24: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume true; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,845 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3323#(= 0 |ackermann_#in~n|)} {3205#true} #61#return; {3206#false} is VALID [2020-07-11 00:33:57,845 INFO L280 TraceCheckUtils]: 26: Hoare triple {3206#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#false} is VALID [2020-07-11 00:33:57,846 INFO L280 TraceCheckUtils]: 27: Hoare triple {3206#false} #res := #t~ret0; {3206#false} is VALID [2020-07-11 00:33:57,846 INFO L280 TraceCheckUtils]: 28: Hoare triple {3206#false} havoc #t~ret0; {3206#false} is VALID [2020-07-11 00:33:57,846 INFO L280 TraceCheckUtils]: 29: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-11 00:33:57,846 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3206#false} {3205#true} #63#return; {3206#false} is VALID [2020-07-11 00:33:57,846 INFO L280 TraceCheckUtils]: 31: Hoare triple {3206#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#false} is VALID [2020-07-11 00:33:57,847 INFO L263 TraceCheckUtils]: 32: Hoare triple {3206#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3205#true} is VALID [2020-07-11 00:33:57,847 INFO L280 TraceCheckUtils]: 33: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,847 INFO L280 TraceCheckUtils]: 34: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,847 INFO L280 TraceCheckUtils]: 35: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-11 00:33:57,847 INFO L280 TraceCheckUtils]: 36: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-11 00:33:57,848 INFO L263 TraceCheckUtils]: 37: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,848 INFO L280 TraceCheckUtils]: 38: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,848 INFO L280 TraceCheckUtils]: 39: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,848 INFO L280 TraceCheckUtils]: 40: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,848 INFO L280 TraceCheckUtils]: 41: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,848 INFO L280 TraceCheckUtils]: 42: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,849 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3205#true} {3205#true} #61#return; {3205#true} is VALID [2020-07-11 00:33:57,849 INFO L280 TraceCheckUtils]: 44: Hoare triple {3205#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3205#true} is VALID [2020-07-11 00:33:57,849 INFO L280 TraceCheckUtils]: 45: Hoare triple {3205#true} #res := #t~ret0; {3205#true} is VALID [2020-07-11 00:33:57,849 INFO L280 TraceCheckUtils]: 46: Hoare triple {3205#true} havoc #t~ret0; {3205#true} is VALID [2020-07-11 00:33:57,849 INFO L280 TraceCheckUtils]: 47: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,850 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3205#true} {3206#false} #65#return; {3206#false} is VALID [2020-07-11 00:33:57,850 INFO L280 TraceCheckUtils]: 49: Hoare triple {3206#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3206#false} is VALID [2020-07-11 00:33:57,850 INFO L280 TraceCheckUtils]: 50: Hoare triple {3206#false} #res := #t~ret2; {3206#false} is VALID [2020-07-11 00:33:57,850 INFO L280 TraceCheckUtils]: 51: Hoare triple {3206#false} havoc #t~ret1; {3206#false} is VALID [2020-07-11 00:33:57,850 INFO L280 TraceCheckUtils]: 52: Hoare triple {3206#false} havoc #t~ret2; {3206#false} is VALID [2020-07-11 00:33:57,851 INFO L280 TraceCheckUtils]: 53: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-11 00:33:57,851 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {3206#false} {3205#true} #67#return; {3206#false} is VALID [2020-07-11 00:33:57,853 INFO L263 TraceCheckUtils]: 0: Hoare triple {3205#true} call ULTIMATE.init(); {3205#true} is VALID [2020-07-11 00:33:57,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,853 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3205#true} {3205#true} #57#return; {3205#true} is VALID [2020-07-11 00:33:57,853 INFO L263 TraceCheckUtils]: 3: Hoare triple {3205#true} call #t~ret6 := main(); {3205#true} is VALID [2020-07-11 00:33:57,853 INFO L280 TraceCheckUtils]: 4: Hoare triple {3205#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3205#true} is VALID [2020-07-11 00:33:57,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m~0 := #t~nondet3; {3205#true} is VALID [2020-07-11 00:33:57,854 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} havoc #t~nondet3; {3205#true} is VALID [2020-07-11 00:33:57,854 INFO L280 TraceCheckUtils]: 7: Hoare triple {3205#true} assume !(~m~0 < 0 || ~m~0 > 3); {3205#true} is VALID [2020-07-11 00:33:57,854 INFO L280 TraceCheckUtils]: 8: Hoare triple {3205#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3205#true} is VALID [2020-07-11 00:33:57,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {3205#true} ~n~0 := #t~nondet4; {3205#true} is VALID [2020-07-11 00:33:57,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {3205#true} havoc #t~nondet4; {3205#true} is VALID [2020-07-11 00:33:57,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {3205#true} assume !(~n~0 < 0 || ~n~0 > 23); {3205#true} is VALID [2020-07-11 00:33:57,855 INFO L263 TraceCheckUtils]: 12: Hoare triple {3205#true} call #t~ret5 := ackermann(~m~0, ~n~0); {3205#true} is VALID [2020-07-11 00:33:57,855 INFO L280 TraceCheckUtils]: 13: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,855 INFO L280 TraceCheckUtils]: 14: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,855 INFO L280 TraceCheckUtils]: 15: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-11 00:33:57,856 INFO L280 TraceCheckUtils]: 16: Hoare triple {3205#true} assume !(0 == ~n); {3205#true} is VALID [2020-07-11 00:33:57,856 INFO L263 TraceCheckUtils]: 17: Hoare triple {3205#true} call #t~ret1 := ackermann(~m, ~n - 1); {3205#true} is VALID [2020-07-11 00:33:57,856 INFO L280 TraceCheckUtils]: 18: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,856 INFO L280 TraceCheckUtils]: 19: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,857 INFO L280 TraceCheckUtils]: 20: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-11 00:33:57,857 INFO L280 TraceCheckUtils]: 21: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-11 00:33:57,857 INFO L263 TraceCheckUtils]: 22: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,857 INFO L280 TraceCheckUtils]: 23: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,858 INFO L280 TraceCheckUtils]: 24: Hoare triple {3205#true} ~n := #in~n; {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,859 INFO L280 TraceCheckUtils]: 25: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,860 INFO L280 TraceCheckUtils]: 26: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,860 INFO L263 TraceCheckUtils]: 27: Hoare triple {3323#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,860 INFO L280 TraceCheckUtils]: 28: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,860 INFO L280 TraceCheckUtils]: 29: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,861 INFO L280 TraceCheckUtils]: 30: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,861 INFO L280 TraceCheckUtils]: 31: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,861 INFO L280 TraceCheckUtils]: 32: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,862 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,863 INFO L280 TraceCheckUtils]: 34: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,864 INFO L280 TraceCheckUtils]: 35: Hoare triple {3323#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,864 INFO L280 TraceCheckUtils]: 36: Hoare triple {3323#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,865 INFO L280 TraceCheckUtils]: 37: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume true; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:57,866 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3323#(= 0 |ackermann_#in~n|)} {3205#true} #61#return; {3206#false} is VALID [2020-07-11 00:33:57,866 INFO L280 TraceCheckUtils]: 39: Hoare triple {3206#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#false} is VALID [2020-07-11 00:33:57,867 INFO L280 TraceCheckUtils]: 40: Hoare triple {3206#false} #res := #t~ret0; {3206#false} is VALID [2020-07-11 00:33:57,867 INFO L280 TraceCheckUtils]: 41: Hoare triple {3206#false} havoc #t~ret0; {3206#false} is VALID [2020-07-11 00:33:57,867 INFO L280 TraceCheckUtils]: 42: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-11 00:33:57,867 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3206#false} {3205#true} #63#return; {3206#false} is VALID [2020-07-11 00:33:57,868 INFO L280 TraceCheckUtils]: 44: Hoare triple {3206#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#false} is VALID [2020-07-11 00:33:57,868 INFO L263 TraceCheckUtils]: 45: Hoare triple {3206#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3205#true} is VALID [2020-07-11 00:33:57,868 INFO L280 TraceCheckUtils]: 46: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,868 INFO L280 TraceCheckUtils]: 47: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,868 INFO L280 TraceCheckUtils]: 48: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-11 00:33:57,868 INFO L280 TraceCheckUtils]: 49: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-11 00:33:57,869 INFO L263 TraceCheckUtils]: 50: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-11 00:33:57,869 INFO L280 TraceCheckUtils]: 51: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-11 00:33:57,869 INFO L280 TraceCheckUtils]: 52: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-11 00:33:57,869 INFO L280 TraceCheckUtils]: 53: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-11 00:33:57,869 INFO L280 TraceCheckUtils]: 54: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-11 00:33:57,870 INFO L280 TraceCheckUtils]: 55: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,870 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3205#true} {3205#true} #61#return; {3205#true} is VALID [2020-07-11 00:33:57,870 INFO L280 TraceCheckUtils]: 57: Hoare triple {3205#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3205#true} is VALID [2020-07-11 00:33:57,870 INFO L280 TraceCheckUtils]: 58: Hoare triple {3205#true} #res := #t~ret0; {3205#true} is VALID [2020-07-11 00:33:57,870 INFO L280 TraceCheckUtils]: 59: Hoare triple {3205#true} havoc #t~ret0; {3205#true} is VALID [2020-07-11 00:33:57,870 INFO L280 TraceCheckUtils]: 60: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-11 00:33:57,871 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {3205#true} {3206#false} #65#return; {3206#false} is VALID [2020-07-11 00:33:57,871 INFO L280 TraceCheckUtils]: 62: Hoare triple {3206#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3206#false} is VALID [2020-07-11 00:33:57,871 INFO L280 TraceCheckUtils]: 63: Hoare triple {3206#false} #res := #t~ret2; {3206#false} is VALID [2020-07-11 00:33:57,871 INFO L280 TraceCheckUtils]: 64: Hoare triple {3206#false} havoc #t~ret1; {3206#false} is VALID [2020-07-11 00:33:57,872 INFO L280 TraceCheckUtils]: 65: Hoare triple {3206#false} havoc #t~ret2; {3206#false} is VALID [2020-07-11 00:33:57,872 INFO L280 TraceCheckUtils]: 66: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-11 00:33:57,872 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3206#false} {3205#true} #67#return; {3206#false} is VALID [2020-07-11 00:33:57,872 INFO L280 TraceCheckUtils]: 68: Hoare triple {3206#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3206#false} is VALID [2020-07-11 00:33:57,873 INFO L280 TraceCheckUtils]: 69: Hoare triple {3206#false} ~result~0 := #t~ret5; {3206#false} is VALID [2020-07-11 00:33:57,873 INFO L280 TraceCheckUtils]: 70: Hoare triple {3206#false} havoc #t~ret5; {3206#false} is VALID [2020-07-11 00:33:57,873 INFO L280 TraceCheckUtils]: 71: Hoare triple {3206#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {3206#false} is VALID [2020-07-11 00:33:57,873 INFO L280 TraceCheckUtils]: 72: Hoare triple {3206#false} assume !false; {3206#false} is VALID [2020-07-11 00:33:57,878 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-11 00:33:57,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [602504381] [2020-07-11 00:33:57,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:57,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-11 00:33:57,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383507295] [2020-07-11 00:33:57,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-07-11 00:33:57,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:57,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:33:57,942 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-11 00:33:57,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:33:57,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:33:57,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:33:57,943 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand 4 states. [2020-07-11 00:33:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:58,291 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2020-07-11 00:33:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:33:58,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-07-11 00:33:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-11 00:33:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-11 00:33:58,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2020-07-11 00:33:58,377 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-11 00:33:58,380 INFO L225 Difference]: With dead ends: 144 [2020-07-11 00:33:58,381 INFO L226 Difference]: Without dead ends: 78 [2020-07-11 00:33:58,382 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-11 00:33:58,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-11 00:33:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-11 00:33:58,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:58,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-11 00:33:58,608 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-11 00:33:58,608 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-11 00:33:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:58,614 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-07-11 00:33:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-11 00:33:58,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:58,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:58,615 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-11 00:33:58,615 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-11 00:33:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:58,620 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-07-11 00:33:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-11 00:33:58,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:58,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:58,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:58,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-11 00:33:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2020-07-11 00:33:58,626 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 73 [2020-07-11 00:33:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:58,626 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2020-07-11 00:33:58,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:33:58,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 104 transitions. [2020-07-11 00:33:58,839 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-11 00:33:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-11 00:33:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-11 00:33:58,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:58,842 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-11 00:33:58,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:33:58,843 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 990403329, now seen corresponding path program 5 times [2020-07-11 00:33:58,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:58,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [906772784] [2020-07-11 00:33:58,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:58,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-11 00:33:58,900 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3940#true} {3940#true} #57#return; {3940#true} is VALID [2020-07-11 00:33:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:59,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,174 INFO L280 TraceCheckUtils]: 2: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,175 INFO L280 TraceCheckUtils]: 4: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,176 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-11 00:33:59,177 INFO L263 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,179 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,183 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,183 INFO L280 TraceCheckUtils]: 11: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,184 INFO L280 TraceCheckUtils]: 12: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,185 INFO L280 TraceCheckUtils]: 13: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,185 INFO L280 TraceCheckUtils]: 14: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,186 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:59,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,245 INFO L280 TraceCheckUtils]: 2: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,253 INFO L280 TraceCheckUtils]: 3: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,254 INFO L280 TraceCheckUtils]: 4: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,255 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,256 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,256 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-11 00:33:59,257 INFO L263 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-11 00:33:59,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,257 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,257 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-11 00:33:59,258 INFO L263 TraceCheckUtils]: 9: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,258 INFO L280 TraceCheckUtils]: 10: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,260 INFO L280 TraceCheckUtils]: 13: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,260 INFO L280 TraceCheckUtils]: 14: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,261 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,262 INFO L280 TraceCheckUtils]: 16: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,263 INFO L280 TraceCheckUtils]: 18: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,264 INFO L280 TraceCheckUtils]: 19: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,265 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,265 INFO L280 TraceCheckUtils]: 21: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,266 INFO L263 TraceCheckUtils]: 22: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-11 00:33:59,266 INFO L280 TraceCheckUtils]: 23: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,266 INFO L280 TraceCheckUtils]: 24: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,267 INFO L280 TraceCheckUtils]: 25: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,268 INFO L280 TraceCheckUtils]: 26: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,268 INFO L280 TraceCheckUtils]: 27: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,270 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,270 INFO L280 TraceCheckUtils]: 29: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,271 INFO L280 TraceCheckUtils]: 30: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,272 INFO L280 TraceCheckUtils]: 31: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,272 INFO L280 TraceCheckUtils]: 32: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,273 INFO L280 TraceCheckUtils]: 33: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,274 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #61#return; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,276 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,276 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-11 00:33:59,276 INFO L263 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,277 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-11 00:33:59,277 INFO L263 TraceCheckUtils]: 9: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-11 00:33:59,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,278 INFO L280 TraceCheckUtils]: 12: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,278 INFO L280 TraceCheckUtils]: 13: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-11 00:33:59,278 INFO L263 TraceCheckUtils]: 14: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,279 INFO L280 TraceCheckUtils]: 15: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,279 INFO L280 TraceCheckUtils]: 16: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,280 INFO L280 TraceCheckUtils]: 17: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,281 INFO L280 TraceCheckUtils]: 18: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,281 INFO L280 TraceCheckUtils]: 19: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,283 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,283 INFO L280 TraceCheckUtils]: 21: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,284 INFO L280 TraceCheckUtils]: 22: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,285 INFO L280 TraceCheckUtils]: 23: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,285 INFO L280 TraceCheckUtils]: 24: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,286 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,287 INFO L280 TraceCheckUtils]: 26: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,287 INFO L263 TraceCheckUtils]: 27: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-11 00:33:59,287 INFO L280 TraceCheckUtils]: 28: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,288 INFO L280 TraceCheckUtils]: 29: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,288 INFO L280 TraceCheckUtils]: 30: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,289 INFO L280 TraceCheckUtils]: 31: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,290 INFO L280 TraceCheckUtils]: 32: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,291 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,291 INFO L280 TraceCheckUtils]: 34: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,292 INFO L280 TraceCheckUtils]: 35: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,293 INFO L280 TraceCheckUtils]: 36: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,293 INFO L280 TraceCheckUtils]: 37: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,294 INFO L280 TraceCheckUtils]: 38: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,295 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #61#return; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,296 INFO L280 TraceCheckUtils]: 40: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,296 INFO L280 TraceCheckUtils]: 41: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,297 INFO L280 TraceCheckUtils]: 42: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,297 INFO L280 TraceCheckUtils]: 43: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,298 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #63#return; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:59,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume 0 == ~m; {3940#true} is VALID [2020-07-11 00:33:59,337 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} #res := 1 + ~n; {3940#true} is VALID [2020-07-11 00:33:59,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-11 00:33:59,338 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3940#true} {4155#(= 0 |ackermann_#in~n|)} #61#return; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,340 INFO L263 TraceCheckUtils]: 4: Hoare triple {4155#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,341 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume 0 == ~m; {3940#true} is VALID [2020-07-11 00:33:59,341 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} #res := 1 + ~n; {3940#true} is VALID [2020-07-11 00:33:59,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-11 00:33:59,342 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3940#true} {4155#(= 0 |ackermann_#in~n|)} #61#return; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,343 INFO L280 TraceCheckUtils]: 12: Hoare triple {4155#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,344 INFO L280 TraceCheckUtils]: 13: Hoare triple {4155#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,345 INFO L280 TraceCheckUtils]: 14: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume true; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,346 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4155#(= 0 |ackermann_#in~n|)} {4065#(<= 3 |ackermann_#t~ret1|)} #65#return; {3941#false} is VALID [2020-07-11 00:33:59,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-11 00:33:59,347 INFO L263 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-11 00:33:59,347 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,347 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,348 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-11 00:33:59,348 INFO L263 TraceCheckUtils]: 9: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,348 INFO L280 TraceCheckUtils]: 11: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,349 INFO L280 TraceCheckUtils]: 12: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,349 INFO L280 TraceCheckUtils]: 13: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-11 00:33:59,349 INFO L263 TraceCheckUtils]: 14: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-11 00:33:59,349 INFO L280 TraceCheckUtils]: 15: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,349 INFO L280 TraceCheckUtils]: 16: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,349 INFO L280 TraceCheckUtils]: 17: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,350 INFO L280 TraceCheckUtils]: 18: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-11 00:33:59,350 INFO L263 TraceCheckUtils]: 19: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,350 INFO L280 TraceCheckUtils]: 20: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,351 INFO L280 TraceCheckUtils]: 21: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,351 INFO L280 TraceCheckUtils]: 22: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,352 INFO L280 TraceCheckUtils]: 23: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,353 INFO L280 TraceCheckUtils]: 24: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,354 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,354 INFO L280 TraceCheckUtils]: 26: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,355 INFO L280 TraceCheckUtils]: 27: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,355 INFO L280 TraceCheckUtils]: 28: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,356 INFO L280 TraceCheckUtils]: 29: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,357 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,357 INFO L280 TraceCheckUtils]: 31: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,358 INFO L263 TraceCheckUtils]: 32: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-11 00:33:59,358 INFO L280 TraceCheckUtils]: 33: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,358 INFO L280 TraceCheckUtils]: 34: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,359 INFO L280 TraceCheckUtils]: 35: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,360 INFO L280 TraceCheckUtils]: 36: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,360 INFO L280 TraceCheckUtils]: 37: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,361 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,362 INFO L280 TraceCheckUtils]: 39: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,363 INFO L280 TraceCheckUtils]: 40: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,363 INFO L280 TraceCheckUtils]: 41: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,364 INFO L280 TraceCheckUtils]: 42: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,364 INFO L280 TraceCheckUtils]: 43: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,365 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #61#return; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,366 INFO L280 TraceCheckUtils]: 45: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,367 INFO L280 TraceCheckUtils]: 46: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,368 INFO L280 TraceCheckUtils]: 47: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,368 INFO L280 TraceCheckUtils]: 48: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,369 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #63#return; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,370 INFO L280 TraceCheckUtils]: 50: Hoare triple {4065#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,370 INFO L263 TraceCheckUtils]: 51: Hoare triple {4065#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-11 00:33:59,370 INFO L280 TraceCheckUtils]: 52: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,371 INFO L280 TraceCheckUtils]: 53: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,371 INFO L280 TraceCheckUtils]: 54: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,372 INFO L280 TraceCheckUtils]: 55: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,372 INFO L263 TraceCheckUtils]: 56: Hoare triple {4155#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,372 INFO L280 TraceCheckUtils]: 57: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,372 INFO L280 TraceCheckUtils]: 58: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,373 INFO L280 TraceCheckUtils]: 59: Hoare triple {3940#true} assume 0 == ~m; {3940#true} is VALID [2020-07-11 00:33:59,373 INFO L280 TraceCheckUtils]: 60: Hoare triple {3940#true} #res := 1 + ~n; {3940#true} is VALID [2020-07-11 00:33:59,373 INFO L280 TraceCheckUtils]: 61: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-11 00:33:59,374 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {3940#true} {4155#(= 0 |ackermann_#in~n|)} #61#return; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,375 INFO L280 TraceCheckUtils]: 63: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,375 INFO L280 TraceCheckUtils]: 64: Hoare triple {4155#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,376 INFO L280 TraceCheckUtils]: 65: Hoare triple {4155#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,376 INFO L280 TraceCheckUtils]: 66: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume true; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,378 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {4155#(= 0 |ackermann_#in~n|)} {4065#(<= 3 |ackermann_#t~ret1|)} #65#return; {3941#false} is VALID [2020-07-11 00:33:59,378 INFO L280 TraceCheckUtils]: 68: Hoare triple {3941#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3941#false} is VALID [2020-07-11 00:33:59,378 INFO L280 TraceCheckUtils]: 69: Hoare triple {3941#false} #res := #t~ret2; {3941#false} is VALID [2020-07-11 00:33:59,378 INFO L280 TraceCheckUtils]: 70: Hoare triple {3941#false} havoc #t~ret1; {3941#false} is VALID [2020-07-11 00:33:59,378 INFO L280 TraceCheckUtils]: 71: Hoare triple {3941#false} havoc #t~ret2; {3941#false} is VALID [2020-07-11 00:33:59,379 INFO L280 TraceCheckUtils]: 72: Hoare triple {3941#false} assume true; {3941#false} is VALID [2020-07-11 00:33:59,379 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3941#false} {3940#true} #67#return; {4018#(<= 5 |main_#t~ret5|)} is VALID [2020-07-11 00:33:59,385 INFO L263 TraceCheckUtils]: 0: Hoare triple {3940#true} call ULTIMATE.init(); {3940#true} is VALID [2020-07-11 00:33:59,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-11 00:33:59,385 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3940#true} {3940#true} #57#return; {3940#true} is VALID [2020-07-11 00:33:59,385 INFO L263 TraceCheckUtils]: 3: Hoare triple {3940#true} call #t~ret6 := main(); {3940#true} is VALID [2020-07-11 00:33:59,385 INFO L280 TraceCheckUtils]: 4: Hoare triple {3940#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3940#true} is VALID [2020-07-11 00:33:59,386 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m~0 := #t~nondet3; {3940#true} is VALID [2020-07-11 00:33:59,386 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} havoc #t~nondet3; {3940#true} is VALID [2020-07-11 00:33:59,386 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume !(~m~0 < 0 || ~m~0 > 3); {3940#true} is VALID [2020-07-11 00:33:59,386 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3940#true} is VALID [2020-07-11 00:33:59,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {3940#true} ~n~0 := #t~nondet4; {3940#true} is VALID [2020-07-11 00:33:59,387 INFO L280 TraceCheckUtils]: 10: Hoare triple {3940#true} havoc #t~nondet4; {3940#true} is VALID [2020-07-11 00:33:59,387 INFO L280 TraceCheckUtils]: 11: Hoare triple {3940#true} assume !(~n~0 < 0 || ~n~0 > 23); {3940#true} is VALID [2020-07-11 00:33:59,387 INFO L263 TraceCheckUtils]: 12: Hoare triple {3940#true} call #t~ret5 := ackermann(~m~0, ~n~0); {3940#true} is VALID [2020-07-11 00:33:59,387 INFO L280 TraceCheckUtils]: 13: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,387 INFO L280 TraceCheckUtils]: 14: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,387 INFO L280 TraceCheckUtils]: 15: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,388 INFO L280 TraceCheckUtils]: 16: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-11 00:33:59,388 INFO L263 TraceCheckUtils]: 17: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-11 00:33:59,388 INFO L280 TraceCheckUtils]: 18: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,388 INFO L280 TraceCheckUtils]: 19: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,388 INFO L280 TraceCheckUtils]: 20: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,389 INFO L280 TraceCheckUtils]: 21: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-11 00:33:59,389 INFO L263 TraceCheckUtils]: 22: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,389 INFO L280 TraceCheckUtils]: 23: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,389 INFO L280 TraceCheckUtils]: 24: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,389 INFO L280 TraceCheckUtils]: 25: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,389 INFO L280 TraceCheckUtils]: 26: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-11 00:33:59,390 INFO L263 TraceCheckUtils]: 27: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-11 00:33:59,390 INFO L280 TraceCheckUtils]: 28: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,390 INFO L280 TraceCheckUtils]: 29: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,390 INFO L280 TraceCheckUtils]: 30: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-11 00:33:59,390 INFO L280 TraceCheckUtils]: 31: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-11 00:33:59,391 INFO L263 TraceCheckUtils]: 32: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,391 INFO L280 TraceCheckUtils]: 33: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,394 INFO L280 TraceCheckUtils]: 34: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,395 INFO L280 TraceCheckUtils]: 35: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-11 00:33:59,396 INFO L280 TraceCheckUtils]: 36: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,396 INFO L280 TraceCheckUtils]: 37: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-11 00:33:59,397 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,398 INFO L280 TraceCheckUtils]: 39: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,398 INFO L280 TraceCheckUtils]: 40: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,399 INFO L280 TraceCheckUtils]: 41: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,399 INFO L280 TraceCheckUtils]: 42: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,400 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,401 INFO L280 TraceCheckUtils]: 44: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,401 INFO L263 TraceCheckUtils]: 45: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-11 00:33:59,401 INFO L280 TraceCheckUtils]: 46: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,402 INFO L280 TraceCheckUtils]: 47: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,402 INFO L280 TraceCheckUtils]: 48: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,403 INFO L280 TraceCheckUtils]: 49: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,404 INFO L280 TraceCheckUtils]: 50: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-11 00:33:59,405 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,405 INFO L280 TraceCheckUtils]: 52: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-11 00:33:59,406 INFO L280 TraceCheckUtils]: 53: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,406 INFO L280 TraceCheckUtils]: 54: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,406 INFO L280 TraceCheckUtils]: 55: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,407 INFO L280 TraceCheckUtils]: 56: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,407 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #61#return; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,408 INFO L280 TraceCheckUtils]: 58: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-11 00:33:59,408 INFO L280 TraceCheckUtils]: 59: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,409 INFO L280 TraceCheckUtils]: 60: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,409 INFO L280 TraceCheckUtils]: 61: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-11 00:33:59,410 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #63#return; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,410 INFO L280 TraceCheckUtils]: 63: Hoare triple {4065#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-11 00:33:59,410 INFO L263 TraceCheckUtils]: 64: Hoare triple {4065#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-11 00:33:59,410 INFO L280 TraceCheckUtils]: 65: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,411 INFO L280 TraceCheckUtils]: 66: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,411 INFO L280 TraceCheckUtils]: 67: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,412 INFO L280 TraceCheckUtils]: 68: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,412 INFO L263 TraceCheckUtils]: 69: Hoare triple {4155#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-11 00:33:59,412 INFO L280 TraceCheckUtils]: 70: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-11 00:33:59,413 INFO L280 TraceCheckUtils]: 71: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-11 00:33:59,413 INFO L280 TraceCheckUtils]: 72: Hoare triple {3940#true} assume 0 == ~m; {3940#true} is VALID [2020-07-11 00:33:59,413 INFO L280 TraceCheckUtils]: 73: Hoare triple {3940#true} #res := 1 + ~n; {3940#true} is VALID [2020-07-11 00:33:59,413 INFO L280 TraceCheckUtils]: 74: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-11 00:33:59,414 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3940#true} {4155#(= 0 |ackermann_#in~n|)} #61#return; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,414 INFO L280 TraceCheckUtils]: 76: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,414 INFO L280 TraceCheckUtils]: 77: Hoare triple {4155#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,415 INFO L280 TraceCheckUtils]: 78: Hoare triple {4155#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,415 INFO L280 TraceCheckUtils]: 79: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume true; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:59,416 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {4155#(= 0 |ackermann_#in~n|)} {4065#(<= 3 |ackermann_#t~ret1|)} #65#return; {3941#false} is VALID [2020-07-11 00:33:59,416 INFO L280 TraceCheckUtils]: 81: Hoare triple {3941#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3941#false} is VALID [2020-07-11 00:33:59,416 INFO L280 TraceCheckUtils]: 82: Hoare triple {3941#false} #res := #t~ret2; {3941#false} is VALID [2020-07-11 00:33:59,416 INFO L280 TraceCheckUtils]: 83: Hoare triple {3941#false} havoc #t~ret1; {3941#false} is VALID [2020-07-11 00:33:59,416 INFO L280 TraceCheckUtils]: 84: Hoare triple {3941#false} havoc #t~ret2; {3941#false} is VALID [2020-07-11 00:33:59,416 INFO L280 TraceCheckUtils]: 85: Hoare triple {3941#false} assume true; {3941#false} is VALID [2020-07-11 00:33:59,417 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {3941#false} {3940#true} #67#return; {4018#(<= 5 |main_#t~ret5|)} is VALID [2020-07-11 00:33:59,424 INFO L280 TraceCheckUtils]: 87: Hoare triple {4018#(<= 5 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4018#(<= 5 |main_#t~ret5|)} is VALID [2020-07-11 00:33:59,425 INFO L280 TraceCheckUtils]: 88: Hoare triple {4018#(<= 5 |main_#t~ret5|)} ~result~0 := #t~ret5; {4019#(<= 5 main_~result~0)} is VALID [2020-07-11 00:33:59,425 INFO L280 TraceCheckUtils]: 89: Hoare triple {4019#(<= 5 main_~result~0)} havoc #t~ret5; {4019#(<= 5 main_~result~0)} is VALID [2020-07-11 00:33:59,428 INFO L280 TraceCheckUtils]: 90: Hoare triple {4019#(<= 5 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {3941#false} is VALID [2020-07-11 00:33:59,429 INFO L280 TraceCheckUtils]: 91: Hoare triple {3941#false} assume !false; {3941#false} is VALID [2020-07-11 00:33:59,435 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-11 00:33:59,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [906772784] [2020-07-11 00:33:59,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:59,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-11 00:33:59,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692397282] [2020-07-11 00:33:59,438 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-07-11 00:33:59,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:59,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-11 00:33:59,514 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-11 00:33:59,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-11 00:33:59,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-11 00:33:59,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-11 00:33:59,516 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 16 states. [2020-07-11 00:34:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,626 INFO L93 Difference]: Finished difference Result 145 states and 234 transitions. [2020-07-11 00:34:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-11 00:34:01,626 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-07-11 00:34:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 00:34:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 119 transitions. [2020-07-11 00:34:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 00:34:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 119 transitions. [2020-07-11 00:34:01,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 119 transitions. [2020-07-11 00:34:01,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:01,787 INFO L225 Difference]: With dead ends: 145 [2020-07-11 00:34:01,787 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:34:01,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2020-07-11 00:34:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:34:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:34:01,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:01,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:01,790 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:01,792 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,793 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:01,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:01,793 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:01,794 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,794 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:01,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:01,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:01,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:34:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:34:01,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2020-07-11 00:34:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:01,795 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:34:01,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-11 00:34:01,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:34:01,797 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-11 00:34:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:01,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 00:34:01,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:34:04,097 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-07-11 00:34:04,274 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-07-11 00:34:04,520 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2020-07-11 00:34:04,808 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2020-07-11 00:34:05,245 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-07-11 00:34:05,487 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-07-11 00:34:05,493 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:05,493 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:05,494 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:05,494 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:34:05,494 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:34:05,494 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:05,494 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-11 00:34:05,495 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-11 00:34:05,495 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-07-11 00:34:05,495 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-11 00:34:05,495 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-11 00:34:05,496 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-11 00:34:05,496 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-11 00:34:05,496 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-11 00:34:05,496 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-11 00:34:05,496 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-11 00:34:05,497 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-11 00:34:05,497 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-11 00:34:05,497 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (and (<= 2 |ackermann_#res|) (let ((.cse0 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 (<= 3 |ackermann_#t~ret0|) (<= 3 |ackermann_#res|)) (and .cse0 (<= ackermann_~m 1)))) (= ackermann_~n |ackermann_#in~n|) (<= 2 |ackermann_#t~ret0|) (= 0 |ackermann_#in~n|) (<= 1 |ackermann_#in~m|)) [2020-07-11 00:34:05,497 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-11 00:34:05,497 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-11 00:34:05,497 INFO L264 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (<= 3 |ackermann_#res|) (<= 3 |ackermann_#t~ret2|) (<= 1 |ackermann_#in~m|)) [2020-07-11 00:34:05,497 INFO L264 CegarLoopResult]: At program point L15(lines 15 23) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-07-11 00:34:05,498 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-11 00:34:05,498 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-11 00:34:05,498 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-07-11 00:34:05,498 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-11 00:34:05,498 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-07-11 00:34:05,498 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-11 00:34:05,498 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-11 00:34:05,498 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 26 46) the Hoare annotation is: true [2020-07-11 00:34:05,498 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 26 46) the Hoare annotation is: true [2020-07-11 00:34:05,498 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: false [2020-07-11 00:34:05,498 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-11 00:34:05,499 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-11 00:34:05,499 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-11 00:34:05,499 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-11 00:34:05,499 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-11 00:34:05,499 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-11 00:34:05,499 INFO L271 CegarLoopResult]: At program point L34(lines 34 39) the Hoare annotation is: true [2020-07-11 00:34:05,499 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2020-07-11 00:34:05,499 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2020-07-11 00:34:05,499 INFO L271 CegarLoopResult]: At program point L28(lines 28 32) the Hoare annotation is: true [2020-07-11 00:34:05,499 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-11 00:34:05,532 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-11 00:34:05,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:34:05 BoogieIcfgContainer [2020-07-11 00:34:05,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:34:05,549 INFO L168 Benchmark]: Toolchain (without parser) took 20669.50 ms. Allocated memory was 136.8 MB in the beginning and 417.3 MB in the end (delta: 280.5 MB). Free memory was 100.6 MB in the beginning and 270.4 MB in the end (delta: -169.8 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:05,549 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 136.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:34:05,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.64 ms. Allocated memory is still 136.8 MB. Free memory was 100.4 MB in the beginning and 90.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:05,551 INFO L168 Benchmark]: Boogie Preprocessor took 28.84 ms. Allocated memory is still 136.8 MB. Free memory was 90.6 MB in the beginning and 89.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:05,551 INFO L168 Benchmark]: RCFGBuilder took 584.89 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 89.2 MB in the beginning and 158.6 MB in the end (delta: -69.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:05,552 INFO L168 Benchmark]: TraceAbstraction took 19753.55 ms. Allocated memory was 201.3 MB in the beginning and 417.3 MB in the end (delta: 216.0 MB). Free memory was 157.9 MB in the beginning and 270.4 MB in the end (delta: -112.5 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:05,555 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.26 ms. Allocated memory is still 136.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.64 ms. Allocated memory is still 136.8 MB. Free memory was 100.4 MB in the beginning and 90.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.84 ms. Allocated memory is still 136.8 MB. Free memory was 90.6 MB in the beginning and 89.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 584.89 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 89.2 MB in the beginning and 158.6 MB in the end (delta: -69.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19753.55 ms. Allocated memory was 201.3 MB in the beginning and 417.3 MB in the end (delta: 216.0 MB). Free memory was 157.9 MB in the beginning and 270.4 MB in the end (delta: -112.5 MB). Peak memory consumption was 103.5 MB. 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.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 285 SDtfs, 343 SDslu, 1234 SDs, 0 SdLazy, 1368 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 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, 95 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 566 PreInvPairs, 997 NumberOfFragments, 632 HoareAnnotationTreeSize, 566 FomulaSimplifications, 70975 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 44 FomulaSimplificationsInter, 2840 FormulaSimplificationTreeSizeReductionInter, 1.6s 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...