/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-8fc6572 [2020-07-10 14:42:57,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:57,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:57,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:57,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:57,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:57,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:57,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:57,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:57,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:57,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:57,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:57,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:57,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:57,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:57,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:57,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:57,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:57,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:57,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:57,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:57,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:57,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:57,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:57,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:57,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:57,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:57,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:57,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:57,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:57,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:57,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:57,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:57,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:57,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:57,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:57,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:57,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:57,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:57,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:57,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:57,284 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-10 14:42:57,298 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:57,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:57,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:57,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:57,301 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:57,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:57,301 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:57,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:57,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:57,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:57,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:57,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:57,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:57,302 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:57,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:57,303 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:57,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:57,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:57,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:57,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:57,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:57,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:57,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:57,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:57,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:57,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:57,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:57,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:57,305 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:57,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:57,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:57,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:57,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:57,629 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:57,629 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:57,630 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-10 14:42:57,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4e313c4/61a17d0720a1473ea69fe6dbd94437c8/FLAG16c5e9a17 [2020-07-10 14:42:58,178 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:58,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-07-10 14:42:58,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4e313c4/61a17d0720a1473ea69fe6dbd94437c8/FLAG16c5e9a17 [2020-07-10 14:42:58,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4e313c4/61a17d0720a1473ea69fe6dbd94437c8 [2020-07-10 14:42:58,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:58,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:58,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:58,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:58,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:58,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e73a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58, skipping insertion in model container [2020-07-10 14:42:58,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:58,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:58,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:58,774 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:58,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:58,811 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:58,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58 WrapperNode [2020-07-10 14:42:58,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:58,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:58,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:58,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:58,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (1/1) ... [2020-07-10 14:42:58,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:58,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:58,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:58,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:58,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (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-10 14:42:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-10 14:42:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:42:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-10 14:42:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:59,368 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:59,369 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:42:59,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:59 BoogieIcfgContainer [2020-07-10 14:42:59,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:59,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:59,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:59,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:59,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:58" (1/3) ... [2020-07-10 14:42:59,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b33f6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:59, skipping insertion in model container [2020-07-10 14:42:59,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:58" (2/3) ... [2020-07-10 14:42:59,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b33f6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:59, skipping insertion in model container [2020-07-10 14:42:59,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:59" (3/3) ... [2020-07-10 14:42:59,382 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-07-10 14:42:59,393 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:59,401 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:59,415 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:59,439 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:59,439 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:59,439 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:59,439 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:59,439 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:59,440 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:59,440 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:59,440 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-10 14:42:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 14:42:59,466 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:59,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:59,468 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:59,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1796234678, now seen corresponding path program 1 times [2020-07-10 14:42:59,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:59,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433800454] [2020-07-10 14:42:59,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:59,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 14:42:59,727 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #40#return; {30#true} is VALID [2020-07-10 14:42:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:59,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~m := #in~m;~n := #in~n; {41#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:42:59,800 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-10 14:42:59,801 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-10 14:42:59,804 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-10 14:42:59,805 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-10 14:42:59,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 14:42:59,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #40#return; {30#true} is VALID [2020-07-10 14:42:59,806 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret6 := main(); {30#true} is VALID [2020-07-10 14:42:59,807 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-10 14:42:59,807 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-10 14:42:59,809 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#true} assume !(~n~0 < 0 || ~n~0 > 23); {34#(<= 0 main_~n~0)} is VALID [2020-07-10 14:42:59,809 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-10 14:42:59,810 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#true} ~m := #in~m;~n := #in~n; {41#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:42:59,812 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-10 14:42:59,813 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-10 14:42:59,815 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-10 14:42:59,817 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-10 14:42:59,818 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-10 14:42:59,819 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-10 14:42:59,821 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-10 14:42:59,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433800454] [2020-07-10 14:42:59,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:59,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:42:59,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386333753] [2020-07-10 14:42:59,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-10 14:42:59,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:59,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:42:59,874 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-10 14:42:59,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:42:59,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:59,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:42:59,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:42:59,888 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 7 states. [2020-07-10 14:43:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:00,387 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2020-07-10 14:43:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:43:00,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-10 14:43:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:43:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2020-07-10 14:43:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:43:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2020-07-10 14:43:00,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2020-07-10 14:43:00,485 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-10 14:43:00,498 INFO L225 Difference]: With dead ends: 41 [2020-07-10 14:43:00,498 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 14:43:00,502 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-10 14:43:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 14:43:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 14:43:00,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:00,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 14:43:00,556 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 14:43:00,556 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 14:43:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:00,564 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-07-10 14:43:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-10 14:43:00,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:00,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:00,566 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 14:43:00,566 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 14:43:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:00,571 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-07-10 14:43:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-10 14:43:00,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:00,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:00,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:00,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 14:43:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-07-10 14:43:00,580 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 15 [2020-07-10 14:43:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:00,581 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-10 14:43:00,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:43:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-10 14:43:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:43:00,583 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:00,583 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-10 14:43:00,584 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:43:00,584 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash -895156504, now seen corresponding path program 1 times [2020-07-10 14:43:00,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:00,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784485195] [2020-07-10 14:43:00,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:00,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {185#true} assume true; {185#true} is VALID [2020-07-10 14:43:00,691 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {185#true} {185#true} #40#return; {185#true} is VALID [2020-07-10 14:43:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:00,822 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-10 14:43:00,824 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-10 14:43:00,824 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-10 14:43:00,826 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-10 14:43:00,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {185#true} ~m := #in~m;~n := #in~n; {185#true} is VALID [2020-07-10 14:43:00,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#true} assume !(0 == ~m); {185#true} is VALID [2020-07-10 14:43:00,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {185#true} assume 0 == ~n; {185#true} is VALID [2020-07-10 14:43:00,827 INFO L263 TraceCheckUtils]: 3: Hoare triple {185#true} call #t~ret0 := ackermann(~m - 1, 1); {185#true} is VALID [2020-07-10 14:43:00,828 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-10 14:43:00,829 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-10 14:43:00,830 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-10 14:43:00,831 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-10 14:43:00,832 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-10 14:43:00,833 INFO L280 TraceCheckUtils]: 9: Hoare triple {207#(<= 2 |ackermann_#res|)} assume true; {207#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:00,834 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {207#(<= 2 |ackermann_#res|)} {185#true} #50#return; {200#(<= 2 |main_#t~ret5|)} is VALID [2020-07-10 14:43:00,835 INFO L263 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {185#true} is VALID [2020-07-10 14:43:00,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2020-07-10 14:43:00,836 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #40#return; {185#true} is VALID [2020-07-10 14:43:00,836 INFO L263 TraceCheckUtils]: 3: Hoare triple {185#true} call #t~ret6 := main(); {185#true} is VALID [2020-07-10 14:43:00,837 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-10 14:43:00,837 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-10 14:43:00,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~n~0 < 0 || ~n~0 > 23); {185#true} is VALID [2020-07-10 14:43:00,837 INFO L263 TraceCheckUtils]: 7: Hoare triple {185#true} call #t~ret5 := ackermann(~m~0, ~n~0); {185#true} is VALID [2020-07-10 14:43:00,838 INFO L280 TraceCheckUtils]: 8: Hoare triple {185#true} ~m := #in~m;~n := #in~n; {185#true} is VALID [2020-07-10 14:43:00,838 INFO L280 TraceCheckUtils]: 9: Hoare triple {185#true} assume !(0 == ~m); {185#true} is VALID [2020-07-10 14:43:00,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {185#true} assume 0 == ~n; {185#true} is VALID [2020-07-10 14:43:00,839 INFO L263 TraceCheckUtils]: 11: Hoare triple {185#true} call #t~ret0 := ackermann(~m - 1, 1); {185#true} is VALID [2020-07-10 14:43:00,840 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-10 14:43:00,841 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-10 14:43:00,841 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-10 14:43:00,843 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-10 14:43:00,844 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-10 14:43:00,845 INFO L280 TraceCheckUtils]: 17: Hoare triple {207#(<= 2 |ackermann_#res|)} assume true; {207#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:00,846 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {207#(<= 2 |ackermann_#res|)} {185#true} #50#return; {200#(<= 2 |main_#t~ret5|)} is VALID [2020-07-10 14:43:00,847 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-10 14:43:00,848 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-10 14:43:00,848 INFO L280 TraceCheckUtils]: 21: Hoare triple {186#false} assume !false; {186#false} is VALID [2020-07-10 14:43:00,849 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-10 14:43:00,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784485195] [2020-07-10 14:43:00,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:00,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 14:43:00,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729550507] [2020-07-10 14:43:00,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-10 14:43:00,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:00,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 14:43:00,882 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-10 14:43:00,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 14:43:00,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 14:43:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 14:43:00,883 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 8 states. [2020-07-10 14:43:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:01,373 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-10 14:43:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:43:01,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-10 14:43:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:43:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 14:43:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:43:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 14:43:01,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-10 14:43:01,437 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-10 14:43:01,440 INFO L225 Difference]: With dead ends: 32 [2020-07-10 14:43:01,441 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 14:43:01,442 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-10 14:43:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 14:43:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-10 14:43:01,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:01,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-10 14:43:01,460 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-10 14:43:01,460 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-10 14:43:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:01,464 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-10 14:43:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-10 14:43:01,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:01,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:01,466 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-10 14:43:01,467 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-10 14:43:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:01,470 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-10 14:43:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-10 14:43:01,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:01,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:01,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:01,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 14:43:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-07-10 14:43:01,476 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 22 [2020-07-10 14:43:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:01,476 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-10 14:43:01,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 14:43:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-10 14:43:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 14:43:01,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:01,478 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-10 14:43:01,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:43:01,479 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash 408363011, now seen corresponding path program 1 times [2020-07-10 14:43:01,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:01,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402425431] [2020-07-10 14:43:01,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-10 14:43:01,519 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {351#true} {351#true} #40#return; {351#true} is VALID [2020-07-10 14:43:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {381#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,566 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-10 14:43:01,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#(= 0 |ackermann_#in~m|)} assume true; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,568 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {382#(= 0 |ackermann_#in~m|)} {372#(not (= ackermann_~m 0))} #46#return; {352#false} is VALID [2020-07-10 14:43:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-10 14:43:01,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} assume 0 == ~m;#res := 1 + ~n; {351#true} is VALID [2020-07-10 14:43:01,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-10 14:43:01,577 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {351#true} {352#false} #48#return; {352#false} is VALID [2020-07-10 14:43:01,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-10 14:43:01,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} assume !(0 == ~m); {372#(not (= ackermann_~m 0))} is VALID [2020-07-10 14:43:01,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {372#(not (= ackermann_~m 0))} assume !(0 == ~n); {372#(not (= ackermann_~m 0))} is VALID [2020-07-10 14:43:01,579 INFO L263 TraceCheckUtils]: 3: Hoare triple {372#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {351#true} is VALID [2020-07-10 14:43:01,580 INFO L280 TraceCheckUtils]: 4: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {381#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,581 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-10 14:43:01,581 INFO L280 TraceCheckUtils]: 6: Hoare triple {382#(= 0 |ackermann_#in~m|)} assume true; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,583 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {382#(= 0 |ackermann_#in~m|)} {372#(not (= ackermann_~m 0))} #46#return; {352#false} is VALID [2020-07-10 14:43:01,583 INFO L280 TraceCheckUtils]: 8: Hoare triple {352#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {352#false} is VALID [2020-07-10 14:43:01,583 INFO L263 TraceCheckUtils]: 9: Hoare triple {352#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {351#true} is VALID [2020-07-10 14:43:01,584 INFO L280 TraceCheckUtils]: 10: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-10 14:43:01,584 INFO L280 TraceCheckUtils]: 11: Hoare triple {351#true} assume 0 == ~m;#res := 1 + ~n; {351#true} is VALID [2020-07-10 14:43:01,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-10 14:43:01,585 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {351#true} {352#false} #48#return; {352#false} is VALID [2020-07-10 14:43:01,585 INFO L280 TraceCheckUtils]: 14: Hoare triple {352#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {352#false} is VALID [2020-07-10 14:43:01,585 INFO L280 TraceCheckUtils]: 15: Hoare triple {352#false} assume true; {352#false} is VALID [2020-07-10 14:43:01,586 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {352#false} {351#true} #50#return; {352#false} is VALID [2020-07-10 14:43:01,586 INFO L263 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2020-07-10 14:43:01,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-10 14:43:01,587 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {351#true} {351#true} #40#return; {351#true} is VALID [2020-07-10 14:43:01,587 INFO L263 TraceCheckUtils]: 3: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2020-07-10 14:43:01,588 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-10 14:43:01,588 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-10 14:43:01,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {351#true} assume !(~n~0 < 0 || ~n~0 > 23); {351#true} is VALID [2020-07-10 14:43:01,588 INFO L263 TraceCheckUtils]: 7: Hoare triple {351#true} call #t~ret5 := ackermann(~m~0, ~n~0); {351#true} is VALID [2020-07-10 14:43:01,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-10 14:43:01,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {351#true} assume !(0 == ~m); {372#(not (= ackermann_~m 0))} is VALID [2020-07-10 14:43:01,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {372#(not (= ackermann_~m 0))} assume !(0 == ~n); {372#(not (= ackermann_~m 0))} is VALID [2020-07-10 14:43:01,590 INFO L263 TraceCheckUtils]: 11: Hoare triple {372#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {351#true} is VALID [2020-07-10 14:43:01,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {381#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,592 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-10 14:43:01,593 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#(= 0 |ackermann_#in~m|)} assume true; {382#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,594 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {382#(= 0 |ackermann_#in~m|)} {372#(not (= ackermann_~m 0))} #46#return; {352#false} is VALID [2020-07-10 14:43:01,594 INFO L280 TraceCheckUtils]: 16: Hoare triple {352#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {352#false} is VALID [2020-07-10 14:43:01,595 INFO L263 TraceCheckUtils]: 17: Hoare triple {352#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {351#true} is VALID [2020-07-10 14:43:01,595 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-10 14:43:01,595 INFO L280 TraceCheckUtils]: 19: Hoare triple {351#true} assume 0 == ~m;#res := 1 + ~n; {351#true} is VALID [2020-07-10 14:43:01,595 INFO L280 TraceCheckUtils]: 20: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-10 14:43:01,596 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {351#true} {352#false} #48#return; {352#false} is VALID [2020-07-10 14:43:01,596 INFO L280 TraceCheckUtils]: 22: Hoare triple {352#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {352#false} is VALID [2020-07-10 14:43:01,596 INFO L280 TraceCheckUtils]: 23: Hoare triple {352#false} assume true; {352#false} is VALID [2020-07-10 14:43:01,597 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {352#false} {351#true} #50#return; {352#false} is VALID [2020-07-10 14:43:01,597 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-10 14:43:01,597 INFO L280 TraceCheckUtils]: 26: Hoare triple {352#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {352#false} is VALID [2020-07-10 14:43:01,597 INFO L280 TraceCheckUtils]: 27: Hoare triple {352#false} assume !false; {352#false} is VALID [2020-07-10 14:43:01,599 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-10 14:43:01,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402425431] [2020-07-10 14:43:01,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499569158] [2020-07-10 14:43:01,600 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-10 14:43:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:43:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:01,800 INFO L263 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2020-07-10 14:43:01,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} assume true; {351#true} is VALID [2020-07-10 14:43:01,800 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {351#true} {351#true} #40#return; {351#true} is VALID [2020-07-10 14:43:01,801 INFO L263 TraceCheckUtils]: 3: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2020-07-10 14:43:01,801 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-10 14:43:01,801 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-10 14:43:01,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {351#true} assume !(~n~0 < 0 || ~n~0 > 23); {351#true} is VALID [2020-07-10 14:43:01,802 INFO L263 TraceCheckUtils]: 7: Hoare triple {351#true} call #t~ret5 := ackermann(~m~0, ~n~0); {351#true} is VALID [2020-07-10 14:43:01,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {351#true} is VALID [2020-07-10 14:43:01,802 INFO L280 TraceCheckUtils]: 9: Hoare triple {351#true} assume !(0 == ~m); {351#true} is VALID [2020-07-10 14:43:01,803 INFO L280 TraceCheckUtils]: 10: Hoare triple {351#true} assume !(0 == ~n); {351#true} is VALID [2020-07-10 14:43:01,803 INFO L263 TraceCheckUtils]: 11: Hoare triple {351#true} call #t~ret1 := ackermann(~m, ~n - 1); {351#true} is VALID [2020-07-10 14:43:01,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {422#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2020-07-10 14:43:01,805 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-10 14:43:01,806 INFO L280 TraceCheckUtils]: 14: Hoare triple {426#(<= |ackermann_#in~m| 0)} assume true; {426#(<= |ackermann_#in~m| 0)} is VALID [2020-07-10 14:43:01,807 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {426#(<= |ackermann_#in~m| 0)} {351#true} #46#return; {433#(<= ackermann_~m 0)} is VALID [2020-07-10 14:43:01,808 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-10 14:43:01,808 INFO L263 TraceCheckUtils]: 17: Hoare triple {433#(<= ackermann_~m 0)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {351#true} is VALID [2020-07-10 14:43:01,809 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#true} ~m := #in~m;~n := #in~n; {443#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,810 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-10 14:43:01,811 INFO L280 TraceCheckUtils]: 20: Hoare triple {447#(<= 0 |ackermann_#in~m|)} assume true; {447#(<= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,812 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {447#(<= 0 |ackermann_#in~m|)} {433#(<= ackermann_~m 0)} #48#return; {352#false} is VALID [2020-07-10 14:43:01,812 INFO L280 TraceCheckUtils]: 22: Hoare triple {352#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {352#false} is VALID [2020-07-10 14:43:01,813 INFO L280 TraceCheckUtils]: 23: Hoare triple {352#false} assume true; {352#false} is VALID [2020-07-10 14:43:01,813 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {352#false} {351#true} #50#return; {352#false} is VALID [2020-07-10 14:43:01,813 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-10 14:43:01,814 INFO L280 TraceCheckUtils]: 26: Hoare triple {352#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {352#false} is VALID [2020-07-10 14:43:01,814 INFO L280 TraceCheckUtils]: 27: Hoare triple {352#false} assume !false; {352#false} is VALID [2020-07-10 14:43:01,815 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-10 14:43:01,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:01,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2020-07-10 14:43:01,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979861601] [2020-07-10 14:43:01,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-10 14:43:01,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:01,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:43:01,861 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-10 14:43:01,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:43:01,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:01,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:43:01,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:43:01,862 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 10 states. [2020-07-10 14:43:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:02,467 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2020-07-10 14:43:02,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:43:02,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-10 14:43:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:43:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-10 14:43:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:43:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-10 14:43:02,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2020-07-10 14:43:02,569 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-10 14:43:02,575 INFO L225 Difference]: With dead ends: 51 [2020-07-10 14:43:02,576 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 14:43:02,577 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-10 14:43:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 14:43:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-07-10 14:43:02,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:02,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 28 states. [2020-07-10 14:43:02,605 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 28 states. [2020-07-10 14:43:02,605 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 28 states. [2020-07-10 14:43:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:02,613 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-07-10 14:43:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2020-07-10 14:43:02,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:02,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:02,618 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 33 states. [2020-07-10 14:43:02,618 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 33 states. [2020-07-10 14:43:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:02,628 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-07-10 14:43:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2020-07-10 14:43:02,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:02,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:02,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:02,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 14:43:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-10 14:43:02,634 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 28 [2020-07-10 14:43:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:02,635 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-10 14:43:02,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:43:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-10 14:43:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 14:43:02,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:02,639 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-10 14:43:02,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:43:02,841 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:02,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:02,842 INFO L82 PathProgramCache]: Analyzing trace with hash 718507263, now seen corresponding path program 1 times [2020-07-10 14:43:02,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:02,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799018690] [2020-07-10 14:43:02,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:02,959 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 14:43:02,960 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {651#true} {651#true} #40#return; {651#true} is VALID [2020-07-10 14:43:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:03,159 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-10 14:43:03,160 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-10 14:43:03,161 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-10 14:43:03,162 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-10 14:43:03,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-10 14:43:03,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-10 14:43:03,163 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume 0 == ~n; {651#true} is VALID [2020-07-10 14:43:03,163 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret0 := ackermann(~m - 1, 1); {651#true} is VALID [2020-07-10 14:43:03,164 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-10 14:43:03,165 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-10 14:43:03,166 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-10 14:43:03,167 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-10 14:43:03,168 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-10 14:43:03,169 INFO L280 TraceCheckUtils]: 9: Hoare triple {704#(<= 2 |ackermann_#res|)} assume true; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,170 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {704#(<= 2 |ackermann_#res|)} {651#true} #46#return; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:03,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {707#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,210 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-10 14:43:03,210 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-10 14:43:03,212 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-10 14:43:03,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-10 14:43:03,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-10 14:43:03,213 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume !(0 == ~n); {651#true} is VALID [2020-07-10 14:43:03,213 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := ackermann(~m, ~n - 1); {651#true} is VALID [2020-07-10 14:43:03,213 INFO L280 TraceCheckUtils]: 4: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-10 14:43:03,213 INFO L280 TraceCheckUtils]: 5: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-10 14:43:03,214 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#true} assume 0 == ~n; {651#true} is VALID [2020-07-10 14:43:03,214 INFO L263 TraceCheckUtils]: 7: Hoare triple {651#true} call #t~ret0 := ackermann(~m - 1, 1); {651#true} is VALID [2020-07-10 14:43:03,215 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-10 14:43:03,216 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-10 14:43:03,216 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-10 14:43:03,217 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-10 14:43:03,218 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-10 14:43:03,219 INFO L280 TraceCheckUtils]: 13: Hoare triple {704#(<= 2 |ackermann_#res|)} assume true; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,220 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {704#(<= 2 |ackermann_#res|)} {651#true} #46#return; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:03,221 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-10 14:43:03,221 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-10 14:43:03,222 INFO L280 TraceCheckUtils]: 17: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {707#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,222 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-10 14:43:03,223 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-10 14:43:03,224 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-10 14:43:03,225 INFO L280 TraceCheckUtils]: 21: Hoare triple {697#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,226 INFO L280 TraceCheckUtils]: 22: Hoare triple {698#(<= 3 |ackermann_#res|)} assume true; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,227 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {698#(<= 3 |ackermann_#res|)} {651#true} #50#return; {679#(<= 3 |main_#t~ret5|)} is VALID [2020-07-10 14:43:03,228 INFO L263 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2020-07-10 14:43:03,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 14:43:03,228 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #40#return; {651#true} is VALID [2020-07-10 14:43:03,229 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret6 := main(); {651#true} is VALID [2020-07-10 14:43:03,229 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-10 14:43:03,229 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-10 14:43:03,229 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#true} assume !(~n~0 < 0 || ~n~0 > 23); {651#true} is VALID [2020-07-10 14:43:03,229 INFO L263 TraceCheckUtils]: 7: Hoare triple {651#true} call #t~ret5 := ackermann(~m~0, ~n~0); {651#true} is VALID [2020-07-10 14:43:03,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-10 14:43:03,230 INFO L280 TraceCheckUtils]: 9: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-10 14:43:03,230 INFO L280 TraceCheckUtils]: 10: Hoare triple {651#true} assume !(0 == ~n); {651#true} is VALID [2020-07-10 14:43:03,230 INFO L263 TraceCheckUtils]: 11: Hoare triple {651#true} call #t~ret1 := ackermann(~m, ~n - 1); {651#true} is VALID [2020-07-10 14:43:03,231 INFO L280 TraceCheckUtils]: 12: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-10 14:43:03,231 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-10 14:43:03,231 INFO L280 TraceCheckUtils]: 14: Hoare triple {651#true} assume 0 == ~n; {651#true} is VALID [2020-07-10 14:43:03,231 INFO L263 TraceCheckUtils]: 15: Hoare triple {651#true} call #t~ret0 := ackermann(~m - 1, 1); {651#true} is VALID [2020-07-10 14:43:03,232 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-10 14:43:03,233 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-10 14:43:03,234 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-10 14:43:03,235 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-10 14:43:03,236 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-10 14:43:03,236 INFO L280 TraceCheckUtils]: 21: Hoare triple {704#(<= 2 |ackermann_#res|)} assume true; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,238 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {704#(<= 2 |ackermann_#res|)} {651#true} #46#return; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:03,238 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-10 14:43:03,239 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-10 14:43:03,239 INFO L280 TraceCheckUtils]: 25: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {707#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,240 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-10 14:43:03,241 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-10 14:43:03,242 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-10 14:43:03,243 INFO L280 TraceCheckUtils]: 29: Hoare triple {697#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,243 INFO L280 TraceCheckUtils]: 30: Hoare triple {698#(<= 3 |ackermann_#res|)} assume true; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,244 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {698#(<= 3 |ackermann_#res|)} {651#true} #50#return; {679#(<= 3 |main_#t~ret5|)} is VALID [2020-07-10 14:43:03,245 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-10 14:43:03,246 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-10 14:43:03,246 INFO L280 TraceCheckUtils]: 34: Hoare triple {652#false} assume !false; {652#false} is VALID [2020-07-10 14:43:03,248 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-10 14:43:03,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799018690] [2020-07-10 14:43:03,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634853090] [2020-07-10 14:43:03,248 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-10 14:43:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:03,279 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 14:43:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:03,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:03,442 INFO L263 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2020-07-10 14:43:03,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2020-07-10 14:43:03,443 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #40#return; {651#true} is VALID [2020-07-10 14:43:03,443 INFO L263 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret6 := main(); {651#true} is VALID [2020-07-10 14:43:03,444 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-10 14:43:03,444 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-10 14:43:03,444 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#true} assume !(~n~0 < 0 || ~n~0 > 23); {651#true} is VALID [2020-07-10 14:43:03,444 INFO L263 TraceCheckUtils]: 7: Hoare triple {651#true} call #t~ret5 := ackermann(~m~0, ~n~0); {651#true} is VALID [2020-07-10 14:43:03,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-10 14:43:03,445 INFO L280 TraceCheckUtils]: 9: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-10 14:43:03,445 INFO L280 TraceCheckUtils]: 10: Hoare triple {651#true} assume !(0 == ~n); {651#true} is VALID [2020-07-10 14:43:03,445 INFO L263 TraceCheckUtils]: 11: Hoare triple {651#true} call #t~ret1 := ackermann(~m, ~n - 1); {651#true} is VALID [2020-07-10 14:43:03,445 INFO L280 TraceCheckUtils]: 12: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {651#true} is VALID [2020-07-10 14:43:03,446 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#true} assume !(0 == ~m); {651#true} is VALID [2020-07-10 14:43:03,446 INFO L280 TraceCheckUtils]: 14: Hoare triple {651#true} assume 0 == ~n; {651#true} is VALID [2020-07-10 14:43:03,446 INFO L263 TraceCheckUtils]: 15: Hoare triple {651#true} call #t~ret0 := ackermann(~m - 1, 1); {651#true} is VALID [2020-07-10 14:43:03,447 INFO L280 TraceCheckUtils]: 16: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {760#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:03,448 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-10 14:43:03,449 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-10 14:43:03,451 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-10 14:43:03,452 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-10 14:43:03,453 INFO L280 TraceCheckUtils]: 21: Hoare triple {704#(<= 2 |ackermann_#res|)} assume true; {704#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,454 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {704#(<= 2 |ackermann_#res|)} {651#true} #46#return; {692#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:03,455 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-10 14:43:03,455 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-10 14:43:03,456 INFO L280 TraceCheckUtils]: 25: Hoare triple {651#true} ~m := #in~m;~n := #in~n; {760#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:03,457 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-10 14:43:03,457 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-10 14:43:03,459 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-10 14:43:03,460 INFO L280 TraceCheckUtils]: 29: Hoare triple {697#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,460 INFO L280 TraceCheckUtils]: 30: Hoare triple {698#(<= 3 |ackermann_#res|)} assume true; {698#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:03,461 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {698#(<= 3 |ackermann_#res|)} {651#true} #50#return; {679#(<= 3 |main_#t~ret5|)} is VALID [2020-07-10 14:43:03,462 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-10 14:43:03,463 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-10 14:43:03,463 INFO L280 TraceCheckUtils]: 34: Hoare triple {652#false} assume !false; {652#false} is VALID [2020-07-10 14:43:03,465 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-10 14:43:03,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:03,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2020-07-10 14:43:03,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087792148] [2020-07-10 14:43:03,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-10 14:43:03,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:03,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 14:43:03,511 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-10 14:43:03,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 14:43:03,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:03,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 14:43:03,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-10 14:43:03,512 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 14 states. [2020-07-10 14:43:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:05,126 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2020-07-10 14:43:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 14:43:05,126 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-10 14:43:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:43:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2020-07-10 14:43:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:43:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2020-07-10 14:43:05,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2020-07-10 14:43:05,263 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-10 14:43:05,272 INFO L225 Difference]: With dead ends: 54 [2020-07-10 14:43:05,272 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 14:43:05,276 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-10 14:43:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 14:43:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2020-07-10 14:43:05,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:05,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 36 states. [2020-07-10 14:43:05,311 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 36 states. [2020-07-10 14:43:05,311 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 36 states. [2020-07-10 14:43:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:05,319 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2020-07-10 14:43:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2020-07-10 14:43:05,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:05,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:05,320 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 50 states. [2020-07-10 14:43:05,321 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 50 states. [2020-07-10 14:43:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:05,327 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2020-07-10 14:43:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2020-07-10 14:43:05,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:05,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:05,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:05,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 14:43:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-07-10 14:43:05,333 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 35 [2020-07-10 14:43:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:05,333 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-07-10 14:43:05,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 14:43:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-07-10 14:43:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 14:43:05,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:05,335 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-10 14:43:05,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:05,551 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:05,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:05,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1711672813, now seen corresponding path program 2 times [2020-07-10 14:43:05,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:05,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752740870] [2020-07-10 14:43:05,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} assume true; {1051#true} is VALID [2020-07-10 14:43:05,619 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1051#true} {1051#true} #40#return; {1051#true} is VALID [2020-07-10 14:43:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,807 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-10 14:43:05,808 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-10 14:43:05,809 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-10 14:43:05,810 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-10 14:43:05,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-10 14:43:05,811 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-10 14:43:05,812 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-10 14:43:05,813 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-10 14:43:05,814 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-10 14:43:05,815 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-10 14:43:05,817 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-10 14:43:05,817 INFO L280 TraceCheckUtils]: 9: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,819 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:05,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1139#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:05,884 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-10 14:43:05,885 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-10 14:43:05,887 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-10 14:43:05,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {1051#true} assume !(0 == ~n); {1051#true} is VALID [2020-07-10 14:43:05,888 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret1 := ackermann(~m, ~n - 1); {1051#true} is VALID [2020-07-10 14:43:05,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,889 INFO L280 TraceCheckUtils]: 5: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,889 INFO L280 TraceCheckUtils]: 6: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-10 14:43:05,890 INFO L263 TraceCheckUtils]: 7: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-10 14:43:05,891 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-10 14:43:05,892 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-10 14:43:05,893 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-10 14:43:05,894 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-10 14:43:05,895 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-10 14:43:05,896 INFO L280 TraceCheckUtils]: 13: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,897 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:05,898 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-10 14:43:05,898 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-10 14:43:05,899 INFO L280 TraceCheckUtils]: 17: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1139#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:05,900 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-10 14:43:05,900 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-10 14:43:05,901 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-10 14:43:05,902 INFO L280 TraceCheckUtils]: 21: Hoare triple {1130#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,903 INFO L280 TraceCheckUtils]: 22: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,904 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #44#return; {1112#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:05,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-10 14:43:05,906 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-10 14:43:05,906 INFO L280 TraceCheckUtils]: 4: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,907 INFO L280 TraceCheckUtils]: 5: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,907 INFO L280 TraceCheckUtils]: 6: Hoare triple {1051#true} assume !(0 == ~n); {1051#true} is VALID [2020-07-10 14:43:05,908 INFO L263 TraceCheckUtils]: 7: Hoare triple {1051#true} call #t~ret1 := ackermann(~m, ~n - 1); {1051#true} is VALID [2020-07-10 14:43:05,908 INFO L280 TraceCheckUtils]: 8: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,908 INFO L280 TraceCheckUtils]: 9: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,908 INFO L280 TraceCheckUtils]: 10: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-10 14:43:05,909 INFO L263 TraceCheckUtils]: 11: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-10 14:43:05,910 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-10 14:43:05,910 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-10 14:43:05,911 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-10 14:43:05,912 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-10 14:43:05,920 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-10 14:43:05,921 INFO L280 TraceCheckUtils]: 17: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,923 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:05,924 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-10 14:43:05,924 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-10 14:43:05,925 INFO L280 TraceCheckUtils]: 21: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1139#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:05,925 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-10 14:43:05,926 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-10 14:43:05,927 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-10 14:43:05,928 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,929 INFO L280 TraceCheckUtils]: 26: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,930 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #44#return; {1112#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:05,930 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-10 14:43:05,931 INFO L280 TraceCheckUtils]: 29: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,932 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #50#return; {1086#(<= 3 |main_#t~ret5|)} is VALID [2020-07-10 14:43:05,934 INFO L263 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2020-07-10 14:43:05,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume true; {1051#true} is VALID [2020-07-10 14:43:05,934 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1051#true} {1051#true} #40#return; {1051#true} is VALID [2020-07-10 14:43:05,934 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret6 := main(); {1051#true} is VALID [2020-07-10 14:43:05,935 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-10 14:43:05,935 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-10 14:43:05,935 INFO L280 TraceCheckUtils]: 6: Hoare triple {1051#true} assume !(~n~0 < 0 || ~n~0 > 23); {1051#true} is VALID [2020-07-10 14:43:05,936 INFO L263 TraceCheckUtils]: 7: Hoare triple {1051#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1051#true} is VALID [2020-07-10 14:43:05,936 INFO L280 TraceCheckUtils]: 8: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,937 INFO L280 TraceCheckUtils]: 9: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,937 INFO L280 TraceCheckUtils]: 10: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-10 14:43:05,937 INFO L263 TraceCheckUtils]: 11: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-10 14:43:05,937 INFO L280 TraceCheckUtils]: 12: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,937 INFO L280 TraceCheckUtils]: 13: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,938 INFO L280 TraceCheckUtils]: 14: Hoare triple {1051#true} assume !(0 == ~n); {1051#true} is VALID [2020-07-10 14:43:05,938 INFO L263 TraceCheckUtils]: 15: Hoare triple {1051#true} call #t~ret1 := ackermann(~m, ~n - 1); {1051#true} is VALID [2020-07-10 14:43:05,938 INFO L280 TraceCheckUtils]: 16: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:05,938 INFO L280 TraceCheckUtils]: 17: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:05,939 INFO L280 TraceCheckUtils]: 18: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-10 14:43:05,939 INFO L263 TraceCheckUtils]: 19: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-10 14:43:05,940 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-10 14:43:05,940 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-10 14:43:05,941 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-10 14:43:05,942 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-10 14:43:05,943 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-10 14:43:05,943 INFO L280 TraceCheckUtils]: 25: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,944 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:05,945 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-10 14:43:05,945 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-10 14:43:05,946 INFO L280 TraceCheckUtils]: 29: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1139#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:05,947 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-10 14:43:05,947 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-10 14:43:05,949 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-10 14:43:05,949 INFO L280 TraceCheckUtils]: 33: Hoare triple {1130#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,950 INFO L280 TraceCheckUtils]: 34: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,953 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #44#return; {1112#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:05,953 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-10 14:43:05,954 INFO L280 TraceCheckUtils]: 37: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:05,955 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #50#return; {1086#(<= 3 |main_#t~ret5|)} is VALID [2020-07-10 14:43:05,956 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-10 14:43:05,956 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-10 14:43:05,957 INFO L280 TraceCheckUtils]: 41: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2020-07-10 14:43:05,961 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-10 14:43:05,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752740870] [2020-07-10 14:43:05,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557776273] [2020-07-10 14:43:05,962 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-10 14:43:06,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:43:06,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:06,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 14:43:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:06,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:06,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2020-07-10 14:43:06,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {1051#true} assume true; {1051#true} is VALID [2020-07-10 14:43:06,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1051#true} {1051#true} #40#return; {1051#true} is VALID [2020-07-10 14:43:06,197 INFO L263 TraceCheckUtils]: 3: Hoare triple {1051#true} call #t~ret6 := main(); {1051#true} is VALID [2020-07-10 14:43:06,197 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-10 14:43:06,197 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-10 14:43:06,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {1051#true} assume !(~n~0 < 0 || ~n~0 > 23); {1051#true} is VALID [2020-07-10 14:43:06,198 INFO L263 TraceCheckUtils]: 7: Hoare triple {1051#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1051#true} is VALID [2020-07-10 14:43:06,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:06,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:06,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-10 14:43:06,199 INFO L263 TraceCheckUtils]: 11: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-10 14:43:06,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:06,199 INFO L280 TraceCheckUtils]: 13: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:06,199 INFO L280 TraceCheckUtils]: 14: Hoare triple {1051#true} assume !(0 == ~n); {1051#true} is VALID [2020-07-10 14:43:06,200 INFO L263 TraceCheckUtils]: 15: Hoare triple {1051#true} call #t~ret1 := ackermann(~m, ~n - 1); {1051#true} is VALID [2020-07-10 14:43:06,200 INFO L280 TraceCheckUtils]: 16: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1051#true} is VALID [2020-07-10 14:43:06,200 INFO L280 TraceCheckUtils]: 17: Hoare triple {1051#true} assume !(0 == ~m); {1051#true} is VALID [2020-07-10 14:43:06,200 INFO L280 TraceCheckUtils]: 18: Hoare triple {1051#true} assume 0 == ~n; {1051#true} is VALID [2020-07-10 14:43:06,201 INFO L263 TraceCheckUtils]: 19: Hoare triple {1051#true} call #t~ret0 := ackermann(~m - 1, 1); {1051#true} is VALID [2020-07-10 14:43:06,202 INFO L280 TraceCheckUtils]: 20: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1204#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:06,203 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-10 14:43:06,203 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-10 14:43:06,205 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-10 14:43:06,205 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-10 14:43:06,206 INFO L280 TraceCheckUtils]: 25: Hoare triple {1136#(<= 2 |ackermann_#res|)} assume true; {1136#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:06,207 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1136#(<= 2 |ackermann_#res|)} {1051#true} #46#return; {1125#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:06,208 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-10 14:43:06,208 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-10 14:43:06,209 INFO L280 TraceCheckUtils]: 29: Hoare triple {1051#true} ~m := #in~m;~n := #in~n; {1204#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:06,210 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-10 14:43:06,210 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-10 14:43:06,212 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-10 14:43:06,213 INFO L280 TraceCheckUtils]: 33: Hoare triple {1130#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:06,214 INFO L280 TraceCheckUtils]: 34: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:06,215 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #44#return; {1112#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:06,216 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-10 14:43:06,216 INFO L280 TraceCheckUtils]: 37: Hoare triple {1113#(<= 3 |ackermann_#res|)} assume true; {1113#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:06,218 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1113#(<= 3 |ackermann_#res|)} {1051#true} #50#return; {1086#(<= 3 |main_#t~ret5|)} is VALID [2020-07-10 14:43:06,218 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-10 14:43:06,219 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-10 14:43:06,219 INFO L280 TraceCheckUtils]: 41: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2020-07-10 14:43:06,221 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-10 14:43:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:06,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2020-07-10 14:43:06,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220249401] [2020-07-10 14:43:06,223 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-10 14:43:06,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:06,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 14:43:06,267 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-10 14:43:06,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 14:43:06,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 14:43:06,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:43:06,268 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 15 states. [2020-07-10 14:43:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:07,871 INFO L93 Difference]: Finished difference Result 65 states and 116 transitions. [2020-07-10 14:43:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 14:43:07,871 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-10 14:43:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:43:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2020-07-10 14:43:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:43:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2020-07-10 14:43:07,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2020-07-10 14:43:07,977 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-10 14:43:07,983 INFO L225 Difference]: With dead ends: 65 [2020-07-10 14:43:07,983 INFO L226 Difference]: Without dead ends: 61 [2020-07-10 14:43:07,984 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-10 14:43:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-10 14:43:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 34. [2020-07-10 14:43:08,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:08,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 34 states. [2020-07-10 14:43:08,021 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 34 states. [2020-07-10 14:43:08,022 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 34 states. [2020-07-10 14:43:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:08,029 INFO L93 Difference]: Finished difference Result 61 states and 111 transitions. [2020-07-10 14:43:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. [2020-07-10 14:43:08,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:08,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:08,031 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 61 states. [2020-07-10 14:43:08,031 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 61 states. [2020-07-10 14:43:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:08,039 INFO L93 Difference]: Finished difference Result 61 states and 111 transitions. [2020-07-10 14:43:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. [2020-07-10 14:43:08,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:08,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:08,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:08,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 14:43:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2020-07-10 14:43:08,044 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 42 [2020-07-10 14:43:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:08,044 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2020-07-10 14:43:08,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 14:43:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2020-07-10 14:43:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 14:43:08,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:08,046 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-10 14:43:08,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:08,253 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:08,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1051926487, now seen corresponding path program 3 times [2020-07-10 14:43:08,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:08,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319586223] [2020-07-10 14:43:08,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-10 14:43:08,303 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1539#true} {1539#true} #40#return; {1539#true} is VALID [2020-07-10 14:43:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,414 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-10 14:43:08,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,415 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-10 14:43:08,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,416 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-10 14:43:08,416 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-10 14:43:08,416 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-10 14:43:08,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,417 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-10 14:43:08,418 INFO L280 TraceCheckUtils]: 6: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,418 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-10 14:43:08,419 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-10 14:43:08,420 INFO L280 TraceCheckUtils]: 9: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume true; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:08,421 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1602#(<= |ackermann_#in~m| 1)} {1539#true} #46#return; {1585#(<= ackermann_~m 1)} is VALID [2020-07-10 14:43:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,449 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,450 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-10 14:43:08,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,452 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-10 14:43:08,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,453 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-10 14:43:08,453 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-10 14:43:08,454 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-10 14:43:08,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,455 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-10 14:43:08,455 INFO L280 TraceCheckUtils]: 6: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,456 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-10 14:43:08,457 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-10 14:43:08,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume true; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,459 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1608#(<= 1 |ackermann_#in~m|)} {1585#(<= ackermann_~m 1)} #48#return; {1540#false} is VALID [2020-07-10 14:43:08,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-10 14:43:08,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-10 14:43:08,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {1539#true} assume !(0 == ~n); {1539#true} is VALID [2020-07-10 14:43:08,460 INFO L263 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret1 := ackermann(~m, ~n - 1); {1539#true} is VALID [2020-07-10 14:43:08,460 INFO L280 TraceCheckUtils]: 4: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,461 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-10 14:43:08,461 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-10 14:43:08,462 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-10 14:43:08,462 INFO L280 TraceCheckUtils]: 8: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,463 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-10 14:43:08,463 INFO L280 TraceCheckUtils]: 10: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,464 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-10 14:43:08,465 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-10 14:43:08,465 INFO L280 TraceCheckUtils]: 13: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume true; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:08,466 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1602#(<= |ackermann_#in~m| 1)} {1539#true} #46#return; {1585#(<= ackermann_~m 1)} is VALID [2020-07-10 14:43:08,467 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-10 14:43:08,467 INFO L263 TraceCheckUtils]: 16: Hoare triple {1585#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1539#true} is VALID [2020-07-10 14:43:08,468 INFO L280 TraceCheckUtils]: 17: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,468 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-10 14:43:08,469 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-10 14:43:08,469 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-10 14:43:08,469 INFO L280 TraceCheckUtils]: 21: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,470 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-10 14:43:08,470 INFO L280 TraceCheckUtils]: 23: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,471 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-10 14:43:08,472 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-10 14:43:08,472 INFO L280 TraceCheckUtils]: 26: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume true; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,473 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1608#(<= 1 |ackermann_#in~m|)} {1585#(<= ackermann_~m 1)} #48#return; {1540#false} is VALID [2020-07-10 14:43:08,474 INFO L280 TraceCheckUtils]: 28: Hoare triple {1540#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1540#false} is VALID [2020-07-10 14:43:08,474 INFO L280 TraceCheckUtils]: 29: Hoare triple {1540#false} assume true; {1540#false} is VALID [2020-07-10 14:43:08,474 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1540#false} {1539#true} #50#return; {1540#false} is VALID [2020-07-10 14:43:08,475 INFO L263 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2020-07-10 14:43:08,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-10 14:43:08,476 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1539#true} {1539#true} #40#return; {1539#true} is VALID [2020-07-10 14:43:08,476 INFO L263 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret6 := main(); {1539#true} is VALID [2020-07-10 14:43:08,476 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-10 14:43:08,476 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-10 14:43:08,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {1539#true} assume !(~n~0 < 0 || ~n~0 > 23); {1539#true} is VALID [2020-07-10 14:43:08,477 INFO L263 TraceCheckUtils]: 7: Hoare triple {1539#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1539#true} is VALID [2020-07-10 14:43:08,477 INFO L280 TraceCheckUtils]: 8: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-10 14:43:08,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-10 14:43:08,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {1539#true} assume !(0 == ~n); {1539#true} is VALID [2020-07-10 14:43:08,477 INFO L263 TraceCheckUtils]: 11: Hoare triple {1539#true} call #t~ret1 := ackermann(~m, ~n - 1); {1539#true} is VALID [2020-07-10 14:43:08,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,479 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-10 14:43:08,479 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-10 14:43:08,479 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-10 14:43:08,480 INFO L280 TraceCheckUtils]: 16: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,481 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-10 14:43:08,481 INFO L280 TraceCheckUtils]: 18: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,482 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-10 14:43:08,483 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-10 14:43:08,483 INFO L280 TraceCheckUtils]: 21: Hoare triple {1602#(<= |ackermann_#in~m| 1)} assume true; {1602#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:08,484 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1602#(<= |ackermann_#in~m| 1)} {1539#true} #46#return; {1585#(<= ackermann_~m 1)} is VALID [2020-07-10 14:43:08,485 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-10 14:43:08,485 INFO L263 TraceCheckUtils]: 24: Hoare triple {1585#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1539#true} is VALID [2020-07-10 14:43:08,486 INFO L280 TraceCheckUtils]: 25: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,486 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-10 14:43:08,486 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-10 14:43:08,487 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-10 14:43:08,487 INFO L280 TraceCheckUtils]: 29: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1597#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,490 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-10 14:43:08,493 INFO L280 TraceCheckUtils]: 31: Hoare triple {1603#(= 0 |ackermann_#in~m|)} assume true; {1603#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,495 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-10 14:43:08,496 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-10 14:43:08,496 INFO L280 TraceCheckUtils]: 34: Hoare triple {1608#(<= 1 |ackermann_#in~m|)} assume true; {1608#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:08,498 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1608#(<= 1 |ackermann_#in~m|)} {1585#(<= ackermann_~m 1)} #48#return; {1540#false} is VALID [2020-07-10 14:43:08,498 INFO L280 TraceCheckUtils]: 36: Hoare triple {1540#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1540#false} is VALID [2020-07-10 14:43:08,498 INFO L280 TraceCheckUtils]: 37: Hoare triple {1540#false} assume true; {1540#false} is VALID [2020-07-10 14:43:08,498 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1540#false} {1539#true} #50#return; {1540#false} is VALID [2020-07-10 14:43:08,498 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-10 14:43:08,499 INFO L280 TraceCheckUtils]: 40: Hoare triple {1540#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1540#false} is VALID [2020-07-10 14:43:08,499 INFO L280 TraceCheckUtils]: 41: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2020-07-10 14:43:08,501 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-10 14:43:08,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319586223] [2020-07-10 14:43:08,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695654809] [2020-07-10 14:43:08,501 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) [2020-07-10 14:43:08,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 14:43:08,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:08,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 14:43:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:08,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:08,737 INFO L263 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2020-07-10 14:43:08,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-10 14:43:08,737 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1539#true} {1539#true} #40#return; {1539#true} is VALID [2020-07-10 14:43:08,737 INFO L263 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret6 := main(); {1539#true} is VALID [2020-07-10 14:43:08,738 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-10 14:43:08,738 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-10 14:43:08,738 INFO L280 TraceCheckUtils]: 6: Hoare triple {1539#true} assume !(~n~0 < 0 || ~n~0 > 23); {1539#true} is VALID [2020-07-10 14:43:08,738 INFO L263 TraceCheckUtils]: 7: Hoare triple {1539#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1539#true} is VALID [2020-07-10 14:43:08,738 INFO L280 TraceCheckUtils]: 8: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-10 14:43:08,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-10 14:43:08,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {1539#true} assume !(0 == ~n); {1539#true} is VALID [2020-07-10 14:43:08,739 INFO L263 TraceCheckUtils]: 11: Hoare triple {1539#true} call #t~ret1 := ackermann(~m, ~n - 1); {1539#true} is VALID [2020-07-10 14:43:08,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-10 14:43:08,739 INFO L280 TraceCheckUtils]: 13: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-10 14:43:08,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {1539#true} assume 0 == ~n; {1539#true} is VALID [2020-07-10 14:43:08,739 INFO L263 TraceCheckUtils]: 15: Hoare triple {1539#true} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-10 14:43:08,739 INFO L280 TraceCheckUtils]: 16: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-10 14:43:08,739 INFO L280 TraceCheckUtils]: 17: Hoare triple {1539#true} assume 0 == ~m;#res := 1 + ~n; {1539#true} is VALID [2020-07-10 14:43:08,740 INFO L280 TraceCheckUtils]: 18: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-10 14:43:08,740 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1539#true} {1539#true} #44#return; {1539#true} is VALID [2020-07-10 14:43:08,740 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-10 14:43:08,740 INFO L280 TraceCheckUtils]: 21: Hoare triple {1539#true} assume true; {1539#true} is VALID [2020-07-10 14:43:08,740 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1539#true} {1539#true} #46#return; {1539#true} is VALID [2020-07-10 14:43:08,741 INFO L280 TraceCheckUtils]: 23: Hoare triple {1539#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1539#true} is VALID [2020-07-10 14:43:08,741 INFO L263 TraceCheckUtils]: 24: Hoare triple {1539#true} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1539#true} is VALID [2020-07-10 14:43:08,741 INFO L280 TraceCheckUtils]: 25: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1539#true} is VALID [2020-07-10 14:43:08,741 INFO L280 TraceCheckUtils]: 26: Hoare triple {1539#true} assume !(0 == ~m); {1539#true} is VALID [2020-07-10 14:43:08,741 INFO L280 TraceCheckUtils]: 27: Hoare triple {1539#true} assume 0 == ~n; {1539#true} is VALID [2020-07-10 14:43:08,742 INFO L263 TraceCheckUtils]: 28: Hoare triple {1539#true} call #t~ret0 := ackermann(~m - 1, 1); {1539#true} is VALID [2020-07-10 14:43:08,746 INFO L280 TraceCheckUtils]: 29: Hoare triple {1539#true} ~m := #in~m;~n := #in~n; {1699#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:08,747 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-10 14:43:08,748 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-10 14:43:08,749 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-10 14:43:08,750 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-10 14:43:08,750 INFO L280 TraceCheckUtils]: 34: Hoare triple {1714#(<= 2 |ackermann_#res|)} assume true; {1714#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:08,751 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1714#(<= 2 |ackermann_#res|)} {1539#true} #48#return; {1721#(<= 2 |ackermann_#t~ret2|)} is VALID [2020-07-10 14:43:08,752 INFO L280 TraceCheckUtils]: 36: Hoare triple {1721#(<= 2 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1714#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:08,752 INFO L280 TraceCheckUtils]: 37: Hoare triple {1714#(<= 2 |ackermann_#res|)} assume true; {1714#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:08,753 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1714#(<= 2 |ackermann_#res|)} {1539#true} #50#return; {1731#(<= 2 |main_#t~ret5|)} is VALID [2020-07-10 14:43:08,754 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-10 14:43:08,755 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-10 14:43:08,755 INFO L280 TraceCheckUtils]: 41: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2020-07-10 14:43:08,756 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-10 14:43:08,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:08,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2020-07-10 14:43:08,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779340545] [2020-07-10 14:43:08,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2020-07-10 14:43:08,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:08,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 14:43:08,809 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-10 14:43:08,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 14:43:08,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:08,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 14:43:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2020-07-10 14:43:08,810 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 14 states. [2020-07-10 14:43:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:10,064 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2020-07-10 14:43:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 14:43:10,064 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2020-07-10 14:43:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:43:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2020-07-10 14:43:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:43:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2020-07-10 14:43:10,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2020-07-10 14:43:10,188 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-10 14:43:10,191 INFO L225 Difference]: With dead ends: 81 [2020-07-10 14:43:10,192 INFO L226 Difference]: Without dead ends: 53 [2020-07-10 14:43:10,193 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-10 14:43:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-10 14:43:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-10 14:43:10,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:10,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-10 14:43:10,245 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-10 14:43:10,245 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-10 14:43:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:10,250 INFO L93 Difference]: Finished difference Result 53 states and 81 transitions. [2020-07-10 14:43:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2020-07-10 14:43:10,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:10,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:10,252 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-10 14:43:10,252 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-10 14:43:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:10,260 INFO L93 Difference]: Finished difference Result 53 states and 81 transitions. [2020-07-10 14:43:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2020-07-10 14:43:10,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:10,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:10,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:10,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-10 14:43:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2020-07-10 14:43:10,266 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 42 [2020-07-10 14:43:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:10,267 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2020-07-10 14:43:10,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 14:43:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2020-07-10 14:43:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-10 14:43:10,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:10,272 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-10 14:43:10,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:10,486 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:10,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:10,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1590578612, now seen corresponding path program 4 times [2020-07-10 14:43:10,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:10,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866001389] [2020-07-10 14:43:10,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,512 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2035#true} {2035#true} #40#return; {2035#true} is VALID [2020-07-10 14:43:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,587 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,589 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-10 14:43:10,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,590 INFO L263 TraceCheckUtils]: 3: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,590 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,592 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,592 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-10 14:43:10,593 INFO L280 TraceCheckUtils]: 9: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,594 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,595 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,596 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-10 14:43:10,597 INFO L280 TraceCheckUtils]: 6: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,597 INFO L263 TraceCheckUtils]: 7: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,598 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,598 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,599 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,600 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-10 14:43:10,601 INFO L280 TraceCheckUtils]: 13: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,602 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,602 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-10 14:43:10,603 INFO L280 TraceCheckUtils]: 16: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,603 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,629 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,631 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-10 14:43:10,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,632 INFO L263 TraceCheckUtils]: 3: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,632 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,634 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,635 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-10 14:43:10,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,637 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,638 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,638 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,639 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-10 14:43:10,640 INFO L280 TraceCheckUtils]: 6: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,640 INFO L263 TraceCheckUtils]: 7: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,640 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,640 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,641 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,642 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,643 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-10 14:43:10,643 INFO L280 TraceCheckUtils]: 13: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,645 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,645 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-10 14:43:10,645 INFO L280 TraceCheckUtils]: 16: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,646 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-10 14:43:10,647 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-10 14:43:10,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,647 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,648 INFO L263 TraceCheckUtils]: 7: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,649 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-10 14:43:10,650 INFO L280 TraceCheckUtils]: 10: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,650 INFO L263 TraceCheckUtils]: 11: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,650 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,651 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,651 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,671 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,674 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-10 14:43:10,675 INFO L280 TraceCheckUtils]: 17: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,676 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,676 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-10 14:43:10,676 INFO L280 TraceCheckUtils]: 20: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,677 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,677 INFO L280 TraceCheckUtils]: 22: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-10 14:43:10,677 INFO L263 TraceCheckUtils]: 23: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-10 14:43:10,677 INFO L280 TraceCheckUtils]: 24: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,677 INFO L280 TraceCheckUtils]: 25: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,678 INFO L280 TraceCheckUtils]: 26: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,678 INFO L263 TraceCheckUtils]: 27: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,678 INFO L280 TraceCheckUtils]: 28: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,679 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-10 14:43:10,680 INFO L280 TraceCheckUtils]: 30: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,680 INFO L263 TraceCheckUtils]: 31: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,680 INFO L280 TraceCheckUtils]: 32: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,680 INFO L280 TraceCheckUtils]: 33: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,681 INFO L280 TraceCheckUtils]: 34: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,682 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,682 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-10 14:43:10,683 INFO L280 TraceCheckUtils]: 37: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,684 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,684 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-10 14:43:10,685 INFO L280 TraceCheckUtils]: 40: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,685 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,685 INFO L280 TraceCheckUtils]: 42: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2036#false} is VALID [2020-07-10 14:43:10,685 INFO L280 TraceCheckUtils]: 43: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,686 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,694 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-10 14:43:10,695 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-10 14:43:10,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-10 14:43:10,696 INFO L263 TraceCheckUtils]: 7: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-10 14:43:10,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,696 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,696 INFO L263 TraceCheckUtils]: 11: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,698 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-10 14:43:10,699 INFO L280 TraceCheckUtils]: 14: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,699 INFO L263 TraceCheckUtils]: 15: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,699 INFO L280 TraceCheckUtils]: 16: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,699 INFO L280 TraceCheckUtils]: 17: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,699 INFO L280 TraceCheckUtils]: 18: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,700 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,701 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-10 14:43:10,702 INFO L280 TraceCheckUtils]: 21: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,703 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,703 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-10 14:43:10,703 INFO L280 TraceCheckUtils]: 24: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,703 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,704 INFO L280 TraceCheckUtils]: 26: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-10 14:43:10,704 INFO L263 TraceCheckUtils]: 27: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-10 14:43:10,704 INFO L280 TraceCheckUtils]: 28: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,704 INFO L280 TraceCheckUtils]: 29: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,705 INFO L263 TraceCheckUtils]: 31: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,705 INFO L280 TraceCheckUtils]: 32: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,706 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-10 14:43:10,707 INFO L280 TraceCheckUtils]: 34: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,707 INFO L263 TraceCheckUtils]: 35: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,707 INFO L280 TraceCheckUtils]: 36: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,708 INFO L280 TraceCheckUtils]: 37: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,708 INFO L280 TraceCheckUtils]: 38: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,709 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,709 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-10 14:43:10,710 INFO L280 TraceCheckUtils]: 41: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,711 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,711 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-10 14:43:10,712 INFO L280 TraceCheckUtils]: 44: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,712 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,712 INFO L280 TraceCheckUtils]: 46: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2036#false} is VALID [2020-07-10 14:43:10,712 INFO L280 TraceCheckUtils]: 47: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,712 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,713 INFO L280 TraceCheckUtils]: 49: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-10 14:43:10,713 INFO L263 TraceCheckUtils]: 50: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-10 14:43:10,713 INFO L280 TraceCheckUtils]: 51: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,713 INFO L280 TraceCheckUtils]: 52: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,713 INFO L280 TraceCheckUtils]: 53: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,714 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2035#true} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,714 INFO L280 TraceCheckUtils]: 55: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2036#false} is VALID [2020-07-10 14:43:10,714 INFO L280 TraceCheckUtils]: 56: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,714 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2036#false} {2035#true} #50#return; {2036#false} is VALID [2020-07-10 14:43:10,717 INFO L263 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2035#true} is VALID [2020-07-10 14:43:10,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,718 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2035#true} {2035#true} #40#return; {2035#true} is VALID [2020-07-10 14:43:10,718 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret6 := main(); {2035#true} is VALID [2020-07-10 14:43:10,718 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-10 14:43:10,719 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-10 14:43:10,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !(~n~0 < 0 || ~n~0 > 23); {2035#true} is VALID [2020-07-10 14:43:10,719 INFO L263 TraceCheckUtils]: 7: Hoare triple {2035#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2035#true} is VALID [2020-07-10 14:43:10,719 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,719 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-10 14:43:10,720 INFO L263 TraceCheckUtils]: 11: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-10 14:43:10,720 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,720 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,720 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-10 14:43:10,721 INFO L263 TraceCheckUtils]: 15: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-10 14:43:10,721 INFO L280 TraceCheckUtils]: 16: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,721 INFO L280 TraceCheckUtils]: 17: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,721 INFO L280 TraceCheckUtils]: 18: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,721 INFO L263 TraceCheckUtils]: 19: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,722 INFO L280 TraceCheckUtils]: 20: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,723 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-10 14:43:10,723 INFO L280 TraceCheckUtils]: 22: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,724 INFO L263 TraceCheckUtils]: 23: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,724 INFO L280 TraceCheckUtils]: 24: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,724 INFO L280 TraceCheckUtils]: 25: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,724 INFO L280 TraceCheckUtils]: 26: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,725 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,726 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-10 14:43:10,727 INFO L280 TraceCheckUtils]: 29: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,728 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,728 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-10 14:43:10,728 INFO L280 TraceCheckUtils]: 32: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,729 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,729 INFO L280 TraceCheckUtils]: 34: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-10 14:43:10,729 INFO L263 TraceCheckUtils]: 35: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-10 14:43:10,729 INFO L280 TraceCheckUtils]: 36: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,730 INFO L280 TraceCheckUtils]: 37: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,730 INFO L280 TraceCheckUtils]: 38: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,730 INFO L263 TraceCheckUtils]: 39: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,731 INFO L280 TraceCheckUtils]: 40: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2193#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,731 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-10 14:43:10,732 INFO L280 TraceCheckUtils]: 42: Hoare triple {2193#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,732 INFO L263 TraceCheckUtils]: 43: Hoare triple {2194#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,732 INFO L280 TraceCheckUtils]: 44: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,733 INFO L280 TraceCheckUtils]: 45: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,733 INFO L280 TraceCheckUtils]: 46: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,734 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2035#true} {2194#(= 0 |ackermann_#in~n|)} #44#return; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,734 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-10 14:43:10,735 INFO L280 TraceCheckUtils]: 49: Hoare triple {2194#(= 0 |ackermann_#in~n|)} assume true; {2194#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:10,736 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2194#(= 0 |ackermann_#in~n|)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,736 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-10 14:43:10,736 INFO L280 TraceCheckUtils]: 52: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,737 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,737 INFO L280 TraceCheckUtils]: 54: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2036#false} is VALID [2020-07-10 14:43:10,737 INFO L280 TraceCheckUtils]: 55: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,737 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,737 INFO L280 TraceCheckUtils]: 57: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-10 14:43:10,738 INFO L263 TraceCheckUtils]: 58: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2035#true} is VALID [2020-07-10 14:43:10,738 INFO L280 TraceCheckUtils]: 59: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,738 INFO L280 TraceCheckUtils]: 60: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,738 INFO L280 TraceCheckUtils]: 61: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,738 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2035#true} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,739 INFO L280 TraceCheckUtils]: 63: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2036#false} is VALID [2020-07-10 14:43:10,739 INFO L280 TraceCheckUtils]: 64: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,739 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {2036#false} {2035#true} #50#return; {2036#false} is VALID [2020-07-10 14:43:10,739 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-10 14:43:10,739 INFO L280 TraceCheckUtils]: 67: Hoare triple {2036#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2036#false} is VALID [2020-07-10 14:43:10,740 INFO L280 TraceCheckUtils]: 68: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2020-07-10 14:43:10,744 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-10 14:43:10,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866001389] [2020-07-10 14:43:10,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226110918] [2020-07-10 14:43:10,744 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-10 14:43:10,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 14:43:10,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:10,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 14:43:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:10,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:10,903 INFO L263 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2035#true} is VALID [2020-07-10 14:43:10,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2035#true} {2035#true} #40#return; {2035#true} is VALID [2020-07-10 14:43:10,904 INFO L263 TraceCheckUtils]: 3: Hoare triple {2035#true} call #t~ret6 := main(); {2035#true} is VALID [2020-07-10 14:43:10,904 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-10 14:43:10,904 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-10 14:43:10,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !(~n~0 < 0 || ~n~0 > 23); {2035#true} is VALID [2020-07-10 14:43:10,905 INFO L263 TraceCheckUtils]: 7: Hoare triple {2035#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2035#true} is VALID [2020-07-10 14:43:10,905 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,905 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-10 14:43:10,905 INFO L263 TraceCheckUtils]: 11: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-10 14:43:10,906 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,906 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,906 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#true} assume !(0 == ~n); {2035#true} is VALID [2020-07-10 14:43:10,906 INFO L263 TraceCheckUtils]: 15: Hoare triple {2035#true} call #t~ret1 := ackermann(~m, ~n - 1); {2035#true} is VALID [2020-07-10 14:43:10,906 INFO L280 TraceCheckUtils]: 16: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,906 INFO L280 TraceCheckUtils]: 17: Hoare triple {2035#true} assume !(0 == ~m); {2035#true} is VALID [2020-07-10 14:43:10,907 INFO L280 TraceCheckUtils]: 18: Hoare triple {2035#true} assume 0 == ~n; {2035#true} is VALID [2020-07-10 14:43:10,907 INFO L263 TraceCheckUtils]: 19: Hoare triple {2035#true} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,907 INFO L280 TraceCheckUtils]: 20: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2277#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:10,908 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-10 14:43:10,909 INFO L280 TraceCheckUtils]: 22: Hoare triple {2277#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {2284#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:10,909 INFO L263 TraceCheckUtils]: 23: Hoare triple {2284#(<= |ackermann_#in~n| 0)} call #t~ret0 := ackermann(~m - 1, 1); {2035#true} is VALID [2020-07-10 14:43:10,909 INFO L280 TraceCheckUtils]: 24: Hoare triple {2035#true} ~m := #in~m;~n := #in~n; {2035#true} is VALID [2020-07-10 14:43:10,909 INFO L280 TraceCheckUtils]: 25: Hoare triple {2035#true} assume 0 == ~m;#res := 1 + ~n; {2035#true} is VALID [2020-07-10 14:43:10,909 INFO L280 TraceCheckUtils]: 26: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-10 14:43:10,910 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2035#true} {2284#(<= |ackermann_#in~n| 0)} #44#return; {2284#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:10,911 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-10 14:43:10,911 INFO L280 TraceCheckUtils]: 29: Hoare triple {2284#(<= |ackermann_#in~n| 0)} assume true; {2284#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:10,912 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2284#(<= |ackermann_#in~n| 0)} {2035#true} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,912 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-10 14:43:10,912 INFO L280 TraceCheckUtils]: 32: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,913 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,913 INFO L280 TraceCheckUtils]: 34: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-10 14:43:10,913 INFO L263 TraceCheckUtils]: 35: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2036#false} is VALID [2020-07-10 14:43:10,913 INFO L280 TraceCheckUtils]: 36: Hoare triple {2036#false} ~m := #in~m;~n := #in~n; {2036#false} is VALID [2020-07-10 14:43:10,913 INFO L280 TraceCheckUtils]: 37: Hoare triple {2036#false} assume !(0 == ~m); {2036#false} is VALID [2020-07-10 14:43:10,913 INFO L280 TraceCheckUtils]: 38: Hoare triple {2036#false} assume 0 == ~n; {2036#false} is VALID [2020-07-10 14:43:10,914 INFO L263 TraceCheckUtils]: 39: Hoare triple {2036#false} call #t~ret0 := ackermann(~m - 1, 1); {2036#false} is VALID [2020-07-10 14:43:10,914 INFO L280 TraceCheckUtils]: 40: Hoare triple {2036#false} ~m := #in~m;~n := #in~n; {2036#false} is VALID [2020-07-10 14:43:10,914 INFO L280 TraceCheckUtils]: 41: Hoare triple {2036#false} assume !(0 == ~m); {2036#false} is VALID [2020-07-10 14:43:10,914 INFO L280 TraceCheckUtils]: 42: Hoare triple {2036#false} assume 0 == ~n; {2036#false} is VALID [2020-07-10 14:43:10,914 INFO L263 TraceCheckUtils]: 43: Hoare triple {2036#false} call #t~ret0 := ackermann(~m - 1, 1); {2036#false} is VALID [2020-07-10 14:43:10,915 INFO L280 TraceCheckUtils]: 44: Hoare triple {2036#false} ~m := #in~m;~n := #in~n; {2036#false} is VALID [2020-07-10 14:43:10,915 INFO L280 TraceCheckUtils]: 45: Hoare triple {2036#false} assume 0 == ~m;#res := 1 + ~n; {2036#false} is VALID [2020-07-10 14:43:10,915 INFO L280 TraceCheckUtils]: 46: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,915 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2036#false} {2036#false} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,915 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-10 14:43:10,915 INFO L280 TraceCheckUtils]: 49: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,916 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2036#false} {2036#false} #44#return; {2036#false} is VALID [2020-07-10 14:43:10,916 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-10 14:43:10,916 INFO L280 TraceCheckUtils]: 52: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,916 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,916 INFO L280 TraceCheckUtils]: 54: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2036#false} is VALID [2020-07-10 14:43:10,916 INFO L280 TraceCheckUtils]: 55: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,917 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2036#false} {2035#true} #46#return; {2036#false} is VALID [2020-07-10 14:43:10,917 INFO L280 TraceCheckUtils]: 57: Hoare triple {2036#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2036#false} is VALID [2020-07-10 14:43:10,917 INFO L263 TraceCheckUtils]: 58: Hoare triple {2036#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2036#false} is VALID [2020-07-10 14:43:10,917 INFO L280 TraceCheckUtils]: 59: Hoare triple {2036#false} ~m := #in~m;~n := #in~n; {2036#false} is VALID [2020-07-10 14:43:10,917 INFO L280 TraceCheckUtils]: 60: Hoare triple {2036#false} assume 0 == ~m;#res := 1 + ~n; {2036#false} is VALID [2020-07-10 14:43:10,917 INFO L280 TraceCheckUtils]: 61: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,918 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2036#false} {2036#false} #48#return; {2036#false} is VALID [2020-07-10 14:43:10,918 INFO L280 TraceCheckUtils]: 63: Hoare triple {2036#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2036#false} is VALID [2020-07-10 14:43:10,918 INFO L280 TraceCheckUtils]: 64: Hoare triple {2036#false} assume true; {2036#false} is VALID [2020-07-10 14:43:10,918 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {2036#false} {2035#true} #50#return; {2036#false} is VALID [2020-07-10 14:43:10,918 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-10 14:43:10,919 INFO L280 TraceCheckUtils]: 67: Hoare triple {2036#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2036#false} is VALID [2020-07-10 14:43:10,919 INFO L280 TraceCheckUtils]: 68: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2020-07-10 14:43:10,923 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-10 14:43:10,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:10,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-10 14:43:10,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676890308] [2020-07-10 14:43:10,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2020-07-10 14:43:10,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:10,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:43:10,984 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-10 14:43:10,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:43:10,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:43:10,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:10,985 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 6 states. [2020-07-10 14:43:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:11,193 INFO L93 Difference]: Finished difference Result 101 states and 188 transitions. [2020-07-10 14:43:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:43:11,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2020-07-10 14:43:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2020-07-10 14:43:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2020-07-10 14:43:11,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2020-07-10 14:43:11,259 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-10 14:43:11,263 INFO L225 Difference]: With dead ends: 101 [2020-07-10 14:43:11,264 INFO L226 Difference]: Without dead ends: 56 [2020-07-10 14:43:11,266 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-10 14:43:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-10 14:43:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-10 14:43:11,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:11,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-10 14:43:11,316 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-10 14:43:11,316 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-10 14:43:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:11,323 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-10 14:43:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2020-07-10 14:43:11,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:11,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:11,325 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-10 14:43:11,325 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-10 14:43:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:11,330 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-10 14:43:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2020-07-10 14:43:11,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:11,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:11,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:11,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 14:43:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2020-07-10 14:43:11,338 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 69 [2020-07-10 14:43:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:11,338 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2020-07-10 14:43:11,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:43:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2020-07-10 14:43:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-07-10 14:43:11,340 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:11,340 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-10 14:43:11,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 14:43:11,554 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:11,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:11,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1483482771, now seen corresponding path program 5 times [2020-07-10 14:43:11,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:11,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107076377] [2020-07-10 14:43:11,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:11,598 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2728#true} {2728#true} #40#return; {2728#true} is VALID [2020-07-10 14:43:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,840 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-10 14:43:11,842 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-10 14:43:11,843 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-10 14:43:11,845 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-10 14:43:11,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:11,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:11,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:11,846 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:11,847 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-10 14:43:11,849 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-10 14:43:11,850 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-10 14:43:11,851 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-10 14:43:11,852 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-10 14:43:11,853 INFO L280 TraceCheckUtils]: 9: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:11,855 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:11,908 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-10 14:43:11,909 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-10 14:43:11,911 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-10 14:43:11,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:11,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:11,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:11,913 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:11,914 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:11,914 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:11,914 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:11,915 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:11,916 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-10 14:43:11,917 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-10 14:43:11,918 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-10 14:43:11,920 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-10 14:43:11,921 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-10 14:43:11,922 INFO L280 TraceCheckUtils]: 13: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:11,924 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:11,925 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-10 14:43:11,926 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-10 14:43:11,927 INFO L280 TraceCheckUtils]: 17: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:11,928 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-10 14:43:11,929 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-10 14:43:11,931 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-10 14:43:11,932 INFO L280 TraceCheckUtils]: 21: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:11,933 INFO L280 TraceCheckUtils]: 22: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:11,935 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:11,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:11,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:11,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:11,939 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:11,939 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:11,939 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:11,940 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:11,940 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:11,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:11,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:11,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:11,942 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:11,943 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-10 14:43:11,944 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-10 14:43:11,945 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-10 14:43:11,947 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-10 14:43:11,949 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-10 14:43:11,950 INFO L280 TraceCheckUtils]: 17: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:11,952 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:11,953 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-10 14:43:11,953 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-10 14:43:11,954 INFO L280 TraceCheckUtils]: 21: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:11,955 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-10 14:43:11,956 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-10 14:43:11,959 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-10 14:43:11,960 INFO L280 TraceCheckUtils]: 25: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:11,961 INFO L280 TraceCheckUtils]: 26: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:11,962 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:11,963 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-10 14:43:11,964 INFO L280 TraceCheckUtils]: 29: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:11,965 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:12,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-10 14:43:12,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:12,019 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,024 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-10 14:43:12,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,026 INFO L263 TraceCheckUtils]: 3: Hoare triple {2948#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,026 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,026 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-10 14:43:12,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:12,028 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,029 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-10 14:43:12,030 INFO L280 TraceCheckUtils]: 9: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume true; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,031 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2948#(= 0 |ackermann_#in~n|)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,033 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,034 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,034 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:12,034 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,035 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,035 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,035 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,036 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,037 INFO L280 TraceCheckUtils]: 14: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:12,037 INFO L263 TraceCheckUtils]: 15: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,038 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-10 14:43:12,039 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-10 14:43:12,040 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-10 14:43:12,042 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-10 14:43:12,043 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-10 14:43:12,044 INFO L280 TraceCheckUtils]: 21: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,045 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:12,046 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-10 14:43:12,047 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-10 14:43:12,047 INFO L280 TraceCheckUtils]: 25: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,049 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-10 14:43:12,049 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-10 14:43:12,051 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-10 14:43:12,053 INFO L280 TraceCheckUtils]: 29: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,053 INFO L280 TraceCheckUtils]: 30: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,054 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:12,055 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-10 14:43:12,056 INFO L280 TraceCheckUtils]: 33: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,057 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:12,057 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-10 14:43:12,058 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-10 14:43:12,058 INFO L280 TraceCheckUtils]: 37: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,059 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-10 14:43:12,060 INFO L280 TraceCheckUtils]: 39: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,060 INFO L263 TraceCheckUtils]: 40: Hoare triple {2948#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,060 INFO L280 TraceCheckUtils]: 41: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,060 INFO L280 TraceCheckUtils]: 42: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-10 14:43:12,061 INFO L280 TraceCheckUtils]: 43: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:12,062 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,063 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-10 14:43:12,064 INFO L280 TraceCheckUtils]: 46: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume true; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,065 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2948#(= 0 |ackermann_#in~n|)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,066 INFO L280 TraceCheckUtils]: 48: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2729#false} is VALID [2020-07-10 14:43:12,066 INFO L280 TraceCheckUtils]: 49: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-10 14:43:12,066 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2729#false} {2728#true} #46#return; {2847#(<= 2 ackermann_~m)} is VALID [2020-07-10 14:43:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:12,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2953#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:12,121 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-10 14:43:12,122 INFO L280 TraceCheckUtils]: 2: Hoare triple {2954#(= 0 |ackermann_#in~m|)} assume true; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:12,123 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2954#(= 0 |ackermann_#in~m|)} {2847#(<= 2 ackermann_~m)} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,124 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,125 INFO L280 TraceCheckUtils]: 4: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,125 INFO L280 TraceCheckUtils]: 5: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,125 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,125 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,126 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,126 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,126 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:12,126 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,126 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,126 INFO L280 TraceCheckUtils]: 13: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,127 INFO L280 TraceCheckUtils]: 14: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,127 INFO L263 TraceCheckUtils]: 15: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,127 INFO L280 TraceCheckUtils]: 16: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,127 INFO L280 TraceCheckUtils]: 17: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,128 INFO L280 TraceCheckUtils]: 18: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:12,128 INFO L263 TraceCheckUtils]: 19: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,129 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-10 14:43:12,129 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-10 14:43:12,130 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-10 14:43:12,132 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-10 14:43:12,133 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-10 14:43:12,134 INFO L280 TraceCheckUtils]: 25: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,135 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:12,136 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-10 14:43:12,137 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-10 14:43:12,138 INFO L280 TraceCheckUtils]: 29: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,139 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-10 14:43:12,139 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-10 14:43:12,141 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-10 14:43:12,142 INFO L280 TraceCheckUtils]: 33: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,143 INFO L280 TraceCheckUtils]: 34: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,144 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:12,145 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-10 14:43:12,146 INFO L280 TraceCheckUtils]: 37: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,147 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:12,148 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-10 14:43:12,149 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-10 14:43:12,149 INFO L280 TraceCheckUtils]: 41: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,150 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-10 14:43:12,151 INFO L280 TraceCheckUtils]: 43: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,152 INFO L263 TraceCheckUtils]: 44: Hoare triple {2948#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,152 INFO L280 TraceCheckUtils]: 45: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,152 INFO L280 TraceCheckUtils]: 46: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-10 14:43:12,152 INFO L280 TraceCheckUtils]: 47: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:12,154 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,155 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-10 14:43:12,155 INFO L280 TraceCheckUtils]: 50: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume true; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,157 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2948#(= 0 |ackermann_#in~n|)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,157 INFO L280 TraceCheckUtils]: 52: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2729#false} is VALID [2020-07-10 14:43:12,158 INFO L280 TraceCheckUtils]: 53: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-10 14:43:12,158 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2729#false} {2728#true} #46#return; {2847#(<= 2 ackermann_~m)} is VALID [2020-07-10 14:43:12,159 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-10 14:43:12,159 INFO L263 TraceCheckUtils]: 56: Hoare triple {2847#(<= 2 ackermann_~m)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-10 14:43:12,160 INFO L280 TraceCheckUtils]: 57: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2953#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:12,161 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-10 14:43:12,162 INFO L280 TraceCheckUtils]: 59: Hoare triple {2954#(= 0 |ackermann_#in~m|)} assume true; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:12,163 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {2954#(= 0 |ackermann_#in~m|)} {2847#(<= 2 ackermann_~m)} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,164 INFO L280 TraceCheckUtils]: 61: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2729#false} is VALID [2020-07-10 14:43:12,164 INFO L280 TraceCheckUtils]: 62: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-10 14:43:12,164 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2729#false} {2728#true} #50#return; {2729#false} is VALID [2020-07-10 14:43:12,171 INFO L263 TraceCheckUtils]: 0: Hoare triple {2728#true} call ULTIMATE.init(); {2728#true} is VALID [2020-07-10 14:43:12,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:12,172 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2728#true} {2728#true} #40#return; {2728#true} is VALID [2020-07-10 14:43:12,172 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret6 := main(); {2728#true} is VALID [2020-07-10 14:43:12,172 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-10 14:43:12,173 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-10 14:43:12,173 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume !(~n~0 < 0 || ~n~0 > 23); {2728#true} is VALID [2020-07-10 14:43:12,173 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2728#true} is VALID [2020-07-10 14:43:12,173 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,174 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,174 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,174 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,175 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,175 INFO L280 TraceCheckUtils]: 13: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,175 INFO L280 TraceCheckUtils]: 14: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,176 INFO L263 TraceCheckUtils]: 15: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,176 INFO L280 TraceCheckUtils]: 16: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,176 INFO L280 TraceCheckUtils]: 17: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,177 INFO L280 TraceCheckUtils]: 18: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:12,177 INFO L263 TraceCheckUtils]: 19: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,177 INFO L280 TraceCheckUtils]: 20: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,177 INFO L280 TraceCheckUtils]: 21: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,178 INFO L280 TraceCheckUtils]: 22: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,178 INFO L263 TraceCheckUtils]: 23: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,178 INFO L280 TraceCheckUtils]: 24: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,179 INFO L280 TraceCheckUtils]: 25: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,179 INFO L280 TraceCheckUtils]: 26: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:12,179 INFO L263 TraceCheckUtils]: 27: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,180 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-10 14:43:12,181 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-10 14:43:12,182 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-10 14:43:12,184 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-10 14:43:12,185 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-10 14:43:12,186 INFO L280 TraceCheckUtils]: 33: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,187 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:12,188 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-10 14:43:12,188 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-10 14:43:12,189 INFO L280 TraceCheckUtils]: 37: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,190 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-10 14:43:12,190 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-10 14:43:12,192 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-10 14:43:12,193 INFO L280 TraceCheckUtils]: 41: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,193 INFO L280 TraceCheckUtils]: 42: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,195 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:12,195 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-10 14:43:12,196 INFO L280 TraceCheckUtils]: 45: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,198 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:12,198 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-10 14:43:12,199 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-10 14:43:12,200 INFO L280 TraceCheckUtils]: 49: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2946#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,200 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-10 14:43:12,201 INFO L280 TraceCheckUtils]: 51: Hoare triple {2946#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,202 INFO L263 TraceCheckUtils]: 52: Hoare triple {2948#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,202 INFO L280 TraceCheckUtils]: 53: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,202 INFO L280 TraceCheckUtils]: 54: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-10 14:43:12,203 INFO L280 TraceCheckUtils]: 55: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:12,204 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2728#true} {2948#(= 0 |ackermann_#in~n|)} #44#return; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,205 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-10 14:43:12,206 INFO L280 TraceCheckUtils]: 58: Hoare triple {2948#(= 0 |ackermann_#in~n|)} assume true; {2948#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:12,207 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {2948#(= 0 |ackermann_#in~n|)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,207 INFO L280 TraceCheckUtils]: 60: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2729#false} is VALID [2020-07-10 14:43:12,208 INFO L280 TraceCheckUtils]: 61: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-10 14:43:12,208 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2729#false} {2728#true} #46#return; {2847#(<= 2 ackermann_~m)} is VALID [2020-07-10 14:43:12,209 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-10 14:43:12,209 INFO L263 TraceCheckUtils]: 64: Hoare triple {2847#(<= 2 ackermann_~m)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2728#true} is VALID [2020-07-10 14:43:12,210 INFO L280 TraceCheckUtils]: 65: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2953#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:12,211 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-10 14:43:12,212 INFO L280 TraceCheckUtils]: 67: Hoare triple {2954#(= 0 |ackermann_#in~m|)} assume true; {2954#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:12,213 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2954#(= 0 |ackermann_#in~m|)} {2847#(<= 2 ackermann_~m)} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,214 INFO L280 TraceCheckUtils]: 69: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2729#false} is VALID [2020-07-10 14:43:12,214 INFO L280 TraceCheckUtils]: 70: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-10 14:43:12,214 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2729#false} {2728#true} #50#return; {2729#false} is VALID [2020-07-10 14:43:12,214 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-10 14:43:12,215 INFO L280 TraceCheckUtils]: 73: Hoare triple {2729#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2729#false} is VALID [2020-07-10 14:43:12,215 INFO L280 TraceCheckUtils]: 74: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2020-07-10 14:43:12,223 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-10 14:43:12,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107076377] [2020-07-10 14:43:12,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971197616] [2020-07-10 14:43:12,224 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-10 14:43:12,272 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-10 14:43:12,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:12,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-10 14:43:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:12,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:12,491 INFO L263 TraceCheckUtils]: 0: Hoare triple {2728#true} call ULTIMATE.init(); {2728#true} is VALID [2020-07-10 14:43:12,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:12,492 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2728#true} {2728#true} #40#return; {2728#true} is VALID [2020-07-10 14:43:12,492 INFO L263 TraceCheckUtils]: 3: Hoare triple {2728#true} call #t~ret6 := main(); {2728#true} is VALID [2020-07-10 14:43:12,492 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-10 14:43:12,493 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-10 14:43:12,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {2728#true} assume !(~n~0 < 0 || ~n~0 > 23); {2728#true} is VALID [2020-07-10 14:43:12,493 INFO L263 TraceCheckUtils]: 7: Hoare triple {2728#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2728#true} is VALID [2020-07-10 14:43:12,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,493 INFO L280 TraceCheckUtils]: 9: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,494 INFO L263 TraceCheckUtils]: 11: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,494 INFO L280 TraceCheckUtils]: 13: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,494 INFO L280 TraceCheckUtils]: 14: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,494 INFO L263 TraceCheckUtils]: 15: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,495 INFO L280 TraceCheckUtils]: 17: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,495 INFO L280 TraceCheckUtils]: 18: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:12,495 INFO L263 TraceCheckUtils]: 19: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,495 INFO L280 TraceCheckUtils]: 20: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,496 INFO L280 TraceCheckUtils]: 21: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,496 INFO L280 TraceCheckUtils]: 22: Hoare triple {2728#true} assume !(0 == ~n); {2728#true} is VALID [2020-07-10 14:43:12,496 INFO L263 TraceCheckUtils]: 23: Hoare triple {2728#true} call #t~ret1 := ackermann(~m, ~n - 1); {2728#true} is VALID [2020-07-10 14:43:12,496 INFO L280 TraceCheckUtils]: 24: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,496 INFO L280 TraceCheckUtils]: 25: Hoare triple {2728#true} assume !(0 == ~m); {2728#true} is VALID [2020-07-10 14:43:12,496 INFO L280 TraceCheckUtils]: 26: Hoare triple {2728#true} assume 0 == ~n; {2728#true} is VALID [2020-07-10 14:43:12,497 INFO L263 TraceCheckUtils]: 27: Hoare triple {2728#true} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,498 INFO L280 TraceCheckUtils]: 28: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {3042#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:12,498 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-10 14:43:12,499 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-10 14:43:12,500 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-10 14:43:12,501 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-10 14:43:12,501 INFO L280 TraceCheckUtils]: 33: Hoare triple {2943#(<= 2 |ackermann_#res|)} assume true; {2943#(<= 2 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,502 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2943#(<= 2 |ackermann_#res|)} {2728#true} #46#return; {2932#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:12,503 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-10 14:43:12,503 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-10 14:43:12,504 INFO L280 TraceCheckUtils]: 37: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {3042#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:12,505 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-10 14:43:12,505 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-10 14:43:12,507 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-10 14:43:12,508 INFO L280 TraceCheckUtils]: 41: Hoare triple {2937#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,508 INFO L280 TraceCheckUtils]: 42: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,509 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #44#return; {2919#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-10 14:43:12,510 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-10 14:43:12,511 INFO L280 TraceCheckUtils]: 45: Hoare triple {2920#(<= 3 |ackermann_#res|)} assume true; {2920#(<= 3 |ackermann_#res|)} is VALID [2020-07-10 14:43:12,512 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2920#(<= 3 |ackermann_#res|)} {2728#true} #46#return; {2883#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-10 14:43:12,512 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-10 14:43:12,512 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-10 14:43:12,513 INFO L280 TraceCheckUtils]: 49: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {3042#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:12,514 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-10 14:43:12,514 INFO L280 TraceCheckUtils]: 51: Hoare triple {3042#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {3112#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:12,514 INFO L263 TraceCheckUtils]: 52: Hoare triple {3112#(<= |ackermann_#in~n| 0)} call #t~ret0 := ackermann(~m - 1, 1); {2728#true} is VALID [2020-07-10 14:43:12,515 INFO L280 TraceCheckUtils]: 53: Hoare triple {2728#true} ~m := #in~m;~n := #in~n; {2728#true} is VALID [2020-07-10 14:43:12,515 INFO L280 TraceCheckUtils]: 54: Hoare triple {2728#true} assume 0 == ~m;#res := 1 + ~n; {2728#true} is VALID [2020-07-10 14:43:12,515 INFO L280 TraceCheckUtils]: 55: Hoare triple {2728#true} assume true; {2728#true} is VALID [2020-07-10 14:43:12,516 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2728#true} {3112#(<= |ackermann_#in~n| 0)} #44#return; {3112#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:12,516 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-10 14:43:12,517 INFO L280 TraceCheckUtils]: 58: Hoare triple {3112#(<= |ackermann_#in~n| 0)} assume true; {3112#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:12,518 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {3112#(<= |ackermann_#in~n| 0)} {2883#(<= 3 |ackermann_#t~ret1|)} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,518 INFO L280 TraceCheckUtils]: 60: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2729#false} is VALID [2020-07-10 14:43:12,519 INFO L280 TraceCheckUtils]: 61: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-10 14:43:12,519 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2729#false} {2728#true} #46#return; {2729#false} is VALID [2020-07-10 14:43:12,519 INFO L280 TraceCheckUtils]: 63: Hoare triple {2729#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2729#false} is VALID [2020-07-10 14:43:12,519 INFO L263 TraceCheckUtils]: 64: Hoare triple {2729#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2729#false} is VALID [2020-07-10 14:43:12,519 INFO L280 TraceCheckUtils]: 65: Hoare triple {2729#false} ~m := #in~m;~n := #in~n; {2729#false} is VALID [2020-07-10 14:43:12,520 INFO L280 TraceCheckUtils]: 66: Hoare triple {2729#false} assume 0 == ~m;#res := 1 + ~n; {2729#false} is VALID [2020-07-10 14:43:12,520 INFO L280 TraceCheckUtils]: 67: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-10 14:43:12,520 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2729#false} {2729#false} #48#return; {2729#false} is VALID [2020-07-10 14:43:12,520 INFO L280 TraceCheckUtils]: 69: Hoare triple {2729#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2729#false} is VALID [2020-07-10 14:43:12,520 INFO L280 TraceCheckUtils]: 70: Hoare triple {2729#false} assume true; {2729#false} is VALID [2020-07-10 14:43:12,520 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2729#false} {2728#true} #50#return; {2729#false} is VALID [2020-07-10 14:43:12,521 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-10 14:43:12,521 INFO L280 TraceCheckUtils]: 73: Hoare triple {2729#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2729#false} is VALID [2020-07-10 14:43:12,521 INFO L280 TraceCheckUtils]: 74: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2020-07-10 14:43:12,525 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-10 14:43:12,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:12,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 19 [2020-07-10 14:43:12,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439210909] [2020-07-10 14:43:12,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2020-07-10 14:43:12,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:12,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 14:43:12,617 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-10 14:43:12,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 14:43:12,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 14:43:12,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-07-10 14:43:12,618 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand 19 states. [2020-07-10 14:43:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:14,767 INFO L93 Difference]: Finished difference Result 101 states and 206 transitions. [2020-07-10 14:43:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 14:43:14,767 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2020-07-10 14:43:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:43:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2020-07-10 14:43:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:43:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2020-07-10 14:43:14,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 89 transitions. [2020-07-10 14:43:14,899 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-10 14:43:14,900 INFO L225 Difference]: With dead ends: 101 [2020-07-10 14:43:14,900 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:43:14,902 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-10 14:43:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:43:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:43:14,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:14,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:14,903 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:14,903 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:14,904 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:43:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:14,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:14,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:14,904 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:14,905 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:14,905 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:43:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:14,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:14,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:14,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:14,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:43:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:43:14,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2020-07-10 14:43:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:14,906 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:43:14,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 14:43:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:14,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:15,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:15,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:43:15,594 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2020-07-10 14:43:15,670 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:43:15,671 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:43:15,671 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:43:15,671 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:43:15,671 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:43:15,671 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:43:15,671 INFO L268 CegarLoopResult]: For program point ackermannEXIT(lines 15 23) no Hoare annotation was computed. [2020-07-10 14:43:15,672 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-10 14:43:15,672 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-07-10 14:43:15,672 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-10 14:43:15,672 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-10 14:43:15,672 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-10 14:43:15,672 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-10 14:43:15,672 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-10 14:43:15,673 INFO L268 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-07-10 14:43:15,673 INFO L268 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2020-07-10 14:43:15,673 INFO L268 CegarLoopResult]: For program point ackermannFINAL(lines 15 23) no Hoare annotation was computed. [2020-07-10 14:43:15,673 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2020-07-10 14:43:15,673 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2020-07-10 14:43:15,674 INFO L268 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2020-07-10 14:43:15,674 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 26 46) no Hoare annotation was computed. [2020-07-10 14:43:15,674 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 26 46) no Hoare annotation was computed. [2020-07-10 14:43:15,674 INFO L268 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-07-10 14:43:15,674 INFO L268 CegarLoopResult]: For program point L41(lines 41 45) no Hoare annotation was computed. [2020-07-10 14:43:15,674 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-10 14:43:15,674 INFO L268 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-07-10 14:43:15,674 INFO L268 CegarLoopResult]: For program point L34(lines 34 39) no Hoare annotation was computed. [2020-07-10 14:43:15,680 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:43:15,680 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:43:15,680 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:43:15,680 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:43:15,680 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:43:15,680 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:43:15,680 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: ackermannFINAL has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:43:15,681 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 14:43:15,682 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 14:43:15,683 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 14:43:15,683 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 14:43:15,683 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 14:43:15,683 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 14:43:15,683 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 14:43:15,683 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 14:43:15,683 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 14:43:15,683 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-10 14:43:15,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:43:15 BoogieIcfgContainer [2020-07-10 14:43:15,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:43:15,690 INFO L168 Benchmark]: Toolchain (without parser) took 17131.87 ms. Allocated memory was 137.9 MB in the beginning and 376.4 MB in the end (delta: 238.6 MB). Free memory was 101.7 MB in the beginning and 207.8 MB in the end (delta: -106.0 MB). Peak memory consumption was 132.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:15,691 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:43:15,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.57 ms. Allocated memory is still 137.9 MB. Free memory was 101.5 MB in the beginning and 91.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:15,697 INFO L168 Benchmark]: Boogie Preprocessor took 33.03 ms. Allocated memory is still 137.9 MB. Free memory was 91.3 MB in the beginning and 89.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:15,697 INFO L168 Benchmark]: RCFGBuilder took 526.84 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 89.9 MB in the beginning and 161.2 MB in the end (delta: -71.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:15,698 INFO L168 Benchmark]: TraceAbstraction took 16312.66 ms. Allocated memory was 201.3 MB in the beginning and 376.4 MB in the end (delta: 175.1 MB). Free memory was 160.6 MB in the beginning and 207.8 MB in the end (delta: -47.2 MB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:15,706 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.57 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.57 ms. Allocated memory is still 137.9 MB. Free memory was 101.5 MB in the beginning and 91.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.03 ms. Allocated memory is still 137.9 MB. Free memory was 91.3 MB in the beginning and 89.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.84 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 89.9 MB in the beginning and 161.2 MB in the end (delta: -71.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16312.66 ms. Allocated memory was 201.3 MB in the beginning and 376.4 MB in the end (delta: 175.1 MB). Free memory was 160.6 MB in the beginning and 207.8 MB in the end (delta: -47.2 MB). Peak memory consumption was 127.9 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: 15.6s, OverallIterations: 8, TraceHistogramMax: 10, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 177 SDtfs, 198 SDslu, 824 SDs, 0 SdLazy, 1552 SolverSat, 310 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.1s 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.4s 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.6s 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...