/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:06:29,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:06:29,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:06:29,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:06:29,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:06:29,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:06:29,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:06:29,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:06:29,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:06:29,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:06:29,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:06:29,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:06:29,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:06:29,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:06:29,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:06:29,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:06:29,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:06:29,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:06:29,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:06:29,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:06:29,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:06:29,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:06:29,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:06:29,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:06:29,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:06:29,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:06:29,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:06:29,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:06:29,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:06:29,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:06:29,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:06:29,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:06:29,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:06:29,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:06:29,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:06:29,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:06:29,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:06:29,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:06:29,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:06:29,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:06:29,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:06:29,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:06:29,176 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:06:29,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:06:29,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:06:29,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:06:29,178 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:06:29,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:06:29,179 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:06:29,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:06:29,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:06:29,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:06:29,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:06:29,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:06:29,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:06:29,181 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:06:29,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:06:29,182 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:06:29,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:06:29,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:06:29,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:06:29,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:06:29,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:06:29,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:06:29,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:06:29,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:06:29,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:06:29,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:06:29,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:06:29,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:06:29,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:06:29,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:06:29,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:06:29,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:06:29,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:06:29,508 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:06:29,508 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:06:29,509 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-17 22:06:29,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d782a7a6c/9625899a62884303b4905bd86d7bf87d/FLAG9da6c02a0 [2020-07-17 22:06:30,028 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:06:30,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-07-17 22:06:30,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d782a7a6c/9625899a62884303b4905bd86d7bf87d/FLAG9da6c02a0 [2020-07-17 22:06:30,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d782a7a6c/9625899a62884303b4905bd86d7bf87d [2020-07-17 22:06:30,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:06:30,060 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:06:30,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:06:30,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:06:30,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:06:30,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72fafbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30, skipping insertion in model container [2020-07-17 22:06:30,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:06:30,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:06:30,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:06:30,255 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:06:30,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:06:30,288 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:06:30,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30 WrapperNode [2020-07-17 22:06:30,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:06:30,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:06:30,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:06:30,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:06:30,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (1/1) ... [2020-07-17 22:06:30,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:06:30,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:06:30,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:06:30,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:06:30,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (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-17 22:06:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:06:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:06:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-17 22:06:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:06:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:06:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:06:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-17 22:06:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:06:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:06:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:06:30,780 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:06:30,780 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:06:30,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:06:30 BoogieIcfgContainer [2020-07-17 22:06:30,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:06:30,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:06:30,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:06:30,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:06:30,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:06:30" (1/3) ... [2020-07-17 22:06:30,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ac685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:06:30, skipping insertion in model container [2020-07-17 22:06:30,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:30" (2/3) ... [2020-07-17 22:06:30,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ac685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:06:30, skipping insertion in model container [2020-07-17 22:06:30,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:06:30" (3/3) ... [2020-07-17 22:06:30,794 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-07-17 22:06:30,805 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:06:30,813 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:06:30,827 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:06:30,850 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:06:30,850 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:06:30,851 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:06:30,851 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:06:30,851 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:06:30,851 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:06:30,851 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:06:30,851 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:06:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-17 22:06:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:06:30,891 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:30,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:30,893 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1796234678, now seen corresponding path program 1 times [2020-07-17 22:06:30,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:30,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604803168] [2020-07-17 22:06:30,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:31,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-17 22:06:31,149 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #40#return; {30#true} is VALID [2020-07-17 22:06:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:31,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~m := #in~m;~n := #in~n; {41#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:31,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {42#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:31,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {42#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:31,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {42#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {34#(<= 0 main_~n~0)} #50#return; {39#(<= 1 |main_#t~ret5|)} is VALID [2020-07-17 22:06:31,229 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-17 22:06:31,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-17 22:06:31,230 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #40#return; {30#true} is VALID [2020-07-17 22:06:31,230 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret6 := main(); {30#true} is VALID [2020-07-17 22:06:31,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {30#true} is VALID [2020-07-17 22:06:31,231 INFO L280 TraceCheckUtils]: 5: Hoare triple {30#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {30#true} is VALID [2020-07-17 22:06:31,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#true} assume !(~n~0 < 0 || ~n~0 > 23); {34#(<= 0 main_~n~0)} is VALID [2020-07-17 22:06:31,233 INFO L263 TraceCheckUtils]: 7: Hoare triple {34#(<= 0 main_~n~0)} call #t~ret5 := ackermann(~m~0, ~n~0); {30#true} is VALID [2020-07-17 22:06:31,234 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#true} ~m := #in~m;~n := #in~n; {41#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:31,235 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {42#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:31,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {42#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:31,239 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {42#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {34#(<= 0 main_~n~0)} #50#return; {39#(<= 1 |main_#t~ret5|)} is VALID [2020-07-17 22:06:31,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#(<= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {40#(<= 1 main_~result~0)} is VALID [2020-07-17 22:06:31,242 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#(<= 1 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {31#false} is VALID [2020-07-17 22:06:31,243 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-17 22:06:31,245 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-17 22:06:31,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604803168] [2020-07-17 22:06:31,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:31,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:06:31,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7843325] [2020-07-17 22:06:31,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-17 22:06:31,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:31,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:06:31,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:31,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:06:31,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:31,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:06:31,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:06:31,307 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 7 states. [2020-07-17 22:06:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:31,820 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2020-07-17 22:06:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:06:31,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-17 22:06:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:06:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2020-07-17 22:06:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:06:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2020-07-17 22:06:31,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2020-07-17 22:06:31,909 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-17 22:06:31,922 INFO L225 Difference]: With dead ends: 41 [2020-07-17 22:06:31,922 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 22:06:31,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:06:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 22:06:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-17 22:06:31,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:31,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-17 22:06:31,972 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-17 22:06:31,972 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-17 22:06:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:31,979 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-07-17 22:06:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-17 22:06:31,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:31,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:31,981 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-17 22:06:31,982 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-17 22:06:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:31,987 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-07-17 22:06:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-17 22:06:31,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:31,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:31,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:31,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:06:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-07-17 22:06:31,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 15 [2020-07-17 22:06:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:31,995 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-17 22:06:31,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:06:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-17 22:06:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:06:31,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:31,997 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:31,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:06:31,998 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash -895156504, now seen corresponding path program 1 times [2020-07-17 22:06:31,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:31,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237971901] [2020-07-17 22:06:31,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {185#true} assume true; {185#true} is VALID [2020-07-17 22:06:32,085 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {185#true} {185#true} #40#return; {185#true} is VALID [2020-07-17 22:06:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {185#true} ~m := #in~m;~n := #in~n; {208#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:32,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {208#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:32,186 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:32,187 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {185#true} #44#return; {206#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:32,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {185#true} ~m := #in~m;~n := #in~n; {185#true} is VALID [2020-07-17 22:06:32,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#true} assume !(0 == ~m); {185#true} is VALID [2020-07-17 22:06:32,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {185#true} assume 0 == ~n; {185#true} is VALID [2020-07-17 22:06:32,189 INFO L263 TraceCheckUtils]: 3: Hoare triple {185#true} call #t~ret0 := ackermann(~m - 1, 1); {185#true} is VALID [2020-07-17 22:06:32,190 INFO L280 TraceCheckUtils]: 4: Hoare triple {185#true} ~m := #in~m;~n := #in~n; {208#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:32,191 INFO L280 TraceCheckUtils]: 5: Hoare triple {208#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:32,191 INFO L280 TraceCheckUtils]: 6: Hoare triple {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:32,193 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {185#true} #44#return; {206#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:32,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {206#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {207#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:32,195 INFO L280 TraceCheckUtils]: 9: Hoare triple {207#(<= 2 |ackermann_#res|)} assume true; {207#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:32,196 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {207#(<= 2 |ackermann_#res|)} {185#true} #50#return; {200#(<= 2 |main_#t~ret5|)} is VALID [2020-07-17 22:06:32,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {185#true} is VALID [2020-07-17 22:06:32,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2020-07-17 22:06:32,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #40#return; {185#true} is VALID [2020-07-17 22:06:32,198 INFO L263 TraceCheckUtils]: 3: Hoare triple {185#true} call #t~ret6 := main(); {185#true} is VALID [2020-07-17 22:06:32,198 INFO L280 TraceCheckUtils]: 4: Hoare triple {185#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {185#true} is VALID [2020-07-17 22:06:32,198 INFO L280 TraceCheckUtils]: 5: Hoare triple {185#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {185#true} is VALID [2020-07-17 22:06:32,199 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~n~0 < 0 || ~n~0 > 23); {185#true} is VALID [2020-07-17 22:06:32,199 INFO L263 TraceCheckUtils]: 7: Hoare triple {185#true} call #t~ret5 := ackermann(~m~0, ~n~0); {185#true} is VALID [2020-07-17 22:06:32,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {185#true} ~m := #in~m;~n := #in~n; {185#true} is VALID [2020-07-17 22:06:32,200 INFO L280 TraceCheckUtils]: 9: Hoare triple {185#true} assume !(0 == ~m); {185#true} is VALID [2020-07-17 22:06:32,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {185#true} assume 0 == ~n; {185#true} is VALID [2020-07-17 22:06:32,200 INFO L263 TraceCheckUtils]: 11: Hoare triple {185#true} call #t~ret0 := ackermann(~m - 1, 1); {185#true} is VALID [2020-07-17 22:06:32,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {185#true} ~m := #in~m;~n := #in~n; {208#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:32,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {208#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:32,203 INFO L280 TraceCheckUtils]: 14: Hoare triple {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:32,204 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {209#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {185#true} #44#return; {206#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:32,206 INFO L280 TraceCheckUtils]: 16: Hoare triple {206#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {207#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:32,207 INFO L280 TraceCheckUtils]: 17: Hoare triple {207#(<= 2 |ackermann_#res|)} assume true; {207#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:32,208 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {207#(<= 2 |ackermann_#res|)} {185#true} #50#return; {200#(<= 2 |main_#t~ret5|)} is VALID [2020-07-17 22:06:32,209 INFO L280 TraceCheckUtils]: 19: Hoare triple {200#(<= 2 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {201#(<= 2 main_~result~0)} is VALID [2020-07-17 22:06:32,210 INFO L280 TraceCheckUtils]: 20: Hoare triple {201#(<= 2 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {186#false} is VALID [2020-07-17 22:06:32,210 INFO L280 TraceCheckUtils]: 21: Hoare triple {186#false} assume !false; {186#false} is VALID [2020-07-17 22:06:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:06:32,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237971901] [2020-07-17 22:06:32,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:32,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:06:32,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567804447] [2020-07-17 22:06:32,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-17 22:06:32,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:32,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:06:32,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:32,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:06:32,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:32,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:06:32,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:06:32,244 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 8 states. [2020-07-17 22:06:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:32,706 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-17 22:06:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:06:32,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-17 22:06:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:06:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:06:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:06:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:06:32,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-17 22:06:32,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:32,772 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:06:32,772 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:06:32,774 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:06:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:06:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-17 22:06:32,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:32,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-17 22:06:32,787 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-17 22:06:32,788 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-17 22:06:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:32,792 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-17 22:06:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-17 22:06:32,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:32,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:32,793 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-17 22:06:32,794 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-17 22:06:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:32,798 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-17 22:06:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-17 22:06:32,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:32,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:32,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:32,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-17 22:06:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-07-17 22:06:32,802 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 22 [2020-07-17 22:06:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:32,802 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-17 22:06:32,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:06:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-17 22:06:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:06:32,804 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:32,804 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:32,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:06:32,805 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:32,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash 408363011, now seen corresponding path program 1 times [2020-07-17 22:06:32,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:32,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020153735] [2020-07-17 22:06:32,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-17 22:06:32,842 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {351#true} {351#true} #40#return; {351#true} is VALID [2020-07-17 22:06:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {381#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#(= 0 |ackermann_#in~m|)} assume true; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,904 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {382#(= 0 |ackermann_#in~m|)} {372#(not (= ackermann_~m 0))} #46#return; {352#false} is VALID [2020-07-17 22:06:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-17 22:06:32,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} assume 0 == ~m;#res := 1 + ~n; {351#true} is VALID [2020-07-17 22:06:32,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-17 22:06:32,911 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {351#true} {352#false} #48#return; {352#false} is VALID [2020-07-17 22:06:32,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-17 22:06:32,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} assume !(0 == ~m); {372#(not (= ackermann_~m 0))} is VALID [2020-07-17 22:06:32,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {372#(not (= ackermann_~m 0))} assume !(0 == ~n); {372#(not (= ackermann_~m 0))} is VALID [2020-07-17 22:06:32,913 INFO L263 TraceCheckUtils]: 3: Hoare triple {372#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {351#true} is VALID [2020-07-17 22:06:32,914 INFO L280 TraceCheckUtils]: 4: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {381#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,915 INFO L280 TraceCheckUtils]: 5: Hoare triple {381#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,915 INFO L280 TraceCheckUtils]: 6: Hoare triple {382#(= 0 |ackermann_#in~m|)} assume true; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,917 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {382#(= 0 |ackermann_#in~m|)} {372#(not (= ackermann_~m 0))} #46#return; {352#false} is VALID [2020-07-17 22:06:32,917 INFO L280 TraceCheckUtils]: 8: Hoare triple {352#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {352#false} is VALID [2020-07-17 22:06:32,917 INFO L263 TraceCheckUtils]: 9: Hoare triple {352#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {351#true} is VALID [2020-07-17 22:06:32,918 INFO L280 TraceCheckUtils]: 10: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-17 22:06:32,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {351#true} assume 0 == ~m;#res := 1 + ~n; {351#true} is VALID [2020-07-17 22:06:32,918 INFO L280 TraceCheckUtils]: 12: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-17 22:06:32,919 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {351#true} {352#false} #48#return; {352#false} is VALID [2020-07-17 22:06:32,919 INFO L280 TraceCheckUtils]: 14: Hoare triple {352#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {352#false} is VALID [2020-07-17 22:06:32,919 INFO L280 TraceCheckUtils]: 15: Hoare triple {352#false} assume true; {352#false} is VALID [2020-07-17 22:06:32,919 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {352#false} {351#true} #50#return; {352#false} is VALID [2020-07-17 22:06:32,920 INFO L263 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2020-07-17 22:06:32,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-17 22:06:32,921 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {351#true} {351#true} #40#return; {351#true} is VALID [2020-07-17 22:06:32,921 INFO L263 TraceCheckUtils]: 3: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2020-07-17 22:06:32,921 INFO L280 TraceCheckUtils]: 4: Hoare triple {351#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {351#true} is VALID [2020-07-17 22:06:32,922 INFO L280 TraceCheckUtils]: 5: Hoare triple {351#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {351#true} is VALID [2020-07-17 22:06:32,922 INFO L280 TraceCheckUtils]: 6: Hoare triple {351#true} assume !(~n~0 < 0 || ~n~0 > 23); {351#true} is VALID [2020-07-17 22:06:32,922 INFO L263 TraceCheckUtils]: 7: Hoare triple {351#true} call #t~ret5 := ackermann(~m~0, ~n~0); {351#true} is VALID [2020-07-17 22:06:32,922 INFO L280 TraceCheckUtils]: 8: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-17 22:06:32,923 INFO L280 TraceCheckUtils]: 9: Hoare triple {351#true} assume !(0 == ~m); {372#(not (= ackermann_~m 0))} is VALID [2020-07-17 22:06:32,924 INFO L280 TraceCheckUtils]: 10: Hoare triple {372#(not (= ackermann_~m 0))} assume !(0 == ~n); {372#(not (= ackermann_~m 0))} is VALID [2020-07-17 22:06:32,924 INFO L263 TraceCheckUtils]: 11: Hoare triple {372#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {351#true} is VALID [2020-07-17 22:06:32,925 INFO L280 TraceCheckUtils]: 12: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {381#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,925 INFO L280 TraceCheckUtils]: 13: Hoare triple {381#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,926 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#(= 0 |ackermann_#in~m|)} assume true; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:32,927 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {382#(= 0 |ackermann_#in~m|)} {372#(not (= ackermann_~m 0))} #46#return; {352#false} is VALID [2020-07-17 22:06:32,927 INFO L280 TraceCheckUtils]: 16: Hoare triple {352#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {352#false} is VALID [2020-07-17 22:06:32,928 INFO L263 TraceCheckUtils]: 17: Hoare triple {352#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {351#true} is VALID [2020-07-17 22:06:32,928 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-17 22:06:32,928 INFO L280 TraceCheckUtils]: 19: Hoare triple {351#true} assume 0 == ~m;#res := 1 + ~n; {351#true} is VALID [2020-07-17 22:06:32,928 INFO L280 TraceCheckUtils]: 20: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-17 22:06:32,929 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {351#true} {352#false} #48#return; {352#false} is VALID [2020-07-17 22:06:32,929 INFO L280 TraceCheckUtils]: 22: Hoare triple {352#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {352#false} is VALID [2020-07-17 22:06:32,929 INFO L280 TraceCheckUtils]: 23: Hoare triple {352#false} assume true; {352#false} is VALID [2020-07-17 22:06:32,930 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {352#false} {351#true} #50#return; {352#false} is VALID [2020-07-17 22:06:32,930 INFO L280 TraceCheckUtils]: 25: Hoare triple {352#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {352#false} is VALID [2020-07-17 22:06:32,930 INFO L280 TraceCheckUtils]: 26: Hoare triple {352#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {352#false} is VALID [2020-07-17 22:06:32,930 INFO L280 TraceCheckUtils]: 27: Hoare triple {352#false} assume !false; {352#false} is VALID [2020-07-17 22:06:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:06:32,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020153735] [2020-07-17 22:06:32,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771299339] [2020-07-17 22:06:32,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:06:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:32,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:33,137 INFO L263 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2020-07-17 22:06:33,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-17 22:06:33,138 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {351#true} {351#true} #40#return; {351#true} is VALID [2020-07-17 22:06:33,138 INFO L263 TraceCheckUtils]: 3: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2020-07-17 22:06:33,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {351#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {351#true} is VALID [2020-07-17 22:06:33,138 INFO L280 TraceCheckUtils]: 5: Hoare triple {351#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {351#true} is VALID [2020-07-17 22:06:33,139 INFO L280 TraceCheckUtils]: 6: Hoare triple {351#true} assume !(~n~0 < 0 || ~n~0 > 23); {351#true} is VALID [2020-07-17 22:06:33,139 INFO L263 TraceCheckUtils]: 7: Hoare triple {351#true} call #t~ret5 := ackermann(~m~0, ~n~0); {351#true} is VALID [2020-07-17 22:06:33,139 INFO L280 TraceCheckUtils]: 8: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-17 22:06:33,140 INFO L280 TraceCheckUtils]: 9: Hoare triple {351#true} assume !(0 == ~m); {351#true} is VALID [2020-07-17 22:06:33,140 INFO L280 TraceCheckUtils]: 10: Hoare triple {351#true} assume !(0 == ~n); {351#true} is VALID [2020-07-17 22:06:33,140 INFO L263 TraceCheckUtils]: 11: Hoare triple {351#true} call #t~ret1 := ackermann(~m, ~n - 1); {351#true} is VALID [2020-07-17 22:06:33,141 INFO L280 TraceCheckUtils]: 12: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {422#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2020-07-17 22:06:33,142 INFO L280 TraceCheckUtils]: 13: Hoare triple {422#(<= |ackermann_#in~m| ackermann_~m)} assume 0 == ~m;#res := 1 + ~n; {426#(<= |ackermann_#in~m| 0)} is VALID [2020-07-17 22:06:33,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {426#(<= |ackermann_#in~m| 0)} assume true; {426#(<= |ackermann_#in~m| 0)} is VALID [2020-07-17 22:06:33,144 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {426#(<= |ackermann_#in~m| 0)} {351#true} #46#return; {433#(<= ackermann_~m 0)} is VALID [2020-07-17 22:06:33,144 INFO L280 TraceCheckUtils]: 16: Hoare triple {433#(<= ackermann_~m 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {433#(<= ackermann_~m 0)} is VALID [2020-07-17 22:06:33,145 INFO L263 TraceCheckUtils]: 17: Hoare triple {433#(<= ackermann_~m 0)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {351#true} is VALID [2020-07-17 22:06:33,145 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {443#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:33,146 INFO L280 TraceCheckUtils]: 19: Hoare triple {443#(<= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {447#(<= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:33,147 INFO L280 TraceCheckUtils]: 20: Hoare triple {447#(<= 0 |ackermann_#in~m|)} assume true; {447#(<= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:33,148 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {447#(<= 0 |ackermann_#in~m|)} {433#(<= ackermann_~m 0)} #48#return; {352#false} is VALID [2020-07-17 22:06:33,149 INFO L280 TraceCheckUtils]: 22: Hoare triple {352#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {352#false} is VALID [2020-07-17 22:06:33,149 INFO L280 TraceCheckUtils]: 23: Hoare triple {352#false} assume true; {352#false} is VALID [2020-07-17 22:06:33,149 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {352#false} {351#true} #50#return; {352#false} is VALID [2020-07-17 22:06:33,149 INFO L280 TraceCheckUtils]: 25: Hoare triple {352#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {352#false} is VALID [2020-07-17 22:06:33,150 INFO L280 TraceCheckUtils]: 26: Hoare triple {352#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {352#false} is VALID [2020-07-17 22:06:33,150 INFO L280 TraceCheckUtils]: 27: Hoare triple {352#false} assume !false; {352#false} is VALID [2020-07-17 22:06:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-17 22:06:33,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:33,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2020-07-17 22:06:33,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679171215] [2020-07-17 22:06:33,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-17 22:06:33,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:33,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:06:33,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:33,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:06:33,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:33,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:06:33,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:06:33,204 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 10 states. [2020-07-17 22:06:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:33,746 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2020-07-17 22:06:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:06:33,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-17 22:06:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:06:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-17 22:06:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:06:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-17 22:06:33,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2020-07-17 22:06:33,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:33,878 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:06:33,878 INFO L226 Difference]: Without dead ends: 33 [2020-07-17 22:06:33,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:06:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-17 22:06:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-07-17 22:06:33,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:33,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 28 states. [2020-07-17 22:06:33,900 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 28 states. [2020-07-17 22:06:33,900 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 28 states. [2020-07-17 22:06:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:33,908 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-07-17 22:06:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2020-07-17 22:06:33,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:33,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:33,909 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 33 states. [2020-07-17 22:06:33,909 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 33 states. [2020-07-17 22:06:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:33,922 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-07-17 22:06:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2020-07-17 22:06:33,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:33,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:33,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:33,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:06:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-17 22:06:33,930 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 28 [2020-07-17 22:06:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:33,930 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-17 22:06:33,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:06:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-17 22:06:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 22:06:33,936 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:33,937 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-07-17 22:06:34,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:06:34,155 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:34,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:34,156 INFO L82 PathProgramCache]: Analyzing trace with hash 718507263, now seen corresponding path program 1 times [2020-07-17 22:06:34,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:34,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863083332] [2020-07-17 22:06:34,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:34,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-17 22:06:34,217 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {651#true} {651#true} #40#return; {651#true} is VALID [2020-07-17 22:06:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:34,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {705#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:34,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:34,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:34,384 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {651#true} #44#return; {703#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:34,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-17 22:06:34,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-17 22:06:34,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume 0 == ~n; {651#true} is VALID [2020-07-17 22:06:34,385 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret0 := ackermann(~m - 1, 1); {651#true} is VALID [2020-07-17 22:06:34,386 INFO L280 TraceCheckUtils]: 4: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {705#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:34,387 INFO L280 TraceCheckUtils]: 5: Hoare triple {705#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:34,387 INFO L280 TraceCheckUtils]: 6: Hoare triple {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:34,389 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {651#true} #44#return; {703#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:34,389 INFO L280 TraceCheckUtils]: 8: Hoare triple {703#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,390 INFO L280 TraceCheckUtils]: 9: Hoare triple {704#(<= 2 |ackermann_#res|)} assume true; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,391 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {704#(<= 2 |ackermann_#res|)} {651#true} #46#return; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:34,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {707#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:34,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {707#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,452 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {692#(<= 2 |ackermann_#t~ret1|)} #48#return; {697#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:34,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-17 22:06:34,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-17 22:06:34,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume !(0 == ~n); {651#true} is VALID [2020-07-17 22:06:34,453 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := ackermann(~m, ~n - 1); {651#true} is VALID [2020-07-17 22:06:34,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-17 22:06:34,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-17 22:06:34,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#true} assume 0 == ~n; {651#true} is VALID [2020-07-17 22:06:34,454 INFO L263 TraceCheckUtils]: 7: Hoare triple {651#true} call #t~ret0 := ackermann(~m - 1, 1); {651#true} is VALID [2020-07-17 22:06:34,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {705#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:34,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:34,456 INFO L280 TraceCheckUtils]: 10: Hoare triple {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:34,457 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {651#true} #44#return; {703#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:34,458 INFO L280 TraceCheckUtils]: 12: Hoare triple {703#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,458 INFO L280 TraceCheckUtils]: 13: Hoare triple {704#(<= 2 |ackermann_#res|)} assume true; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,459 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {704#(<= 2 |ackermann_#res|)} {651#true} #46#return; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:34,473 INFO L280 TraceCheckUtils]: 15: Hoare triple {692#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:34,474 INFO L263 TraceCheckUtils]: 16: Hoare triple {692#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {651#true} is VALID [2020-07-17 22:06:34,474 INFO L280 TraceCheckUtils]: 17: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {707#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:34,475 INFO L280 TraceCheckUtils]: 18: Hoare triple {707#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,476 INFO L280 TraceCheckUtils]: 19: Hoare triple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,477 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {692#(<= 2 |ackermann_#t~ret1|)} #48#return; {697#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:34,478 INFO L280 TraceCheckUtils]: 21: Hoare triple {697#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,478 INFO L280 TraceCheckUtils]: 22: Hoare triple {698#(<= 3 |ackermann_#res|)} assume true; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,479 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {698#(<= 3 |ackermann_#res|)} {651#true} #50#return; {679#(<= 3 |main_#t~ret5|)} is VALID [2020-07-17 22:06:34,481 INFO L263 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2020-07-17 22:06:34,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-17 22:06:34,482 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #40#return; {651#true} is VALID [2020-07-17 22:06:34,482 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret6 := main(); {651#true} is VALID [2020-07-17 22:06:34,482 INFO L280 TraceCheckUtils]: 4: Hoare triple {651#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {651#true} is VALID [2020-07-17 22:06:34,482 INFO L280 TraceCheckUtils]: 5: Hoare triple {651#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {651#true} is VALID [2020-07-17 22:06:34,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#true} assume !(~n~0 < 0 || ~n~0 > 23); {651#true} is VALID [2020-07-17 22:06:34,483 INFO L263 TraceCheckUtils]: 7: Hoare triple {651#true} call #t~ret5 := ackermann(~m~0, ~n~0); {651#true} is VALID [2020-07-17 22:06:34,483 INFO L280 TraceCheckUtils]: 8: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-17 22:06:34,483 INFO L280 TraceCheckUtils]: 9: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-17 22:06:34,484 INFO L280 TraceCheckUtils]: 10: Hoare triple {651#true} assume !(0 == ~n); {651#true} is VALID [2020-07-17 22:06:34,484 INFO L263 TraceCheckUtils]: 11: Hoare triple {651#true} call #t~ret1 := ackermann(~m, ~n - 1); {651#true} is VALID [2020-07-17 22:06:34,484 INFO L280 TraceCheckUtils]: 12: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-17 22:06:34,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-17 22:06:34,485 INFO L280 TraceCheckUtils]: 14: Hoare triple {651#true} assume 0 == ~n; {651#true} is VALID [2020-07-17 22:06:34,485 INFO L263 TraceCheckUtils]: 15: Hoare triple {651#true} call #t~ret0 := ackermann(~m - 1, 1); {651#true} is VALID [2020-07-17 22:06:34,487 INFO L280 TraceCheckUtils]: 16: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {705#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:34,488 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:34,489 INFO L280 TraceCheckUtils]: 18: Hoare triple {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:34,490 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {706#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {651#true} #44#return; {703#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:34,492 INFO L280 TraceCheckUtils]: 20: Hoare triple {703#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,493 INFO L280 TraceCheckUtils]: 21: Hoare triple {704#(<= 2 |ackermann_#res|)} assume true; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,494 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {704#(<= 2 |ackermann_#res|)} {651#true} #46#return; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:34,495 INFO L280 TraceCheckUtils]: 23: Hoare triple {692#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:34,496 INFO L263 TraceCheckUtils]: 24: Hoare triple {692#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {651#true} is VALID [2020-07-17 22:06:34,498 INFO L280 TraceCheckUtils]: 25: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {707#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:34,499 INFO L280 TraceCheckUtils]: 26: Hoare triple {707#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,500 INFO L280 TraceCheckUtils]: 27: Hoare triple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,501 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {692#(<= 2 |ackermann_#t~ret1|)} #48#return; {697#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:34,502 INFO L280 TraceCheckUtils]: 29: Hoare triple {697#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,502 INFO L280 TraceCheckUtils]: 30: Hoare triple {698#(<= 3 |ackermann_#res|)} assume true; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,503 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {698#(<= 3 |ackermann_#res|)} {651#true} #50#return; {679#(<= 3 |main_#t~ret5|)} is VALID [2020-07-17 22:06:34,504 INFO L280 TraceCheckUtils]: 32: Hoare triple {679#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {680#(<= 3 main_~result~0)} is VALID [2020-07-17 22:06:34,504 INFO L280 TraceCheckUtils]: 33: Hoare triple {680#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {652#false} is VALID [2020-07-17 22:06:34,504 INFO L280 TraceCheckUtils]: 34: Hoare triple {652#false} assume !false; {652#false} is VALID [2020-07-17 22:06:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-17 22:06:34,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863083332] [2020-07-17 22:06:34,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992918873] [2020-07-17 22:06:34,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:34,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 22:06:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:34,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:34,694 INFO L263 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2020-07-17 22:06:34,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-17 22:06:34,695 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #40#return; {651#true} is VALID [2020-07-17 22:06:34,695 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret6 := main(); {651#true} is VALID [2020-07-17 22:06:34,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {651#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {651#true} is VALID [2020-07-17 22:06:34,696 INFO L280 TraceCheckUtils]: 5: Hoare triple {651#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {651#true} is VALID [2020-07-17 22:06:34,696 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#true} assume !(~n~0 < 0 || ~n~0 > 23); {651#true} is VALID [2020-07-17 22:06:34,696 INFO L263 TraceCheckUtils]: 7: Hoare triple {651#true} call #t~ret5 := ackermann(~m~0, ~n~0); {651#true} is VALID [2020-07-17 22:06:34,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-17 22:06:34,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-17 22:06:34,697 INFO L280 TraceCheckUtils]: 10: Hoare triple {651#true} assume !(0 == ~n); {651#true} is VALID [2020-07-17 22:06:34,697 INFO L263 TraceCheckUtils]: 11: Hoare triple {651#true} call #t~ret1 := ackermann(~m, ~n - 1); {651#true} is VALID [2020-07-17 22:06:34,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-17 22:06:34,697 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-17 22:06:34,698 INFO L280 TraceCheckUtils]: 14: Hoare triple {651#true} assume 0 == ~n; {651#true} is VALID [2020-07-17 22:06:34,698 INFO L263 TraceCheckUtils]: 15: Hoare triple {651#true} call #t~ret0 := ackermann(~m - 1, 1); {651#true} is VALID [2020-07-17 22:06:34,699 INFO L280 TraceCheckUtils]: 16: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {760#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:34,700 INFO L280 TraceCheckUtils]: 17: Hoare triple {760#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,700 INFO L280 TraceCheckUtils]: 18: Hoare triple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,701 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {651#true} #44#return; {703#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:34,702 INFO L280 TraceCheckUtils]: 20: Hoare triple {703#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,703 INFO L280 TraceCheckUtils]: 21: Hoare triple {704#(<= 2 |ackermann_#res|)} assume true; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,704 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {704#(<= 2 |ackermann_#res|)} {651#true} #46#return; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:34,704 INFO L280 TraceCheckUtils]: 23: Hoare triple {692#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:34,704 INFO L263 TraceCheckUtils]: 24: Hoare triple {692#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {651#true} is VALID [2020-07-17 22:06:34,705 INFO L280 TraceCheckUtils]: 25: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {760#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:34,706 INFO L280 TraceCheckUtils]: 26: Hoare triple {760#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,706 INFO L280 TraceCheckUtils]: 27: Hoare triple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:34,708 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {708#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {692#(<= 2 |ackermann_#t~ret1|)} #48#return; {697#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:34,708 INFO L280 TraceCheckUtils]: 29: Hoare triple {697#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,709 INFO L280 TraceCheckUtils]: 30: Hoare triple {698#(<= 3 |ackermann_#res|)} assume true; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:34,710 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {698#(<= 3 |ackermann_#res|)} {651#true} #50#return; {679#(<= 3 |main_#t~ret5|)} is VALID [2020-07-17 22:06:34,711 INFO L280 TraceCheckUtils]: 32: Hoare triple {679#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {680#(<= 3 main_~result~0)} is VALID [2020-07-17 22:06:34,712 INFO L280 TraceCheckUtils]: 33: Hoare triple {680#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {652#false} is VALID [2020-07-17 22:06:34,712 INFO L280 TraceCheckUtils]: 34: Hoare triple {652#false} assume !false; {652#false} is VALID [2020-07-17 22:06:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-17 22:06:34,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:34,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2020-07-17 22:06:34,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018520211] [2020-07-17 22:06:34,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-17 22:06:34,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:34,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:06:34,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:34,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:06:34,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:34,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:06:34,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:06:34,759 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 14 states. [2020-07-17 22:06:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:36,301 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2020-07-17 22:06:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 22:06:36,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-17 22:06:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:06:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2020-07-17 22:06:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:06:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2020-07-17 22:06:36,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2020-07-17 22:06:36,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:36,421 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:06:36,421 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:06:36,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2020-07-17 22:06:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:06:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2020-07-17 22:06:36,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:36,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 36 states. [2020-07-17 22:06:36,454 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 36 states. [2020-07-17 22:06:36,454 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 36 states. [2020-07-17 22:06:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:36,460 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2020-07-17 22:06:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2020-07-17 22:06:36,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:36,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:36,462 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 50 states. [2020-07-17 22:06:36,462 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 50 states. [2020-07-17 22:06:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:36,468 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2020-07-17 22:06:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2020-07-17 22:06:36,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:36,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:36,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:36,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:06:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-07-17 22:06:36,473 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 35 [2020-07-17 22:06:36,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:36,473 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-07-17 22:06:36,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:06:36,473 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-07-17 22:06:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-17 22:06:36,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:36,475 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 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-17 22:06:36,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:36,688 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1711672813, now seen corresponding path program 2 times [2020-07-17 22:06:36,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:36,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273199379] [2020-07-17 22:06:36,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:36,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} assume true; {1051#true} is VALID [2020-07-17 22:06:36,752 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1051#true} {1051#true} #40#return; {1051#true} is VALID [2020-07-17 22:06:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:36,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:36,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:36,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:36,942 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1051#true} #44#return; {1135#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:36,943 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:36,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:36,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-17 22:06:36,943 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-17 22:06:36,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:36,945 INFO L280 TraceCheckUtils]: 5: Hoare triple {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:36,946 INFO L280 TraceCheckUtils]: 6: Hoare triple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:36,947 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1051#true} #44#return; {1135#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:36,948 INFO L280 TraceCheckUtils]: 8: Hoare triple {1135#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:36,949 INFO L280 TraceCheckUtils]: 9: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:36,950 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:36,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1139#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:36,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {1139#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:36,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:36,999 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1125#(<= 2 |ackermann_#t~ret1|)} #48#return; {1130#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:37,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,000 INFO L280 TraceCheckUtils]: 2: Hoare triple {1051#true} assume !(0 == ~n); {1051#true} is VALID [2020-07-17 22:06:37,000 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret1 := ackermann(~m, ~n - 1); {1051#true} is VALID [2020-07-17 22:06:37,001 INFO L280 TraceCheckUtils]: 4: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,001 INFO L280 TraceCheckUtils]: 5: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,001 INFO L280 TraceCheckUtils]: 6: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-17 22:06:37,001 INFO L263 TraceCheckUtils]: 7: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-17 22:06:37,002 INFO L280 TraceCheckUtils]: 8: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:37,003 INFO L280 TraceCheckUtils]: 9: Hoare triple {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:37,003 INFO L280 TraceCheckUtils]: 10: Hoare triple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:37,005 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1051#true} #44#return; {1135#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:37,005 INFO L280 TraceCheckUtils]: 12: Hoare triple {1135#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,006 INFO L280 TraceCheckUtils]: 13: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,007 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:37,007 INFO L280 TraceCheckUtils]: 15: Hoare triple {1125#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:37,008 INFO L263 TraceCheckUtils]: 16: Hoare triple {1125#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1051#true} is VALID [2020-07-17 22:06:37,008 INFO L280 TraceCheckUtils]: 17: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1139#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:37,009 INFO L280 TraceCheckUtils]: 18: Hoare triple {1139#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,010 INFO L280 TraceCheckUtils]: 19: Hoare triple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,011 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1125#(<= 2 |ackermann_#t~ret1|)} #48#return; {1130#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:37,012 INFO L280 TraceCheckUtils]: 21: Hoare triple {1130#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,012 INFO L280 TraceCheckUtils]: 22: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,013 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #44#return; {1112#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:37,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-17 22:06:37,015 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-17 22:06:37,015 INFO L280 TraceCheckUtils]: 4: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,015 INFO L280 TraceCheckUtils]: 5: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,016 INFO L280 TraceCheckUtils]: 6: Hoare triple {1051#true} assume !(0 == ~n); {1051#true} is VALID [2020-07-17 22:06:37,016 INFO L263 TraceCheckUtils]: 7: Hoare triple {1051#true} call #t~ret1 := ackermann(~m, ~n - 1); {1051#true} is VALID [2020-07-17 22:06:37,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,016 INFO L280 TraceCheckUtils]: 9: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,017 INFO L280 TraceCheckUtils]: 10: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-17 22:06:37,017 INFO L263 TraceCheckUtils]: 11: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-17 22:06:37,018 INFO L280 TraceCheckUtils]: 12: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:37,018 INFO L280 TraceCheckUtils]: 13: Hoare triple {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:37,019 INFO L280 TraceCheckUtils]: 14: Hoare triple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:37,020 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1051#true} #44#return; {1135#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:37,021 INFO L280 TraceCheckUtils]: 16: Hoare triple {1135#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,022 INFO L280 TraceCheckUtils]: 17: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,023 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:37,023 INFO L280 TraceCheckUtils]: 19: Hoare triple {1125#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:37,023 INFO L263 TraceCheckUtils]: 20: Hoare triple {1125#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1051#true} is VALID [2020-07-17 22:06:37,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1139#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:37,025 INFO L280 TraceCheckUtils]: 22: Hoare triple {1139#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,025 INFO L280 TraceCheckUtils]: 23: Hoare triple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,027 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1125#(<= 2 |ackermann_#t~ret1|)} #48#return; {1130#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:37,028 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,028 INFO L280 TraceCheckUtils]: 26: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,029 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #44#return; {1112#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:37,030 INFO L280 TraceCheckUtils]: 28: Hoare triple {1112#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,031 INFO L280 TraceCheckUtils]: 29: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,032 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #50#return; {1086#(<= 3 |main_#t~ret5|)} is VALID [2020-07-17 22:06:37,033 INFO L263 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2020-07-17 22:06:37,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume true; {1051#true} is VALID [2020-07-17 22:06:37,033 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1051#true} {1051#true} #40#return; {1051#true} is VALID [2020-07-17 22:06:37,034 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret6 := main(); {1051#true} is VALID [2020-07-17 22:06:37,034 INFO L280 TraceCheckUtils]: 4: Hoare triple {1051#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {1051#true} is VALID [2020-07-17 22:06:37,034 INFO L280 TraceCheckUtils]: 5: Hoare triple {1051#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1051#true} is VALID [2020-07-17 22:06:37,034 INFO L280 TraceCheckUtils]: 6: Hoare triple {1051#true} assume !(~n~0 < 0 || ~n~0 > 23); {1051#true} is VALID [2020-07-17 22:06:37,034 INFO L263 TraceCheckUtils]: 7: Hoare triple {1051#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1051#true} is VALID [2020-07-17 22:06:37,035 INFO L280 TraceCheckUtils]: 8: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,035 INFO L280 TraceCheckUtils]: 9: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,035 INFO L280 TraceCheckUtils]: 10: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-17 22:06:37,035 INFO L263 TraceCheckUtils]: 11: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-17 22:06:37,035 INFO L280 TraceCheckUtils]: 12: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,036 INFO L280 TraceCheckUtils]: 13: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,036 INFO L280 TraceCheckUtils]: 14: Hoare triple {1051#true} assume !(0 == ~n); {1051#true} is VALID [2020-07-17 22:06:37,036 INFO L263 TraceCheckUtils]: 15: Hoare triple {1051#true} call #t~ret1 := ackermann(~m, ~n - 1); {1051#true} is VALID [2020-07-17 22:06:37,036 INFO L280 TraceCheckUtils]: 16: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,036 INFO L280 TraceCheckUtils]: 17: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,037 INFO L280 TraceCheckUtils]: 18: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-17 22:06:37,037 INFO L263 TraceCheckUtils]: 19: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-17 22:06:37,038 INFO L280 TraceCheckUtils]: 20: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:37,038 INFO L280 TraceCheckUtils]: 21: Hoare triple {1137#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:37,039 INFO L280 TraceCheckUtils]: 22: Hoare triple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:37,040 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1138#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1051#true} #44#return; {1135#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:37,041 INFO L280 TraceCheckUtils]: 24: Hoare triple {1135#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,041 INFO L280 TraceCheckUtils]: 25: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,042 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:37,043 INFO L280 TraceCheckUtils]: 27: Hoare triple {1125#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:37,043 INFO L263 TraceCheckUtils]: 28: Hoare triple {1125#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1051#true} is VALID [2020-07-17 22:06:37,044 INFO L280 TraceCheckUtils]: 29: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1139#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:37,044 INFO L280 TraceCheckUtils]: 30: Hoare triple {1139#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,045 INFO L280 TraceCheckUtils]: 31: Hoare triple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,046 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1125#(<= 2 |ackermann_#t~ret1|)} #48#return; {1130#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:37,047 INFO L280 TraceCheckUtils]: 33: Hoare triple {1130#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,048 INFO L280 TraceCheckUtils]: 34: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,049 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #44#return; {1112#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:37,049 INFO L280 TraceCheckUtils]: 36: Hoare triple {1112#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,050 INFO L280 TraceCheckUtils]: 37: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,051 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #50#return; {1086#(<= 3 |main_#t~ret5|)} is VALID [2020-07-17 22:06:37,052 INFO L280 TraceCheckUtils]: 39: Hoare triple {1086#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {1087#(<= 3 main_~result~0)} is VALID [2020-07-17 22:06:37,053 INFO L280 TraceCheckUtils]: 40: Hoare triple {1087#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1052#false} is VALID [2020-07-17 22:06:37,053 INFO L280 TraceCheckUtils]: 41: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2020-07-17 22:06:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-17 22:06:37,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273199379] [2020-07-17 22:06:37,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565640251] [2020-07-17 22:06:37,056 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:37,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:06:37,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:06:37,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-17 22:06:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:37,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:37,251 INFO L263 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2020-07-17 22:06:37,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume true; {1051#true} is VALID [2020-07-17 22:06:37,252 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1051#true} {1051#true} #40#return; {1051#true} is VALID [2020-07-17 22:06:37,252 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret6 := main(); {1051#true} is VALID [2020-07-17 22:06:37,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {1051#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {1051#true} is VALID [2020-07-17 22:06:37,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {1051#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1051#true} is VALID [2020-07-17 22:06:37,253 INFO L280 TraceCheckUtils]: 6: Hoare triple {1051#true} assume !(~n~0 < 0 || ~n~0 > 23); {1051#true} is VALID [2020-07-17 22:06:37,253 INFO L263 TraceCheckUtils]: 7: Hoare triple {1051#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1051#true} is VALID [2020-07-17 22:06:37,253 INFO L280 TraceCheckUtils]: 8: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,254 INFO L280 TraceCheckUtils]: 9: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,254 INFO L280 TraceCheckUtils]: 10: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-17 22:06:37,254 INFO L263 TraceCheckUtils]: 11: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-17 22:06:37,254 INFO L280 TraceCheckUtils]: 12: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,255 INFO L280 TraceCheckUtils]: 13: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {1051#true} assume !(0 == ~n); {1051#true} is VALID [2020-07-17 22:06:37,255 INFO L263 TraceCheckUtils]: 15: Hoare triple {1051#true} call #t~ret1 := ackermann(~m, ~n - 1); {1051#true} is VALID [2020-07-17 22:06:37,256 INFO L280 TraceCheckUtils]: 16: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-17 22:06:37,256 INFO L280 TraceCheckUtils]: 17: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-17 22:06:37,256 INFO L280 TraceCheckUtils]: 18: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-17 22:06:37,256 INFO L263 TraceCheckUtils]: 19: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-17 22:06:37,257 INFO L280 TraceCheckUtils]: 20: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1204#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:37,258 INFO L280 TraceCheckUtils]: 21: Hoare triple {1204#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,259 INFO L280 TraceCheckUtils]: 22: Hoare triple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,260 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1051#true} #44#return; {1135#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:37,261 INFO L280 TraceCheckUtils]: 24: Hoare triple {1135#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,261 INFO L280 TraceCheckUtils]: 25: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,262 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:37,263 INFO L280 TraceCheckUtils]: 27: Hoare triple {1125#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:37,263 INFO L263 TraceCheckUtils]: 28: Hoare triple {1125#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1051#true} is VALID [2020-07-17 22:06:37,264 INFO L280 TraceCheckUtils]: 29: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1204#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:37,265 INFO L280 TraceCheckUtils]: 30: Hoare triple {1204#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,265 INFO L280 TraceCheckUtils]: 31: Hoare triple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:37,266 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1140#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1125#(<= 2 |ackermann_#t~ret1|)} #48#return; {1130#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:37,270 INFO L280 TraceCheckUtils]: 33: Hoare triple {1130#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,271 INFO L280 TraceCheckUtils]: 34: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,272 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #44#return; {1112#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:37,272 INFO L280 TraceCheckUtils]: 36: Hoare triple {1112#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,273 INFO L280 TraceCheckUtils]: 37: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:37,273 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #50#return; {1086#(<= 3 |main_#t~ret5|)} is VALID [2020-07-17 22:06:37,274 INFO L280 TraceCheckUtils]: 39: Hoare triple {1086#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {1087#(<= 3 main_~result~0)} is VALID [2020-07-17 22:06:37,275 INFO L280 TraceCheckUtils]: 40: Hoare triple {1087#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1052#false} is VALID [2020-07-17 22:06:37,275 INFO L280 TraceCheckUtils]: 41: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2020-07-17 22:06:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-17 22:06:37,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:37,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2020-07-17 22:06:37,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972337556] [2020-07-17 22:06:37,280 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-17 22:06:37,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:37,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-17 22:06:37,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:37,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 22:06:37,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:37,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 22:06:37,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:06:37,336 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 15 states. [2020-07-17 22:06:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:38,768 INFO L93 Difference]: Finished difference Result 65 states and 116 transitions. [2020-07-17 22:06:38,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 22:06:38,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-17 22:06:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:06:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2020-07-17 22:06:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:06:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2020-07-17 22:06:38,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2020-07-17 22:06:38,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:38,885 INFO L225 Difference]: With dead ends: 65 [2020-07-17 22:06:38,885 INFO L226 Difference]: Without dead ends: 61 [2020-07-17 22:06:38,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2020-07-17 22:06:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-17 22:06:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 34. [2020-07-17 22:06:38,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:38,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 34 states. [2020-07-17 22:06:38,914 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 34 states. [2020-07-17 22:06:38,915 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 34 states. [2020-07-17 22:06:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:38,922 INFO L93 Difference]: Finished difference Result 61 states and 111 transitions. [2020-07-17 22:06:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. [2020-07-17 22:06:38,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:38,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:38,924 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 61 states. [2020-07-17 22:06:38,924 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 61 states. [2020-07-17 22:06:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:38,931 INFO L93 Difference]: Finished difference Result 61 states and 111 transitions. [2020-07-17 22:06:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. [2020-07-17 22:06:38,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:38,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:38,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:38,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:06:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2020-07-17 22:06:38,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 42 [2020-07-17 22:06:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:38,936 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2020-07-17 22:06:38,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 22:06:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2020-07-17 22:06:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-17 22:06:38,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:38,938 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 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-17 22:06:39,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:39,152 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1051926487, now seen corresponding path program 3 times [2020-07-17 22:06:39,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:39,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874684119] [2020-07-17 22:06:39,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:39,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-17 22:06:39,202 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1539#true} {1539#true} #40#return; {1539#true} is VALID [2020-07-17 22:06:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:39,299 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,301 INFO L280 TraceCheckUtils]: 2: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,302 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1603#(= 0 |ackermann_#in~m|)} {1597#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,303 INFO L280 TraceCheckUtils]: 2: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,304 INFO L263 TraceCheckUtils]: 3: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-17 22:06:39,304 INFO L280 TraceCheckUtils]: 4: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,305 INFO L280 TraceCheckUtils]: 5: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,305 INFO L280 TraceCheckUtils]: 6: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,306 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1603#(= 0 |ackermann_#in~m|)} {1597#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,306 INFO L280 TraceCheckUtils]: 8: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,306 INFO L280 TraceCheckUtils]: 9: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume true; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,308 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1602#(<= |ackermann_#in~m| 1)} {1539#true} #46#return; {1585#(<= ackermann_~m 1)} is VALID [2020-07-17 22:06:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:39,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,380 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1603#(= 0 |ackermann_#in~m|)} {1597#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,381 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,382 INFO L263 TraceCheckUtils]: 3: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-17 22:06:39,383 INFO L280 TraceCheckUtils]: 4: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,384 INFO L280 TraceCheckUtils]: 5: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,384 INFO L280 TraceCheckUtils]: 6: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,386 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1603#(= 0 |ackermann_#in~m|)} {1597#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,387 INFO L280 TraceCheckUtils]: 8: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,387 INFO L280 TraceCheckUtils]: 9: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume true; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,389 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1608#(<= 1 |ackermann_#in~m|)} {1585#(<= ackermann_~m 1)} #48#return; {1540#false} is VALID [2020-07-17 22:06:39,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-17 22:06:39,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-17 22:06:39,389 INFO L280 TraceCheckUtils]: 2: Hoare triple {1539#true} assume !(0 == ~n); {1539#true} is VALID [2020-07-17 22:06:39,390 INFO L263 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret1 := ackermann(~m, ~n - 1); {1539#true} is VALID [2020-07-17 22:06:39,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,391 INFO L280 TraceCheckUtils]: 6: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,391 INFO L263 TraceCheckUtils]: 7: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-17 22:06:39,392 INFO L280 TraceCheckUtils]: 8: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,393 INFO L280 TraceCheckUtils]: 9: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,395 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1603#(= 0 |ackermann_#in~m|)} {1597#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,395 INFO L280 TraceCheckUtils]: 12: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,396 INFO L280 TraceCheckUtils]: 13: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume true; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,397 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1602#(<= |ackermann_#in~m| 1)} {1539#true} #46#return; {1585#(<= ackermann_~m 1)} is VALID [2020-07-17 22:06:39,398 INFO L280 TraceCheckUtils]: 15: Hoare triple {1585#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1585#(<= ackermann_~m 1)} is VALID [2020-07-17 22:06:39,398 INFO L263 TraceCheckUtils]: 16: Hoare triple {1585#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1539#true} is VALID [2020-07-17 22:06:39,398 INFO L280 TraceCheckUtils]: 17: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,399 INFO L280 TraceCheckUtils]: 18: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,399 INFO L280 TraceCheckUtils]: 19: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,400 INFO L263 TraceCheckUtils]: 20: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-17 22:06:39,400 INFO L280 TraceCheckUtils]: 21: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,401 INFO L280 TraceCheckUtils]: 22: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,401 INFO L280 TraceCheckUtils]: 23: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,402 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1603#(= 0 |ackermann_#in~m|)} {1597#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,403 INFO L280 TraceCheckUtils]: 25: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,403 INFO L280 TraceCheckUtils]: 26: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume true; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,405 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1608#(<= 1 |ackermann_#in~m|)} {1585#(<= ackermann_~m 1)} #48#return; {1540#false} is VALID [2020-07-17 22:06:39,405 INFO L280 TraceCheckUtils]: 28: Hoare triple {1540#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {1540#false} is VALID [2020-07-17 22:06:39,405 INFO L280 TraceCheckUtils]: 29: Hoare triple {1540#false} assume true; {1540#false} is VALID [2020-07-17 22:06:39,405 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1540#false} {1539#true} #50#return; {1540#false} is VALID [2020-07-17 22:06:39,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2020-07-17 22:06:39,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-17 22:06:39,407 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1539#true} {1539#true} #40#return; {1539#true} is VALID [2020-07-17 22:06:39,407 INFO L263 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret6 := main(); {1539#true} is VALID [2020-07-17 22:06:39,407 INFO L280 TraceCheckUtils]: 4: Hoare triple {1539#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {1539#true} is VALID [2020-07-17 22:06:39,407 INFO L280 TraceCheckUtils]: 5: Hoare triple {1539#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1539#true} is VALID [2020-07-17 22:06:39,407 INFO L280 TraceCheckUtils]: 6: Hoare triple {1539#true} assume !(~n~0 < 0 || ~n~0 > 23); {1539#true} is VALID [2020-07-17 22:06:39,408 INFO L263 TraceCheckUtils]: 7: Hoare triple {1539#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1539#true} is VALID [2020-07-17 22:06:39,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-17 22:06:39,408 INFO L280 TraceCheckUtils]: 9: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-17 22:06:39,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {1539#true} assume !(0 == ~n); {1539#true} is VALID [2020-07-17 22:06:39,408 INFO L263 TraceCheckUtils]: 11: Hoare triple {1539#true} call #t~ret1 := ackermann(~m, ~n - 1); {1539#true} is VALID [2020-07-17 22:06:39,409 INFO L280 TraceCheckUtils]: 12: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,409 INFO L280 TraceCheckUtils]: 13: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,410 INFO L280 TraceCheckUtils]: 14: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,410 INFO L263 TraceCheckUtils]: 15: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-17 22:06:39,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,411 INFO L280 TraceCheckUtils]: 17: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,412 INFO L280 TraceCheckUtils]: 18: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,413 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1603#(= 0 |ackermann_#in~m|)} {1597#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,414 INFO L280 TraceCheckUtils]: 20: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,416 INFO L280 TraceCheckUtils]: 21: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume true; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-17 22:06:39,417 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1602#(<= |ackermann_#in~m| 1)} {1539#true} #46#return; {1585#(<= ackermann_~m 1)} is VALID [2020-07-17 22:06:39,418 INFO L280 TraceCheckUtils]: 23: Hoare triple {1585#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1585#(<= ackermann_~m 1)} is VALID [2020-07-17 22:06:39,419 INFO L263 TraceCheckUtils]: 24: Hoare triple {1585#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1539#true} is VALID [2020-07-17 22:06:39,419 INFO L280 TraceCheckUtils]: 25: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,420 INFO L280 TraceCheckUtils]: 26: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,420 INFO L280 TraceCheckUtils]: 27: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,420 INFO L263 TraceCheckUtils]: 28: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-17 22:06:39,421 INFO L280 TraceCheckUtils]: 29: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,421 INFO L280 TraceCheckUtils]: 30: Hoare triple {1597#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,428 INFO L280 TraceCheckUtils]: 31: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,434 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1603#(= 0 |ackermann_#in~m|)} {1597#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,435 INFO L280 TraceCheckUtils]: 33: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,435 INFO L280 TraceCheckUtils]: 34: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume true; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:39,436 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1608#(<= 1 |ackermann_#in~m|)} {1585#(<= ackermann_~m 1)} #48#return; {1540#false} is VALID [2020-07-17 22:06:39,436 INFO L280 TraceCheckUtils]: 36: Hoare triple {1540#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {1540#false} is VALID [2020-07-17 22:06:39,437 INFO L280 TraceCheckUtils]: 37: Hoare triple {1540#false} assume true; {1540#false} is VALID [2020-07-17 22:06:39,437 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1540#false} {1539#true} #50#return; {1540#false} is VALID [2020-07-17 22:06:39,437 INFO L280 TraceCheckUtils]: 39: Hoare triple {1540#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {1540#false} is VALID [2020-07-17 22:06:39,437 INFO L280 TraceCheckUtils]: 40: Hoare triple {1540#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1540#false} is VALID [2020-07-17 22:06:39,437 INFO L280 TraceCheckUtils]: 41: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2020-07-17 22:06:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-17 22:06:39,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874684119] [2020-07-17 22:06:39,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209614018] [2020-07-17 22:06:39,439 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:39,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:06:39,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:06:39,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:06:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:39,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:39,675 INFO L263 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2020-07-17 22:06:39,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-17 22:06:39,676 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1539#true} {1539#true} #40#return; {1539#true} is VALID [2020-07-17 22:06:39,676 INFO L263 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret6 := main(); {1539#true} is VALID [2020-07-17 22:06:39,676 INFO L280 TraceCheckUtils]: 4: Hoare triple {1539#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {1539#true} is VALID [2020-07-17 22:06:39,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {1539#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1539#true} is VALID [2020-07-17 22:06:39,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {1539#true} assume !(~n~0 < 0 || ~n~0 > 23); {1539#true} is VALID [2020-07-17 22:06:39,677 INFO L263 TraceCheckUtils]: 7: Hoare triple {1539#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1539#true} is VALID [2020-07-17 22:06:39,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-17 22:06:39,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-17 22:06:39,678 INFO L280 TraceCheckUtils]: 10: Hoare triple {1539#true} assume !(0 == ~n); {1539#true} is VALID [2020-07-17 22:06:39,678 INFO L263 TraceCheckUtils]: 11: Hoare triple {1539#true} call #t~ret1 := ackermann(~m, ~n - 1); {1539#true} is VALID [2020-07-17 22:06:39,679 INFO L280 TraceCheckUtils]: 12: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-17 22:06:39,679 INFO L280 TraceCheckUtils]: 13: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-17 22:06:39,679 INFO L280 TraceCheckUtils]: 14: Hoare triple {1539#true} assume 0 == ~n; {1539#true} is VALID [2020-07-17 22:06:39,679 INFO L263 TraceCheckUtils]: 15: Hoare triple {1539#true} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-17 22:06:39,679 INFO L280 TraceCheckUtils]: 16: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-17 22:06:39,680 INFO L280 TraceCheckUtils]: 17: Hoare triple {1539#true} assume 0 == ~m;#res := 1 + ~n; {1539#true} is VALID [2020-07-17 22:06:39,680 INFO L280 TraceCheckUtils]: 18: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-17 22:06:39,680 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1539#true} {1539#true} #44#return; {1539#true} is VALID [2020-07-17 22:06:39,680 INFO L280 TraceCheckUtils]: 20: Hoare triple {1539#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1539#true} is VALID [2020-07-17 22:06:39,680 INFO L280 TraceCheckUtils]: 21: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-17 22:06:39,681 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1539#true} {1539#true} #46#return; {1539#true} is VALID [2020-07-17 22:06:39,681 INFO L280 TraceCheckUtils]: 23: Hoare triple {1539#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1539#true} is VALID [2020-07-17 22:06:39,681 INFO L263 TraceCheckUtils]: 24: Hoare triple {1539#true} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1539#true} is VALID [2020-07-17 22:06:39,681 INFO L280 TraceCheckUtils]: 25: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-17 22:06:39,681 INFO L280 TraceCheckUtils]: 26: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-17 22:06:39,681 INFO L280 TraceCheckUtils]: 27: Hoare triple {1539#true} assume 0 == ~n; {1539#true} is VALID [2020-07-17 22:06:39,682 INFO L263 TraceCheckUtils]: 28: Hoare triple {1539#true} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-17 22:06:39,682 INFO L280 TraceCheckUtils]: 29: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1699#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:39,683 INFO L280 TraceCheckUtils]: 30: Hoare triple {1699#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {1703#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:39,684 INFO L280 TraceCheckUtils]: 31: Hoare triple {1703#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1703#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:39,685 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1703#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1539#true} #44#return; {1710#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:39,685 INFO L280 TraceCheckUtils]: 33: Hoare triple {1710#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1714#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:39,686 INFO L280 TraceCheckUtils]: 34: Hoare triple {1714#(<= 2 |ackermann_#res|)} assume true; {1714#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:39,687 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1714#(<= 2 |ackermann_#res|)} {1539#true} #48#return; {1721#(<= 2 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:39,687 INFO L280 TraceCheckUtils]: 36: Hoare triple {1721#(<= 2 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {1714#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:39,688 INFO L280 TraceCheckUtils]: 37: Hoare triple {1714#(<= 2 |ackermann_#res|)} assume true; {1714#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:39,689 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1714#(<= 2 |ackermann_#res|)} {1539#true} #50#return; {1731#(<= 2 |main_#t~ret5|)} is VALID [2020-07-17 22:06:39,689 INFO L280 TraceCheckUtils]: 39: Hoare triple {1731#(<= 2 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {1735#(<= 2 main_~result~0)} is VALID [2020-07-17 22:06:39,690 INFO L280 TraceCheckUtils]: 40: Hoare triple {1735#(<= 2 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1540#false} is VALID [2020-07-17 22:06:39,690 INFO L280 TraceCheckUtils]: 41: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2020-07-17 22:06:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-17 22:06:39,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:39,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2020-07-17 22:06:39,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339404938] [2020-07-17 22:06:39,693 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2020-07-17 22:06:39,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:39,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:06:39,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:39,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:06:39,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:39,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:06:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:06:39,758 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 14 states. [2020-07-17 22:06:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:40,917 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2020-07-17 22:06:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:06:40,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2020-07-17 22:06:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:06:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2020-07-17 22:06:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:06:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2020-07-17 22:06:40,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2020-07-17 22:06:41,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:41,029 INFO L225 Difference]: With dead ends: 81 [2020-07-17 22:06:41,030 INFO L226 Difference]: Without dead ends: 53 [2020-07-17 22:06:41,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2020-07-17 22:06:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-17 22:06:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-17 22:06:41,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:41,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-17 22:06:41,072 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-17 22:06:41,072 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-17 22:06:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:41,077 INFO L93 Difference]: Finished difference Result 53 states and 81 transitions. [2020-07-17 22:06:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2020-07-17 22:06:41,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:41,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:41,078 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-17 22:06:41,078 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-17 22:06:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:41,083 INFO L93 Difference]: Finished difference Result 53 states and 81 transitions. [2020-07-17 22:06:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2020-07-17 22:06:41,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:41,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:41,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:41,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-17 22:06:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2020-07-17 22:06:41,088 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 42 [2020-07-17 22:06:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:41,088 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2020-07-17 22:06:41,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:06:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2020-07-17 22:06:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-17 22:06:41,090 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:41,090 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:41,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:41,305 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1590578612, now seen corresponding path program 4 times [2020-07-17 22:06:41,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:41,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629715727] [2020-07-17 22:06:41,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,331 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2035#true} {2035#true} #40#return; {2035#true} is VALID [2020-07-17 22:06:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,405 INFO L280 TraceCheckUtils]: 2: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,405 INFO L263 TraceCheckUtils]: 3: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,405 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,405 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,406 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,407 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,408 INFO L280 TraceCheckUtils]: 9: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,409 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,412 INFO L263 TraceCheckUtils]: 7: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,412 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,412 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,412 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,413 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,415 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,416 INFO L280 TraceCheckUtils]: 16: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,416 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,438 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,439 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,440 INFO L263 TraceCheckUtils]: 3: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,440 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,441 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,442 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,442 INFO L280 TraceCheckUtils]: 8: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,443 INFO L280 TraceCheckUtils]: 9: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,444 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,445 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,445 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,446 INFO L280 TraceCheckUtils]: 5: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,447 INFO L263 TraceCheckUtils]: 7: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,447 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,447 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,447 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,448 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,449 INFO L280 TraceCheckUtils]: 12: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,449 INFO L280 TraceCheckUtils]: 13: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,450 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,451 INFO L280 TraceCheckUtils]: 15: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,451 INFO L280 TraceCheckUtils]: 16: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,451 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-17 22:06:41,452 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-17 22:06:41,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,453 INFO L263 TraceCheckUtils]: 7: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,455 INFO L263 TraceCheckUtils]: 11: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,455 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,456 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,457 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,458 INFO L280 TraceCheckUtils]: 17: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,459 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,459 INFO L280 TraceCheckUtils]: 19: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,459 INFO L280 TraceCheckUtils]: 20: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,460 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,460 INFO L280 TraceCheckUtils]: 22: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-17 22:06:41,460 INFO L263 TraceCheckUtils]: 23: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-17 22:06:41,460 INFO L280 TraceCheckUtils]: 24: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,460 INFO L280 TraceCheckUtils]: 25: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,461 INFO L280 TraceCheckUtils]: 26: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,461 INFO L263 TraceCheckUtils]: 27: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,461 INFO L280 TraceCheckUtils]: 28: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,462 INFO L280 TraceCheckUtils]: 29: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,463 INFO L280 TraceCheckUtils]: 30: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,463 INFO L263 TraceCheckUtils]: 31: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,463 INFO L280 TraceCheckUtils]: 32: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,463 INFO L280 TraceCheckUtils]: 33: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,464 INFO L280 TraceCheckUtils]: 34: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,464 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,465 INFO L280 TraceCheckUtils]: 36: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,466 INFO L280 TraceCheckUtils]: 37: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,467 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,467 INFO L280 TraceCheckUtils]: 39: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,467 INFO L280 TraceCheckUtils]: 40: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,467 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,467 INFO L280 TraceCheckUtils]: 42: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2036#false} is VALID [2020-07-17 22:06:41,468 INFO L280 TraceCheckUtils]: 43: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,468 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,475 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-17 22:06:41,476 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-17 22:06:41,476 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-17 22:06:41,477 INFO L263 TraceCheckUtils]: 7: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-17 22:06:41,477 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,477 INFO L263 TraceCheckUtils]: 11: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,479 INFO L280 TraceCheckUtils]: 13: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,479 INFO L280 TraceCheckUtils]: 14: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,479 INFO L263 TraceCheckUtils]: 15: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,480 INFO L280 TraceCheckUtils]: 16: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,480 INFO L280 TraceCheckUtils]: 17: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,480 INFO L280 TraceCheckUtils]: 18: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,481 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,482 INFO L280 TraceCheckUtils]: 20: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,483 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,484 INFO L280 TraceCheckUtils]: 23: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,484 INFO L280 TraceCheckUtils]: 24: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,484 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,484 INFO L280 TraceCheckUtils]: 26: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-17 22:06:41,484 INFO L263 TraceCheckUtils]: 27: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-17 22:06:41,485 INFO L280 TraceCheckUtils]: 28: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,485 INFO L280 TraceCheckUtils]: 29: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,485 INFO L280 TraceCheckUtils]: 30: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,485 INFO L263 TraceCheckUtils]: 31: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,486 INFO L280 TraceCheckUtils]: 32: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,486 INFO L280 TraceCheckUtils]: 33: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,487 INFO L280 TraceCheckUtils]: 34: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,487 INFO L263 TraceCheckUtils]: 35: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,487 INFO L280 TraceCheckUtils]: 36: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,487 INFO L280 TraceCheckUtils]: 37: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,488 INFO L280 TraceCheckUtils]: 38: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,488 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,489 INFO L280 TraceCheckUtils]: 40: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,490 INFO L280 TraceCheckUtils]: 41: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,491 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,491 INFO L280 TraceCheckUtils]: 43: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,491 INFO L280 TraceCheckUtils]: 44: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,491 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,491 INFO L280 TraceCheckUtils]: 46: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2036#false} is VALID [2020-07-17 22:06:41,491 INFO L280 TraceCheckUtils]: 47: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,492 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,492 INFO L280 TraceCheckUtils]: 49: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-17 22:06:41,492 INFO L263 TraceCheckUtils]: 50: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-17 22:06:41,492 INFO L280 TraceCheckUtils]: 51: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,492 INFO L280 TraceCheckUtils]: 52: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,493 INFO L280 TraceCheckUtils]: 53: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,493 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2035#true} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,493 INFO L280 TraceCheckUtils]: 55: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2036#false} is VALID [2020-07-17 22:06:41,493 INFO L280 TraceCheckUtils]: 56: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,493 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2036#false} {2035#true} #50#return; {2036#false} is VALID [2020-07-17 22:06:41,496 INFO L263 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2035#true} is VALID [2020-07-17 22:06:41,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,497 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2035#true} {2035#true} #40#return; {2035#true} is VALID [2020-07-17 22:06:41,497 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret6 := main(); {2035#true} is VALID [2020-07-17 22:06:41,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {2035#true} is VALID [2020-07-17 22:06:41,497 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2035#true} is VALID [2020-07-17 22:06:41,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !(~n~0 < 0 || ~n~0 > 23); {2035#true} is VALID [2020-07-17 22:06:41,498 INFO L263 TraceCheckUtils]: 7: Hoare triple {2035#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2035#true} is VALID [2020-07-17 22:06:41,498 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,498 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,498 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-17 22:06:41,499 INFO L263 TraceCheckUtils]: 11: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-17 22:06:41,499 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,499 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-17 22:06:41,499 INFO L263 TraceCheckUtils]: 15: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-17 22:06:41,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,500 INFO L263 TraceCheckUtils]: 19: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,501 INFO L280 TraceCheckUtils]: 20: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,501 INFO L280 TraceCheckUtils]: 21: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,502 INFO L280 TraceCheckUtils]: 22: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,502 INFO L263 TraceCheckUtils]: 23: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,502 INFO L280 TraceCheckUtils]: 24: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,502 INFO L280 TraceCheckUtils]: 25: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,502 INFO L280 TraceCheckUtils]: 26: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,503 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,504 INFO L280 TraceCheckUtils]: 28: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,505 INFO L280 TraceCheckUtils]: 29: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,506 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,506 INFO L280 TraceCheckUtils]: 31: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,506 INFO L280 TraceCheckUtils]: 32: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,506 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,506 INFO L280 TraceCheckUtils]: 34: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-17 22:06:41,507 INFO L263 TraceCheckUtils]: 35: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-17 22:06:41,507 INFO L280 TraceCheckUtils]: 36: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,507 INFO L280 TraceCheckUtils]: 37: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,507 INFO L280 TraceCheckUtils]: 38: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,508 INFO L263 TraceCheckUtils]: 39: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,508 INFO L280 TraceCheckUtils]: 40: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,509 INFO L280 TraceCheckUtils]: 41: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,509 INFO L280 TraceCheckUtils]: 42: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,509 INFO L263 TraceCheckUtils]: 43: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,510 INFO L280 TraceCheckUtils]: 44: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,510 INFO L280 TraceCheckUtils]: 45: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,510 INFO L280 TraceCheckUtils]: 46: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,511 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,511 INFO L280 TraceCheckUtils]: 48: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,512 INFO L280 TraceCheckUtils]: 49: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:41,513 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,513 INFO L280 TraceCheckUtils]: 51: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,513 INFO L280 TraceCheckUtils]: 52: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,514 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,514 INFO L280 TraceCheckUtils]: 54: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2036#false} is VALID [2020-07-17 22:06:41,514 INFO L280 TraceCheckUtils]: 55: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,514 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,514 INFO L280 TraceCheckUtils]: 57: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-17 22:06:41,515 INFO L263 TraceCheckUtils]: 58: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-17 22:06:41,515 INFO L280 TraceCheckUtils]: 59: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,515 INFO L280 TraceCheckUtils]: 60: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,515 INFO L280 TraceCheckUtils]: 61: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,515 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2035#true} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,515 INFO L280 TraceCheckUtils]: 63: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2036#false} is VALID [2020-07-17 22:06:41,516 INFO L280 TraceCheckUtils]: 64: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,516 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {2036#false} {2035#true} #50#return; {2036#false} is VALID [2020-07-17 22:06:41,516 INFO L280 TraceCheckUtils]: 66: Hoare triple {2036#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {2036#false} is VALID [2020-07-17 22:06:41,516 INFO L280 TraceCheckUtils]: 67: Hoare triple {2036#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2036#false} is VALID [2020-07-17 22:06:41,516 INFO L280 TraceCheckUtils]: 68: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2020-07-17 22:06:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 57 proven. 25 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-07-17 22:06:41,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629715727] [2020-07-17 22:06:41,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022039796] [2020-07-17 22:06:41,521 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:41,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:06:41,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:06:41,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:06:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:41,671 INFO L263 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2035#true} is VALID [2020-07-17 22:06:41,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,672 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2035#true} {2035#true} #40#return; {2035#true} is VALID [2020-07-17 22:06:41,672 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret6 := main(); {2035#true} is VALID [2020-07-17 22:06:41,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {2035#true} is VALID [2020-07-17 22:06:41,672 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2035#true} is VALID [2020-07-17 22:06:41,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !(~n~0 < 0 || ~n~0 > 23); {2035#true} is VALID [2020-07-17 22:06:41,673 INFO L263 TraceCheckUtils]: 7: Hoare triple {2035#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2035#true} is VALID [2020-07-17 22:06:41,673 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,673 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-17 22:06:41,674 INFO L263 TraceCheckUtils]: 11: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-17 22:06:41,674 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,674 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,674 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-17 22:06:41,675 INFO L263 TraceCheckUtils]: 15: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-17 22:06:41,675 INFO L280 TraceCheckUtils]: 16: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,675 INFO L280 TraceCheckUtils]: 17: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-17 22:06:41,675 INFO L280 TraceCheckUtils]: 18: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-17 22:06:41,675 INFO L263 TraceCheckUtils]: 19: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,677 INFO L280 TraceCheckUtils]: 20: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2277#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:41,677 INFO L280 TraceCheckUtils]: 21: Hoare triple {2277#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {2277#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:41,678 INFO L280 TraceCheckUtils]: 22: Hoare triple {2277#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {2284#(<= |ackermann_#in~n| 0)} is VALID [2020-07-17 22:06:41,678 INFO L263 TraceCheckUtils]: 23: Hoare triple {2284#(<= |ackermann_#in~n| 0)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-17 22:06:41,678 INFO L280 TraceCheckUtils]: 24: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-17 22:06:41,678 INFO L280 TraceCheckUtils]: 25: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-17 22:06:41,679 INFO L280 TraceCheckUtils]: 26: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:06:41,680 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2035#true} {2284#(<= |ackermann_#in~n| 0)} #44#return; {2284#(<= |ackermann_#in~n| 0)} is VALID [2020-07-17 22:06:41,680 INFO L280 TraceCheckUtils]: 28: Hoare triple {2284#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2284#(<= |ackermann_#in~n| 0)} is VALID [2020-07-17 22:06:41,681 INFO L280 TraceCheckUtils]: 29: Hoare triple {2284#(<= |ackermann_#in~n| 0)} assume true; {2284#(<= |ackermann_#in~n| 0)} is VALID [2020-07-17 22:06:41,682 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2284#(<= |ackermann_#in~n| 0)} {2035#true} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,682 INFO L280 TraceCheckUtils]: 31: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,682 INFO L280 TraceCheckUtils]: 32: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,682 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,683 INFO L280 TraceCheckUtils]: 34: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-17 22:06:41,683 INFO L263 TraceCheckUtils]: 35: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2036#false} is VALID [2020-07-17 22:06:41,683 INFO L280 TraceCheckUtils]: 36: Hoare triple {2036#false} ~m := #in~m;~n := #in~n; {2036#false} is VALID [2020-07-17 22:06:41,683 INFO L280 TraceCheckUtils]: 37: Hoare triple {2036#false} assume !(0 == ~m); {2036#false} is VALID [2020-07-17 22:06:41,683 INFO L280 TraceCheckUtils]: 38: Hoare triple {2036#false} assume 0 == ~n; {2036#false} is VALID [2020-07-17 22:06:41,683 INFO L263 TraceCheckUtils]: 39: Hoare triple {2036#false} call #t~ret0 := ackermann(~m - 1, 1); {2036#false} is VALID [2020-07-17 22:06:41,684 INFO L280 TraceCheckUtils]: 40: Hoare triple {2036#false} ~m := #in~m;~n := #in~n; {2036#false} is VALID [2020-07-17 22:06:41,684 INFO L280 TraceCheckUtils]: 41: Hoare triple {2036#false} assume !(0 == ~m); {2036#false} is VALID [2020-07-17 22:06:41,684 INFO L280 TraceCheckUtils]: 42: Hoare triple {2036#false} assume 0 == ~n; {2036#false} is VALID [2020-07-17 22:06:41,684 INFO L263 TraceCheckUtils]: 43: Hoare triple {2036#false} call #t~ret0 := ackermann(~m - 1, 1); {2036#false} is VALID [2020-07-17 22:06:41,684 INFO L280 TraceCheckUtils]: 44: Hoare triple {2036#false} ~m := #in~m;~n := #in~n; {2036#false} is VALID [2020-07-17 22:06:41,685 INFO L280 TraceCheckUtils]: 45: Hoare triple {2036#false} assume 0 == ~m;#res := 1 + ~n; {2036#false} is VALID [2020-07-17 22:06:41,685 INFO L280 TraceCheckUtils]: 46: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,685 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2036#false} {2036#false} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,685 INFO L280 TraceCheckUtils]: 48: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,685 INFO L280 TraceCheckUtils]: 49: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,686 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2036#false} {2036#false} #44#return; {2036#false} is VALID [2020-07-17 22:06:41,686 INFO L280 TraceCheckUtils]: 51: Hoare triple {2036#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2036#false} is VALID [2020-07-17 22:06:41,686 INFO L280 TraceCheckUtils]: 52: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,686 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,686 INFO L280 TraceCheckUtils]: 54: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2036#false} is VALID [2020-07-17 22:06:41,686 INFO L280 TraceCheckUtils]: 55: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,687 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-17 22:06:41,687 INFO L280 TraceCheckUtils]: 57: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-17 22:06:41,687 INFO L263 TraceCheckUtils]: 58: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2036#false} is VALID [2020-07-17 22:06:41,687 INFO L280 TraceCheckUtils]: 59: Hoare triple {2036#false} ~m := #in~m;~n := #in~n; {2036#false} is VALID [2020-07-17 22:06:41,687 INFO L280 TraceCheckUtils]: 60: Hoare triple {2036#false} assume 0 == ~m;#res := 1 + ~n; {2036#false} is VALID [2020-07-17 22:06:41,688 INFO L280 TraceCheckUtils]: 61: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,688 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-17 22:06:41,688 INFO L280 TraceCheckUtils]: 63: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2036#false} is VALID [2020-07-17 22:06:41,688 INFO L280 TraceCheckUtils]: 64: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-17 22:06:41,688 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {2036#false} {2035#true} #50#return; {2036#false} is VALID [2020-07-17 22:06:41,689 INFO L280 TraceCheckUtils]: 66: Hoare triple {2036#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {2036#false} is VALID [2020-07-17 22:06:41,689 INFO L280 TraceCheckUtils]: 67: Hoare triple {2036#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2036#false} is VALID [2020-07-17 22:06:41,689 INFO L280 TraceCheckUtils]: 68: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2020-07-17 22:06:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 92 proven. 1 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-07-17 22:06:41,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:41,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-17 22:06:41,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141594935] [2020-07-17 22:06:41,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2020-07-17 22:06:41,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:41,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:06:41,753 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-17 22:06:41,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:06:41,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:41,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:06:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:06:41,754 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 6 states. [2020-07-17 22:06:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:41,982 INFO L93 Difference]: Finished difference Result 101 states and 188 transitions. [2020-07-17 22:06:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:06:41,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2020-07-17 22:06:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2020-07-17 22:06:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2020-07-17 22:06:41,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2020-07-17 22:06:42,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:42,065 INFO L225 Difference]: With dead ends: 101 [2020-07-17 22:06:42,066 INFO L226 Difference]: Without dead ends: 56 [2020-07-17 22:06:42,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:06:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-17 22:06:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-17 22:06:42,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:42,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-17 22:06:42,113 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-17 22:06:42,113 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-17 22:06:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:42,121 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-17 22:06:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2020-07-17 22:06:42,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:42,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:42,123 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-17 22:06:42,123 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-17 22:06:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:42,130 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-17 22:06:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2020-07-17 22:06:42,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:42,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:42,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:42,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-17 22:06:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2020-07-17 22:06:42,137 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 69 [2020-07-17 22:06:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:42,138 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2020-07-17 22:06:42,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:06:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2020-07-17 22:06:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-17 22:06:42,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:42,142 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:42,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:06:42,356 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1483482771, now seen corresponding path program 5 times [2020-07-17 22:06:42,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:42,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689406648] [2020-07-17 22:06:42,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:42,398 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2728#true} {2728#true} #40#return; {2728#true} is VALID [2020-07-17 22:06:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:42,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,610 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2728#true} #44#return; {2942#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,611 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,612 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:42,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,615 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2728#true} #44#return; {2942#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {2942#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,617 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,657 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2932#(<= 2 |ackermann_#t~ret1|)} #48#return; {2937#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:42,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,658 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,658 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,658 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,659 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:42,660 INFO L280 TraceCheckUtils]: 9: Hoare triple {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,661 INFO L280 TraceCheckUtils]: 10: Hoare triple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,662 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2728#true} #44#return; {2942#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {2942#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,663 INFO L280 TraceCheckUtils]: 13: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,664 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,664 INFO L280 TraceCheckUtils]: 15: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,665 INFO L263 TraceCheckUtils]: 16: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,665 INFO L280 TraceCheckUtils]: 17: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,666 INFO L280 TraceCheckUtils]: 18: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,666 INFO L280 TraceCheckUtils]: 19: Hoare triple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,668 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2932#(<= 2 |ackermann_#t~ret1|)} #48#return; {2937#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:42,669 INFO L280 TraceCheckUtils]: 21: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,669 INFO L280 TraceCheckUtils]: 22: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,670 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,672 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,672 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,672 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,673 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,673 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,673 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,673 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,674 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:42,675 INFO L280 TraceCheckUtils]: 13: Hoare triple {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,676 INFO L280 TraceCheckUtils]: 14: Hoare triple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,677 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2728#true} #44#return; {2942#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,677 INFO L280 TraceCheckUtils]: 16: Hoare triple {2942#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,678 INFO L280 TraceCheckUtils]: 17: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,679 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,680 INFO L280 TraceCheckUtils]: 19: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,680 INFO L263 TraceCheckUtils]: 20: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,680 INFO L280 TraceCheckUtils]: 21: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,681 INFO L280 TraceCheckUtils]: 22: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,682 INFO L280 TraceCheckUtils]: 23: Hoare triple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,683 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2932#(<= 2 |ackermann_#t~ret1|)} #48#return; {2937#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:42,684 INFO L280 TraceCheckUtils]: 25: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,684 INFO L280 TraceCheckUtils]: 26: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,685 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,686 INFO L280 TraceCheckUtils]: 28: Hoare triple {2919#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,687 INFO L280 TraceCheckUtils]: 29: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,688 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-17 22:06:42,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:42,722 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,724 INFO L263 TraceCheckUtils]: 3: Hoare triple {2948#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-17 22:06:42,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:42,726 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,727 INFO L280 TraceCheckUtils]: 8: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,727 INFO L280 TraceCheckUtils]: 9: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume true; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,728 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2948#(= 0 |ackermann_#in~n|)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-17 22:06:42,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,729 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,729 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,729 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,730 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,730 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,730 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,730 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,731 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,731 INFO L280 TraceCheckUtils]: 13: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,731 INFO L280 TraceCheckUtils]: 14: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,732 INFO L263 TraceCheckUtils]: 15: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,733 INFO L280 TraceCheckUtils]: 16: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:42,734 INFO L280 TraceCheckUtils]: 17: Hoare triple {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,735 INFO L280 TraceCheckUtils]: 18: Hoare triple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,736 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2728#true} #44#return; {2942#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,737 INFO L280 TraceCheckUtils]: 20: Hoare triple {2942#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,738 INFO L280 TraceCheckUtils]: 21: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,739 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,740 INFO L280 TraceCheckUtils]: 23: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,740 INFO L263 TraceCheckUtils]: 24: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,741 INFO L280 TraceCheckUtils]: 25: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,742 INFO L280 TraceCheckUtils]: 26: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,743 INFO L280 TraceCheckUtils]: 27: Hoare triple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,744 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2932#(<= 2 |ackermann_#t~ret1|)} #48#return; {2937#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:42,746 INFO L280 TraceCheckUtils]: 29: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,746 INFO L280 TraceCheckUtils]: 30: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,748 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,749 INFO L280 TraceCheckUtils]: 32: Hoare triple {2919#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,749 INFO L280 TraceCheckUtils]: 33: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,751 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,751 INFO L280 TraceCheckUtils]: 35: Hoare triple {2883#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,751 INFO L263 TraceCheckUtils]: 36: Hoare triple {2883#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,752 INFO L280 TraceCheckUtils]: 37: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,752 INFO L280 TraceCheckUtils]: 38: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,753 INFO L280 TraceCheckUtils]: 39: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,753 INFO L263 TraceCheckUtils]: 40: Hoare triple {2948#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,753 INFO L280 TraceCheckUtils]: 41: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,754 INFO L280 TraceCheckUtils]: 42: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-17 22:06:42,754 INFO L280 TraceCheckUtils]: 43: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:42,755 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,756 INFO L280 TraceCheckUtils]: 45: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,757 INFO L280 TraceCheckUtils]: 46: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume true; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,758 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2948#(= 0 |ackermann_#in~n|)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-17 22:06:42,758 INFO L280 TraceCheckUtils]: 48: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2729#false} is VALID [2020-07-17 22:06:42,759 INFO L280 TraceCheckUtils]: 49: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-17 22:06:42,759 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2729#false} {2728#true} #46#return; {2847#(<= 2 ackermann_~m)} is VALID [2020-07-17 22:06:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2953#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {2953#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {2954#(= 0 |ackermann_#in~m|)} assume true; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2954#(= 0 |ackermann_#in~m|)} {2847#(<= 2 ackermann_~m)} #48#return; {2729#false} is VALID [2020-07-17 22:06:42,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,808 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,809 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,809 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,809 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,809 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,810 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,810 INFO L280 TraceCheckUtils]: 13: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,810 INFO L280 TraceCheckUtils]: 14: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,810 INFO L263 TraceCheckUtils]: 15: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,810 INFO L280 TraceCheckUtils]: 16: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,811 INFO L280 TraceCheckUtils]: 17: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,811 INFO L280 TraceCheckUtils]: 18: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,811 INFO L263 TraceCheckUtils]: 19: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,812 INFO L280 TraceCheckUtils]: 20: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:42,813 INFO L280 TraceCheckUtils]: 21: Hoare triple {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,814 INFO L280 TraceCheckUtils]: 22: Hoare triple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,815 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2728#true} #44#return; {2942#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,816 INFO L280 TraceCheckUtils]: 24: Hoare triple {2942#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,817 INFO L280 TraceCheckUtils]: 25: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,819 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,819 INFO L280 TraceCheckUtils]: 27: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,820 INFO L263 TraceCheckUtils]: 28: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,820 INFO L280 TraceCheckUtils]: 29: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,821 INFO L280 TraceCheckUtils]: 30: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,822 INFO L280 TraceCheckUtils]: 31: Hoare triple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,824 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2932#(<= 2 |ackermann_#t~ret1|)} #48#return; {2937#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:42,825 INFO L280 TraceCheckUtils]: 33: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,826 INFO L280 TraceCheckUtils]: 34: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,827 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,828 INFO L280 TraceCheckUtils]: 36: Hoare triple {2919#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,828 INFO L280 TraceCheckUtils]: 37: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,829 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,830 INFO L280 TraceCheckUtils]: 39: Hoare triple {2883#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,830 INFO L263 TraceCheckUtils]: 40: Hoare triple {2883#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,831 INFO L280 TraceCheckUtils]: 41: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,831 INFO L280 TraceCheckUtils]: 42: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,832 INFO L280 TraceCheckUtils]: 43: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,832 INFO L263 TraceCheckUtils]: 44: Hoare triple {2948#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,832 INFO L280 TraceCheckUtils]: 45: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,833 INFO L280 TraceCheckUtils]: 46: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-17 22:06:42,833 INFO L280 TraceCheckUtils]: 47: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:42,834 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,834 INFO L280 TraceCheckUtils]: 49: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,835 INFO L280 TraceCheckUtils]: 50: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume true; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,837 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2948#(= 0 |ackermann_#in~n|)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-17 22:06:42,837 INFO L280 TraceCheckUtils]: 52: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2729#false} is VALID [2020-07-17 22:06:42,837 INFO L280 TraceCheckUtils]: 53: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-17 22:06:42,837 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2729#false} {2728#true} #46#return; {2847#(<= 2 ackermann_~m)} is VALID [2020-07-17 22:06:42,838 INFO L280 TraceCheckUtils]: 55: Hoare triple {2847#(<= 2 ackermann_~m)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2847#(<= 2 ackermann_~m)} is VALID [2020-07-17 22:06:42,838 INFO L263 TraceCheckUtils]: 56: Hoare triple {2847#(<= 2 ackermann_~m)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,839 INFO L280 TraceCheckUtils]: 57: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2953#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,840 INFO L280 TraceCheckUtils]: 58: Hoare triple {2953#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,841 INFO L280 TraceCheckUtils]: 59: Hoare triple {2954#(= 0 |ackermann_#in~m|)} assume true; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,842 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {2954#(= 0 |ackermann_#in~m|)} {2847#(<= 2 ackermann_~m)} #48#return; {2729#false} is VALID [2020-07-17 22:06:42,842 INFO L280 TraceCheckUtils]: 61: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2729#false} is VALID [2020-07-17 22:06:42,843 INFO L280 TraceCheckUtils]: 62: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-17 22:06:42,843 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2729#false} {2728#true} #50#return; {2729#false} is VALID [2020-07-17 22:06:42,849 INFO L263 TraceCheckUtils]: 0: Hoare triple {2728#true} call ULTIMATE.init(); {2728#true} is VALID [2020-07-17 22:06:42,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:42,849 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2728#true} {2728#true} #40#return; {2728#true} is VALID [2020-07-17 22:06:42,849 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret6 := main(); {2728#true} is VALID [2020-07-17 22:06:42,850 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {2728#true} is VALID [2020-07-17 22:06:42,850 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2728#true} is VALID [2020-07-17 22:06:42,850 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume !(~n~0 < 0 || ~n~0 > 23); {2728#true} is VALID [2020-07-17 22:06:42,850 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2728#true} is VALID [2020-07-17 22:06:42,850 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,851 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,851 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,851 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,851 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,851 INFO L280 TraceCheckUtils]: 13: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,851 INFO L280 TraceCheckUtils]: 14: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,852 INFO L263 TraceCheckUtils]: 15: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,852 INFO L280 TraceCheckUtils]: 16: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,852 INFO L280 TraceCheckUtils]: 17: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,852 INFO L280 TraceCheckUtils]: 18: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,852 INFO L263 TraceCheckUtils]: 19: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,853 INFO L280 TraceCheckUtils]: 20: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,853 INFO L280 TraceCheckUtils]: 21: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,853 INFO L280 TraceCheckUtils]: 22: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:42,853 INFO L263 TraceCheckUtils]: 23: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:42,853 INFO L280 TraceCheckUtils]: 24: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,853 INFO L280 TraceCheckUtils]: 25: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:42,854 INFO L280 TraceCheckUtils]: 26: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:42,854 INFO L263 TraceCheckUtils]: 27: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,855 INFO L280 TraceCheckUtils]: 28: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-17 22:06:42,855 INFO L280 TraceCheckUtils]: 29: Hoare triple {2944#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,856 INFO L280 TraceCheckUtils]: 30: Hoare triple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-17 22:06:42,857 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2945#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2728#true} #44#return; {2942#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,857 INFO L280 TraceCheckUtils]: 32: Hoare triple {2942#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,858 INFO L280 TraceCheckUtils]: 33: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,859 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,859 INFO L280 TraceCheckUtils]: 35: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,860 INFO L263 TraceCheckUtils]: 36: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,860 INFO L280 TraceCheckUtils]: 37: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,861 INFO L280 TraceCheckUtils]: 38: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,861 INFO L280 TraceCheckUtils]: 39: Hoare triple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:42,863 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2932#(<= 2 |ackermann_#t~ret1|)} #48#return; {2937#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:42,863 INFO L280 TraceCheckUtils]: 41: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,864 INFO L280 TraceCheckUtils]: 42: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,865 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:42,865 INFO L280 TraceCheckUtils]: 44: Hoare triple {2919#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,866 INFO L280 TraceCheckUtils]: 45: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:42,867 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,868 INFO L280 TraceCheckUtils]: 47: Hoare triple {2883#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:42,868 INFO L263 TraceCheckUtils]: 48: Hoare triple {2883#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,868 INFO L280 TraceCheckUtils]: 49: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,869 INFO L280 TraceCheckUtils]: 50: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,870 INFO L280 TraceCheckUtils]: 51: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,870 INFO L263 TraceCheckUtils]: 52: Hoare triple {2948#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:42,870 INFO L280 TraceCheckUtils]: 53: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:42,870 INFO L280 TraceCheckUtils]: 54: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-17 22:06:42,870 INFO L280 TraceCheckUtils]: 55: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:42,871 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,872 INFO L280 TraceCheckUtils]: 57: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,872 INFO L280 TraceCheckUtils]: 58: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume true; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-17 22:06:42,874 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {2948#(= 0 |ackermann_#in~n|)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-17 22:06:42,874 INFO L280 TraceCheckUtils]: 60: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2729#false} is VALID [2020-07-17 22:06:42,874 INFO L280 TraceCheckUtils]: 61: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-17 22:06:42,874 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2729#false} {2728#true} #46#return; {2847#(<= 2 ackermann_~m)} is VALID [2020-07-17 22:06:42,875 INFO L280 TraceCheckUtils]: 63: Hoare triple {2847#(<= 2 ackermann_~m)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2847#(<= 2 ackermann_~m)} is VALID [2020-07-17 22:06:42,875 INFO L263 TraceCheckUtils]: 64: Hoare triple {2847#(<= 2 ackermann_~m)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:42,876 INFO L280 TraceCheckUtils]: 65: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2953#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,876 INFO L280 TraceCheckUtils]: 66: Hoare triple {2953#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,877 INFO L280 TraceCheckUtils]: 67: Hoare triple {2954#(= 0 |ackermann_#in~m|)} assume true; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-17 22:06:42,878 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2954#(= 0 |ackermann_#in~m|)} {2847#(<= 2 ackermann_~m)} #48#return; {2729#false} is VALID [2020-07-17 22:06:42,878 INFO L280 TraceCheckUtils]: 69: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2729#false} is VALID [2020-07-17 22:06:42,879 INFO L280 TraceCheckUtils]: 70: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-17 22:06:42,879 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2729#false} {2728#true} #50#return; {2729#false} is VALID [2020-07-17 22:06:42,879 INFO L280 TraceCheckUtils]: 72: Hoare triple {2729#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {2729#false} is VALID [2020-07-17 22:06:42,879 INFO L280 TraceCheckUtils]: 73: Hoare triple {2729#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2729#false} is VALID [2020-07-17 22:06:42,880 INFO L280 TraceCheckUtils]: 74: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2020-07-17 22:06:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 83 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-07-17 22:06:42,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689406648] [2020-07-17 22:06:42,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421845618] [2020-07-17 22:06:42,885 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:42,925 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-17 22:06:42,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:06:42,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-17 22:06:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:42,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:43,167 INFO L263 TraceCheckUtils]: 0: Hoare triple {2728#true} call ULTIMATE.init(); {2728#true} is VALID [2020-07-17 22:06:43,167 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:43,168 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2728#true} {2728#true} #40#return; {2728#true} is VALID [2020-07-17 22:06:43,168 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret6 := main(); {2728#true} is VALID [2020-07-17 22:06:43,168 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {2728#true} is VALID [2020-07-17 22:06:43,169 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2728#true} is VALID [2020-07-17 22:06:43,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume !(~n~0 < 0 || ~n~0 > 23); {2728#true} is VALID [2020-07-17 22:06:43,169 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2728#true} is VALID [2020-07-17 22:06:43,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:43,169 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:43,170 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:43,170 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:43,170 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:43,170 INFO L280 TraceCheckUtils]: 13: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:43,170 INFO L280 TraceCheckUtils]: 14: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:43,171 INFO L263 TraceCheckUtils]: 15: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:43,171 INFO L280 TraceCheckUtils]: 16: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:43,171 INFO L280 TraceCheckUtils]: 17: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:43,171 INFO L280 TraceCheckUtils]: 18: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:43,171 INFO L263 TraceCheckUtils]: 19: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:43,172 INFO L280 TraceCheckUtils]: 20: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:43,172 INFO L280 TraceCheckUtils]: 21: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:43,172 INFO L280 TraceCheckUtils]: 22: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-17 22:06:43,172 INFO L263 TraceCheckUtils]: 23: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-17 22:06:43,172 INFO L280 TraceCheckUtils]: 24: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:43,172 INFO L280 TraceCheckUtils]: 25: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-17 22:06:43,173 INFO L280 TraceCheckUtils]: 26: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-17 22:06:43,173 INFO L263 TraceCheckUtils]: 27: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:43,173 INFO L280 TraceCheckUtils]: 28: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {3042#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:43,174 INFO L280 TraceCheckUtils]: 29: Hoare triple {3042#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:43,175 INFO L280 TraceCheckUtils]: 30: Hoare triple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:43,176 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2728#true} #44#return; {2942#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:43,176 INFO L280 TraceCheckUtils]: 32: Hoare triple {2942#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:43,177 INFO L280 TraceCheckUtils]: 33: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-17 22:06:43,178 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:43,178 INFO L280 TraceCheckUtils]: 35: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:43,178 INFO L263 TraceCheckUtils]: 36: Hoare triple {2932#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:43,179 INFO L280 TraceCheckUtils]: 37: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {3042#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:43,180 INFO L280 TraceCheckUtils]: 38: Hoare triple {3042#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:43,180 INFO L280 TraceCheckUtils]: 39: Hoare triple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-17 22:06:43,181 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2947#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2932#(<= 2 |ackermann_#t~ret1|)} #48#return; {2937#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-17 22:06:43,182 INFO L280 TraceCheckUtils]: 41: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:43,182 INFO L280 TraceCheckUtils]: 42: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:43,183 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-17 22:06:43,184 INFO L280 TraceCheckUtils]: 44: Hoare triple {2919#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:43,184 INFO L280 TraceCheckUtils]: 45: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-17 22:06:43,185 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:43,185 INFO L280 TraceCheckUtils]: 47: Hoare triple {2883#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-17 22:06:43,186 INFO L263 TraceCheckUtils]: 48: Hoare triple {2883#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-17 22:06:43,186 INFO L280 TraceCheckUtils]: 49: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {3042#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:43,187 INFO L280 TraceCheckUtils]: 50: Hoare triple {3042#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {3042#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-17 22:06:43,187 INFO L280 TraceCheckUtils]: 51: Hoare triple {3042#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {3112#(<= |ackermann_#in~n| 0)} is VALID [2020-07-17 22:06:43,187 INFO L263 TraceCheckUtils]: 52: Hoare triple {3112#(<= |ackermann_#in~n| 0)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-17 22:06:43,188 INFO L280 TraceCheckUtils]: 53: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-17 22:06:43,188 INFO L280 TraceCheckUtils]: 54: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-17 22:06:43,188 INFO L280 TraceCheckUtils]: 55: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-17 22:06:43,189 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2728#true} {3112#(<= |ackermann_#in~n| 0)} #44#return; {3112#(<= |ackermann_#in~n| 0)} is VALID [2020-07-17 22:06:43,189 INFO L280 TraceCheckUtils]: 57: Hoare triple {3112#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {3112#(<= |ackermann_#in~n| 0)} is VALID [2020-07-17 22:06:43,190 INFO L280 TraceCheckUtils]: 58: Hoare triple {3112#(<= |ackermann_#in~n| 0)} assume true; {3112#(<= |ackermann_#in~n| 0)} is VALID [2020-07-17 22:06:43,191 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {3112#(<= |ackermann_#in~n| 0)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-17 22:06:43,191 INFO L280 TraceCheckUtils]: 60: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2729#false} is VALID [2020-07-17 22:06:43,191 INFO L280 TraceCheckUtils]: 61: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-17 22:06:43,191 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2729#false} {2728#true} #46#return; {2729#false} is VALID [2020-07-17 22:06:43,191 INFO L280 TraceCheckUtils]: 63: Hoare triple {2729#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2729#false} is VALID [2020-07-17 22:06:43,192 INFO L263 TraceCheckUtils]: 64: Hoare triple {2729#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2729#false} is VALID [2020-07-17 22:06:43,192 INFO L280 TraceCheckUtils]: 65: Hoare triple {2729#false} ~m := #in~m;~n := #in~n; {2729#false} is VALID [2020-07-17 22:06:43,192 INFO L280 TraceCheckUtils]: 66: Hoare triple {2729#false} assume 0 == ~m;#res := 1 + ~n; {2729#false} is VALID [2020-07-17 22:06:43,192 INFO L280 TraceCheckUtils]: 67: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-17 22:06:43,192 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2729#false} {2729#false} #48#return; {2729#false} is VALID [2020-07-17 22:06:43,192 INFO L280 TraceCheckUtils]: 69: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret1;havoc #t~ret2; {2729#false} is VALID [2020-07-17 22:06:43,193 INFO L280 TraceCheckUtils]: 70: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-17 22:06:43,193 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2729#false} {2728#true} #50#return; {2729#false} is VALID [2020-07-17 22:06:43,193 INFO L280 TraceCheckUtils]: 72: Hoare triple {2729#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {2729#false} is VALID [2020-07-17 22:06:43,193 INFO L280 TraceCheckUtils]: 73: Hoare triple {2729#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2729#false} is VALID [2020-07-17 22:06:43,193 INFO L280 TraceCheckUtils]: 74: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2020-07-17 22:06:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 97 proven. 37 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-17 22:06:43,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:43,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 19 [2020-07-17 22:06:43,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033866897] [2020-07-17 22:06:43,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2020-07-17 22:06:43,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:43,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:06:43,269 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-17 22:06:43,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:06:43,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:06:43,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:06:43,271 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand 19 states. [2020-07-17 22:06:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:45,264 INFO L93 Difference]: Finished difference Result 101 states and 206 transitions. [2020-07-17 22:06:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 22:06:45,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2020-07-17 22:06:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:06:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2020-07-17 22:06:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:06:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2020-07-17 22:06:45,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 89 transitions. [2020-07-17 22:06:45,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:45,392 INFO L225 Difference]: With dead ends: 101 [2020-07-17 22:06:45,392 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:06:45,394 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2020-07-17 22:06:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:06:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:06:45,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:45,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:06:45,395 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:06:45,395 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:06:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:45,396 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:06:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:06:45,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:45,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:45,396 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:06:45,396 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:06:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:45,397 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:06:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:06:45,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:45,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:45,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:45,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:06:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:06:45,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2020-07-17 22:06:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:45,398 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:06:45,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:06:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:06:45,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:45,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:45,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:06:46,116 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2020-07-17 22:06:46,199 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:06:46,199 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:06:46,200 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:06:46,200 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:06:46,200 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:06:46,200 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:06:46,200 INFO L268 CegarLoopResult]: For program point ackermannEXIT(lines 15 23) no Hoare annotation was computed. [2020-07-17 22:06:46,200 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-17 22:06:46,200 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-07-17 22:06:46,201 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-17 22:06:46,201 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= 0 |ackermann_#in~m|)) (= 0 |ackermann_#in~n|)) [2020-07-17 22:06:46,202 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (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 (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse3))))) [2020-07-17 22:06:46,202 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-17 22:06:46,202 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-17 22:06:46,203 INFO L268 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-07-17 22:06:46,203 INFO L268 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2020-07-17 22:06:46,203 INFO L268 CegarLoopResult]: For program point ackermannFINAL(lines 15 23) no Hoare annotation was computed. [2020-07-17 22:06:46,203 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2020-07-17 22:06:46,203 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2020-07-17 22:06:46,203 INFO L268 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2020-07-17 22:06:46,204 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 26 46) no Hoare annotation was computed. [2020-07-17 22:06:46,204 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 26 46) no Hoare annotation was computed. [2020-07-17 22:06:46,204 INFO L268 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-07-17 22:06:46,204 INFO L268 CegarLoopResult]: For program point L41(lines 41 45) no Hoare annotation was computed. [2020-07-17 22:06:46,204 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-17 22:06:46,204 INFO L268 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-07-17 22:06:46,205 INFO L268 CegarLoopResult]: For program point L34(lines 34 39) no Hoare annotation was computed. [2020-07-17 22:06:46,210 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:06:46,210 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:06:46,210 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:06:46,210 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:06:46,210 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:06:46,210 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:06:46,210 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: ackermannFINAL has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:06:46,211 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-17 22:06:46,212 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-17 22:06:46,213 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-17 22:06:46,213 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-17 22:06:46,213 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:06:46,213 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:06:46,213 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:06:46,213 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:06:46,213 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:06:46,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:06:46 BoogieIcfgContainer [2020-07-17 22:06:46,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:06:46,219 INFO L168 Benchmark]: Toolchain (without parser) took 16160.26 ms. Allocated memory was 138.9 MB in the beginning and 366.0 MB in the end (delta: 227.0 MB). Free memory was 103.4 MB in the beginning and 237.8 MB in the end (delta: -134.4 MB). Peak memory consumption was 92.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:46,220 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:06:46,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.80 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 93.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:46,225 INFO L168 Benchmark]: Boogie Preprocessor took 30.17 ms. Allocated memory is still 138.9 MB. Free memory was 93.2 MB in the beginning and 91.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:46,225 INFO L168 Benchmark]: RCFGBuilder took 464.70 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 91.8 MB in the beginning and 164.1 MB in the end (delta: -72.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:46,226 INFO L168 Benchmark]: TraceAbstraction took 15430.23 ms. Allocated memory was 204.5 MB in the beginning and 366.0 MB in the end (delta: 161.5 MB). Free memory was 163.5 MB in the beginning and 237.8 MB in the end (delta: -74.4 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:46,234 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 227.80 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 93.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.17 ms. Allocated memory is still 138.9 MB. Free memory was 93.2 MB in the beginning and 91.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 464.70 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 91.8 MB in the beginning and 164.1 MB in the end (delta: -72.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15430.23 ms. Allocated memory was 204.5 MB in the beginning and 366.0 MB in the end (delta: 161.5 MB). Free memory was 163.5 MB in the beginning and 237.8 MB in the end (delta: -74.4 MB). Peak memory consumption was 87.1 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.7s, OverallIterations: 8, TraceHistogramMax: 10, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 177 SDtfs, 198 SDslu, 822 SDs, 0 SdLazy, 1529 SolverSat, 322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 125 PreInvPairs, 152 NumberOfFragments, 80 HoareAnnotationTreeSize, 125 FomulaSimplifications, 8790 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 619 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 605 ConstructedInterpolants, 0 QuantifiedInterpolants, 55401 SizeOfPredicates, 19 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 872/1034 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...