./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:13:09,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:13:09,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:13:09,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:13:09,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:13:09,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:13:09,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:13:09,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:13:09,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:13:09,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:13:09,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:13:09,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:13:09,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:13:09,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:13:09,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:13:09,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:13:09,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:13:09,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:13:09,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:13:09,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:13:09,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:13:09,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:13:09,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:13:09,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:13:09,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:13:09,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:13:09,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:13:09,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:13:09,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:13:09,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:13:09,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:13:09,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:13:09,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:13:09,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:13:09,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:13:09,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:13:09,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:13:09,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:13:09,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:13:09,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:13:09,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:13:09,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:13:09,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:13:09,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:13:09,576 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:13:09,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:13:09,577 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:13:09,577 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:13:09,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:13:09,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:13:09,577 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:13:09,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:13:09,587 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:13:09,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:13:09,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:13:09,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:13:09,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:13:09,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:13:09,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:13:09,589 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:13:09,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:13:09,589 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:13:09,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:13:09,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:13:09,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:13:09,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:13:09,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:09,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:13:09,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:13:09,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:13:09,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:13:09,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:13:09,592 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:13:09,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:13:09,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:13:09,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b [2022-02-20 18:13:09,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:13:09,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:13:09,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:13:09,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:13:09,817 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:13:09,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann01-2.c [2022-02-20 18:13:09,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9892c965/d3c11507dba8416faea93ca5fe98382a/FLAG0bad9d15d [2022-02-20 18:13:10,204 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:13:10,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c [2022-02-20 18:13:10,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9892c965/d3c11507dba8416faea93ca5fe98382a/FLAG0bad9d15d [2022-02-20 18:13:10,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9892c965/d3c11507dba8416faea93ca5fe98382a [2022-02-20 18:13:10,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:13:10,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:13:10,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:10,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:13:10,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:13:10,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4723d784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10, skipping insertion in model container [2022-02-20 18:13:10,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:13:10,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:13:10,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c[1234,1247] [2022-02-20 18:13:10,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:10,777 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:13:10,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c[1234,1247] [2022-02-20 18:13:10,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:10,807 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:13:10,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10 WrapperNode [2022-02-20 18:13:10,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:10,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:10,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:13:10,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:13:10,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,832 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-02-20 18:13:10,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:10,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:13:10,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:13:10,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:13:10,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:13:10,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:13:10,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:13:10,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:13:10,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (1/1) ... [2022-02-20 18:13:10,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:10,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:13:10,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:13:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:13:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:13:10,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:13:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2022-02-20 18:13:10,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2022-02-20 18:13:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:13:10,977 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:13:10,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:13:11,153 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:13:11,158 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:13:11,164 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:13:11,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:11 BoogieIcfgContainer [2022-02-20 18:13:11,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:13:11,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:13:11,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:13:11,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:13:11,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:13:10" (1/3) ... [2022-02-20 18:13:11,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15135605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:11, skipping insertion in model container [2022-02-20 18:13:11,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:10" (2/3) ... [2022-02-20 18:13:11,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15135605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:11, skipping insertion in model container [2022-02-20 18:13:11,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:11" (3/3) ... [2022-02-20 18:13:11,178 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2022-02-20 18:13:11,182 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:13:11,183 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:13:11,226 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:13:11,232 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:13:11,233 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:13:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:13:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 18:13:11,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:11,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:11,258 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2022-02-20 18:13:11,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:11,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152656387] [2022-02-20 18:13:11,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:11,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 18:13:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:11,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} ~m := #in~m;~n := #in~n; {35#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:11,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {36#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:11,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {36#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:11,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28#(<= 0 |ULTIMATE.start_main_~n~0#1|)} #43#return; {33#(<= 1 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:11,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-02-20 18:13:11,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {26#true} is VALID [2022-02-20 18:13:11,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {26#true} is VALID [2022-02-20 18:13:11,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {28#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 18:13:11,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {26#true} is VALID [2022-02-20 18:13:11,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~m := #in~m;~n := #in~n; {35#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:11,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {36#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:11,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {36#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:11,573 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {36#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28#(<= 0 |ULTIMATE.start_main_~n~0#1|)} #43#return; {33#(<= 1 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:11,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(<= 1 |ULTIMATE.start_main_#t~ret9#1|)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {34#(<= 1 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:11,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#(<= 1 |ULTIMATE.start_main_~result~0#1|)} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {27#false} is VALID [2022-02-20 18:13:11,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 18:13:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:13:11,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:11,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152656387] [2022-02-20 18:13:11,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152656387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:11,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:13:11,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:13:11,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572653731] [2022-02-20 18:13:11,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:11,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 18:13:11,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:11,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:11,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:11,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:13:11,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:11,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:13:11,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:13:11,632 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:11,881 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 18:13:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:13:11,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 18:13:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-02-20 18:13:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-02-20 18:13:11,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-02-20 18:13:11,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:11,943 INFO L225 Difference]: With dead ends: 38 [2022-02-20 18:13:11,943 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 18:13:11,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:13:11,950 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:11,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 91 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 18:13:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 18:13:11,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:11,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:13:11,976 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:13:11,976 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:13:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:11,982 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-20 18:13:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 18:13:11,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:11,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:11,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Second operand 22 states. [2022-02-20 18:13:11,985 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Second operand 22 states. [2022-02-20 18:13:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:11,994 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-20 18:13:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 18:13:11,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:11,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:11,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:11,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:13:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 18:13:12,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2022-02-20 18:13:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:12,002 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 18:13:12,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 18:13:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 18:13:12,006 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:12,007 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:12,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:13:12,007 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2022-02-20 18:13:12,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:12,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059710683] [2022-02-20 18:13:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:12,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 18:13:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#true} ~m := #in~m;~n := #in~n; {184#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:12,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:12,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:12,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {163#true} #45#return; {182#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:12,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#true} ~m := #in~m;~n := #in~n; {163#true} is VALID [2022-02-20 18:13:12,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume !(0 == ~m); {163#true} is VALID [2022-02-20 18:13:12,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume 0 == ~n; {163#true} is VALID [2022-02-20 18:13:12,127 INFO L272 TraceCheckUtils]: 3: Hoare triple {163#true} call #t~ret4 := ackermann(~m - 1, 1); {163#true} is VALID [2022-02-20 18:13:12,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#true} ~m := #in~m;~n := #in~n; {184#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:12,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {184#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:12,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:12,130 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {163#true} #45#return; {182#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:12,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {183#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:12,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#(<= 2 |ackermann_#res|)} assume true; {183#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:12,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183#(<= 2 |ackermann_#res|)} {163#true} #43#return; {176#(<= 2 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:12,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID [2022-02-20 18:13:12,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {163#true} is VALID [2022-02-20 18:13:12,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {163#true} is VALID [2022-02-20 18:13:12,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {163#true} is VALID [2022-02-20 18:13:12,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {163#true} is VALID [2022-02-20 18:13:12,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} ~m := #in~m;~n := #in~n; {163#true} is VALID [2022-02-20 18:13:12,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !(0 == ~m); {163#true} is VALID [2022-02-20 18:13:12,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#true} assume 0 == ~n; {163#true} is VALID [2022-02-20 18:13:12,134 INFO L272 TraceCheckUtils]: 8: Hoare triple {163#true} call #t~ret4 := ackermann(~m - 1, 1); {163#true} is VALID [2022-02-20 18:13:12,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#true} ~m := #in~m;~n := #in~n; {184#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:12,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {184#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:12,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:12,137 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {185#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {163#true} #45#return; {182#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:12,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {182#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {183#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:12,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#(<= 2 |ackermann_#res|)} assume true; {183#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:12,141 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183#(<= 2 |ackermann_#res|)} {163#true} #43#return; {176#(<= 2 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:12,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {176#(<= 2 |ULTIMATE.start_main_#t~ret9#1|)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {177#(<= 2 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:12,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {177#(<= 2 |ULTIMATE.start_main_~result~0#1|)} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {164#false} is VALID [2022-02-20 18:13:12,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-02-20 18:13:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:13:12,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:12,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059710683] [2022-02-20 18:13:12,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059710683] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:12,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:13:12,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:13:12,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271106122] [2022-02-20 18:13:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 18:13:12,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:12,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:12,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:12,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:13:12,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:13:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:13:12,160 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:12,531 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 18:13:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:13:12,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 18:13:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-02-20 18:13:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-02-20 18:13:12,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-02-20 18:13:12,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:12,572 INFO L225 Difference]: With dead ends: 29 [2022-02-20 18:13:12,572 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 18:13:12,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:13:12,573 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:12,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 78 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 18:13:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-02-20 18:13:12,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:12,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:13:12,578 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:13:12,579 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:13:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:12,581 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 18:13:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 18:13:12,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:12,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:12,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Second operand 25 states. [2022-02-20 18:13:12,582 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Second operand 25 states. [2022-02-20 18:13:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:12,583 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 18:13:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 18:13:12,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:12,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:12,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:12,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 18:13:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-02-20 18:13:12,586 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2022-02-20 18:13:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:12,586 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-20 18:13:12,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:13:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 18:13:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:13:12,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:12,587 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:12,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:13:12,588 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:12,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -445405100, now seen corresponding path program 1 times [2022-02-20 18:13:12,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:12,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675849381] [2022-02-20 18:13:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 18:13:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {335#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:12,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {336#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:12,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#(= |ackermann_#in~m| 0)} assume true; {336#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:12,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {336#(= |ackermann_#in~m| 0)} {326#(not (= ackermann_~m 0))} #47#return; {308#false} is VALID [2022-02-20 18:13:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 18:13:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {307#true} is VALID [2022-02-20 18:13:12,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume 0 == ~m;#res := 1 + ~n; {307#true} is VALID [2022-02-20 18:13:12,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-02-20 18:13:12,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {308#false} #49#return; {308#false} is VALID [2022-02-20 18:13:12,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {307#true} is VALID [2022-02-20 18:13:12,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume !(0 == ~m); {326#(not (= ackermann_~m 0))} is VALID [2022-02-20 18:13:12,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#(not (= ackermann_~m 0))} assume !(0 == ~n); {326#(not (= ackermann_~m 0))} is VALID [2022-02-20 18:13:12,681 INFO L272 TraceCheckUtils]: 3: Hoare triple {326#(not (= ackermann_~m 0))} call #t~ret5 := ackermann(~m, ~n - 1); {307#true} is VALID [2022-02-20 18:13:12,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {335#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:12,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {335#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {336#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:12,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {336#(= |ackermann_#in~m| 0)} assume true; {336#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:12,685 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {336#(= |ackermann_#in~m| 0)} {326#(not (= ackermann_~m 0))} #47#return; {308#false} is VALID [2022-02-20 18:13:12,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {308#false} is VALID [2022-02-20 18:13:12,685 INFO L272 TraceCheckUtils]: 9: Hoare triple {308#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {307#true} is VALID [2022-02-20 18:13:12,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {307#true} is VALID [2022-02-20 18:13:12,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {307#true} assume 0 == ~m;#res := 1 + ~n; {307#true} is VALID [2022-02-20 18:13:12,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {307#true} assume true; {307#true} is VALID [2022-02-20 18:13:12,686 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {307#true} {308#false} #49#return; {308#false} is VALID [2022-02-20 18:13:12,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {308#false} is VALID [2022-02-20 18:13:12,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {308#false} assume true; {308#false} is VALID [2022-02-20 18:13:12,686 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {308#false} {307#true} #43#return; {308#false} is VALID [2022-02-20 18:13:12,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-02-20 18:13:12,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {307#true} is VALID [2022-02-20 18:13:12,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {307#true} is VALID [2022-02-20 18:13:12,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {307#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {307#true} is VALID [2022-02-20 18:13:12,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {307#true} is VALID [2022-02-20 18:13:12,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {307#true} is VALID [2022-02-20 18:13:12,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#true} assume !(0 == ~m); {326#(not (= ackermann_~m 0))} is VALID [2022-02-20 18:13:12,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(not (= ackermann_~m 0))} assume !(0 == ~n); {326#(not (= ackermann_~m 0))} is VALID [2022-02-20 18:13:12,688 INFO L272 TraceCheckUtils]: 8: Hoare triple {326#(not (= ackermann_~m 0))} call #t~ret5 := ackermann(~m, ~n - 1); {307#true} is VALID [2022-02-20 18:13:12,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {335#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:12,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {336#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:12,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {336#(= |ackermann_#in~m| 0)} assume true; {336#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:12,690 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {336#(= |ackermann_#in~m| 0)} {326#(not (= ackermann_~m 0))} #47#return; {308#false} is VALID [2022-02-20 18:13:12,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {308#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {308#false} is VALID [2022-02-20 18:13:12,691 INFO L272 TraceCheckUtils]: 14: Hoare triple {308#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {307#true} is VALID [2022-02-20 18:13:12,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {307#true} is VALID [2022-02-20 18:13:12,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {307#true} assume 0 == ~m;#res := 1 + ~n; {307#true} is VALID [2022-02-20 18:13:12,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {307#true} assume true; {307#true} is VALID [2022-02-20 18:13:12,691 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {307#true} {308#false} #49#return; {308#false} is VALID [2022-02-20 18:13:12,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {308#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {308#false} is VALID [2022-02-20 18:13:12,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} assume true; {308#false} is VALID [2022-02-20 18:13:12,692 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {308#false} {307#true} #43#return; {308#false} is VALID [2022-02-20 18:13:12,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {308#false} is VALID [2022-02-20 18:13:12,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {308#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {308#false} is VALID [2022-02-20 18:13:12,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-02-20 18:13:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:13:12,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:12,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675849381] [2022-02-20 18:13:12,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675849381] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:12,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163383216] [2022-02-20 18:13:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:12,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:12,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:12,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:12,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:13:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:13:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:12,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:13,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-02-20 18:13:13,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {307#true} is VALID [2022-02-20 18:13:13,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {307#true} is VALID [2022-02-20 18:13:13,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {307#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {307#true} is VALID [2022-02-20 18:13:13,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {307#true} is VALID [2022-02-20 18:13:13,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {307#true} is VALID [2022-02-20 18:13:13,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#true} assume !(0 == ~m); {307#true} is VALID [2022-02-20 18:13:13,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#true} assume !(0 == ~n); {307#true} is VALID [2022-02-20 18:13:13,007 INFO L272 TraceCheckUtils]: 8: Hoare triple {307#true} call #t~ret5 := ackermann(~m, ~n - 1); {307#true} is VALID [2022-02-20 18:13:13,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {367#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:13,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {367#(<= |ackermann_#in~m| ackermann_~m)} assume 0 == ~m;#res := 1 + ~n; {371#(<= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:13,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#(<= |ackermann_#in~m| 0)} assume true; {371#(<= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:13,012 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {371#(<= |ackermann_#in~m| 0)} {307#true} #47#return; {378#(<= ackermann_~m 0)} is VALID [2022-02-20 18:13:13,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#(<= ackermann_~m 0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {378#(<= ackermann_~m 0)} is VALID [2022-02-20 18:13:13,013 INFO L272 TraceCheckUtils]: 14: Hoare triple {378#(<= ackermann_~m 0)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {307#true} is VALID [2022-02-20 18:13:13,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {388#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:13,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {388#(<= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {392#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:13,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {392#(<= 0 |ackermann_#in~m|)} assume true; {392#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:13,016 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {392#(<= 0 |ackermann_#in~m|)} {378#(<= ackermann_~m 0)} #49#return; {308#false} is VALID [2022-02-20 18:13:13,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {308#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {308#false} is VALID [2022-02-20 18:13:13,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} assume true; {308#false} is VALID [2022-02-20 18:13:13,017 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {308#false} {307#true} #43#return; {308#false} is VALID [2022-02-20 18:13:13,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {308#false} is VALID [2022-02-20 18:13:13,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {308#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {308#false} is VALID [2022-02-20 18:13:13,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-02-20 18:13:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:13:13,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:13,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-02-20 18:13:13,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {308#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {308#false} is VALID [2022-02-20 18:13:13,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {308#false} is VALID [2022-02-20 18:13:13,502 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {308#false} {307#true} #43#return; {308#false} is VALID [2022-02-20 18:13:13,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} assume true; {308#false} is VALID [2022-02-20 18:13:13,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {308#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {308#false} is VALID [2022-02-20 18:13:13,512 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {392#(<= 0 |ackermann_#in~m|)} {378#(<= ackermann_~m 0)} #49#return; {308#false} is VALID [2022-02-20 18:13:13,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {392#(<= 0 |ackermann_#in~m|)} assume true; {392#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:13,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {447#(or (not (<= 0 ackermann_~m)) (<= 0 |ackermann_#in~m|))} assume 0 == ~m;#res := 1 + ~n; {392#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:13,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {447#(or (not (<= 0 ackermann_~m)) (<= 0 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:13,514 INFO L272 TraceCheckUtils]: 14: Hoare triple {378#(<= ackermann_~m 0)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {307#true} is VALID [2022-02-20 18:13:13,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#(<= ackermann_~m 0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {378#(<= ackermann_~m 0)} is VALID [2022-02-20 18:13:13,515 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {371#(<= |ackermann_#in~m| 0)} {307#true} #47#return; {378#(<= ackermann_~m 0)} is VALID [2022-02-20 18:13:13,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#(<= |ackermann_#in~m| 0)} assume true; {371#(<= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:13,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(or (not (<= ackermann_~m 0)) (<= |ackermann_#in~m| 0))} assume 0 == ~m;#res := 1 + ~n; {371#(<= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:13,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {466#(or (not (<= ackermann_~m 0)) (<= |ackermann_#in~m| 0))} is VALID [2022-02-20 18:13:13,516 INFO L272 TraceCheckUtils]: 8: Hoare triple {307#true} call #t~ret5 := ackermann(~m, ~n - 1); {307#true} is VALID [2022-02-20 18:13:13,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#true} assume !(0 == ~n); {307#true} is VALID [2022-02-20 18:13:13,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#true} assume !(0 == ~m); {307#true} is VALID [2022-02-20 18:13:13,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} ~m := #in~m;~n := #in~n; {307#true} is VALID [2022-02-20 18:13:13,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {307#true} is VALID [2022-02-20 18:13:13,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {307#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {307#true} is VALID [2022-02-20 18:13:13,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {307#true} is VALID [2022-02-20 18:13:13,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {307#true} is VALID [2022-02-20 18:13:13,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {307#true} is VALID [2022-02-20 18:13:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:13:13,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163383216] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:13,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:13,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2022-02-20 18:13:13,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796109052] [2022-02-20 18:13:13,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:13,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25 [2022-02-20 18:13:13,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:13,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:13,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:13,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:13:13,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:13:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:13:13,544 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:13,931 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2022-02-20 18:13:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:13:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25 [2022-02-20 18:13:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-02-20 18:13:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-02-20 18:13:13,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-02-20 18:13:14,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:14,008 INFO L225 Difference]: With dead ends: 48 [2022-02-20 18:13:14,008 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 18:13:14,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:13:14,009 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:14,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 87 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 18:13:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-02-20 18:13:14,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:14,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 18:13:14,018 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 18:13:14,018 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 18:13:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:14,020 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2022-02-20 18:13:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2022-02-20 18:13:14,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:14,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:14,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Second operand 30 states. [2022-02-20 18:13:14,021 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Second operand 30 states. [2022-02-20 18:13:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:14,028 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2022-02-20 18:13:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2022-02-20 18:13:14,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:14,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:14,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:14,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 18:13:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 18:13:14,033 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 25 [2022-02-20 18:13:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:14,034 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 18:13:14,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 18:13:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 18:13:14,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:14,040 INFO L514 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] [2022-02-20 18:13:14,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 18:13:14,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:14,250 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1893657534, now seen corresponding path program 1 times [2022-02-20 18:13:14,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:14,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025230384] [2022-02-20 18:13:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 18:13:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:14,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {702#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:14,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:14,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:14,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {650#true} #45#return; {700#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:14,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:14,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:14,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} assume 0 == ~n; {650#true} is VALID [2022-02-20 18:13:14,394 INFO L272 TraceCheckUtils]: 3: Hoare triple {650#true} call #t~ret4 := ackermann(~m - 1, 1); {650#true} is VALID [2022-02-20 18:13:14,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {702#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:14,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {702#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:14,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:14,396 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {650#true} #45#return; {700#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:14,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {700#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {701#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#(<= 2 |ackermann_#res|)} assume true; {701#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,398 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {701#(<= 2 |ackermann_#res|)} {650#true} #47#return; {689#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:14,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:13:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:14,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {704#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:14,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {689#(<= 2 |ackermann_#t~ret5|)} #49#return; {694#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:14,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:14,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:14,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} assume !(0 == ~n); {650#true} is VALID [2022-02-20 18:13:14,426 INFO L272 TraceCheckUtils]: 3: Hoare triple {650#true} call #t~ret5 := ackermann(~m, ~n - 1); {650#true} is VALID [2022-02-20 18:13:14,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:14,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:14,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#true} assume 0 == ~n; {650#true} is VALID [2022-02-20 18:13:14,427 INFO L272 TraceCheckUtils]: 7: Hoare triple {650#true} call #t~ret4 := ackermann(~m - 1, 1); {650#true} is VALID [2022-02-20 18:13:14,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {702#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:14,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:14,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:14,429 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {650#true} #45#return; {700#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:14,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {700#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {701#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {701#(<= 2 |ackermann_#res|)} assume true; {701#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,431 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {701#(<= 2 |ackermann_#res|)} {650#true} #47#return; {689#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:14,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {689#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {689#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:14,431 INFO L272 TraceCheckUtils]: 16: Hoare triple {689#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {650#true} is VALID [2022-02-20 18:13:14,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {704#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:14,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {704#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,436 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {689#(<= 2 |ackermann_#t~ret5|)} #49#return; {694#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:14,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {695#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {695#(<= 3 |ackermann_#res|)} assume true; {695#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,437 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {695#(<= 3 |ackermann_#res|)} {650#true} #43#return; {676#(<= 3 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:14,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {650#true} is VALID [2022-02-20 18:13:14,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {650#true} is VALID [2022-02-20 18:13:14,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {650#true} is VALID [2022-02-20 18:13:14,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {650#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {650#true} is VALID [2022-02-20 18:13:14,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {650#true} is VALID [2022-02-20 18:13:14,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:14,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:14,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {650#true} assume !(0 == ~n); {650#true} is VALID [2022-02-20 18:13:14,442 INFO L272 TraceCheckUtils]: 8: Hoare triple {650#true} call #t~ret5 := ackermann(~m, ~n - 1); {650#true} is VALID [2022-02-20 18:13:14,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:14,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:14,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {650#true} assume 0 == ~n; {650#true} is VALID [2022-02-20 18:13:14,443 INFO L272 TraceCheckUtils]: 12: Hoare triple {650#true} call #t~ret4 := ackermann(~m - 1, 1); {650#true} is VALID [2022-02-20 18:13:14,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {702#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:14,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {702#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:14,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:14,445 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {703#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {650#true} #45#return; {700#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:14,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {700#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {701#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#(<= 2 |ackermann_#res|)} assume true; {701#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,446 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {701#(<= 2 |ackermann_#res|)} {650#true} #47#return; {689#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:14,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {689#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:14,447 INFO L272 TraceCheckUtils]: 21: Hoare triple {689#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {650#true} is VALID [2022-02-20 18:13:14,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {704#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:14,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {704#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,449 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {689#(<= 2 |ackermann_#t~ret5|)} #49#return; {694#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:14,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {694#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {695#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {695#(<= 3 |ackermann_#res|)} assume true; {695#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,451 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {695#(<= 3 |ackermann_#res|)} {650#true} #43#return; {676#(<= 3 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:14,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {676#(<= 3 |ULTIMATE.start_main_#t~ret9#1|)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {677#(<= 3 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:14,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {677#(<= 3 |ULTIMATE.start_main_~result~0#1|)} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {651#false} is VALID [2022-02-20 18:13:14,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-02-20 18:13:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 18:13:14,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:14,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025230384] [2022-02-20 18:13:14,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025230384] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:14,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195512544] [2022-02-20 18:13:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:14,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:14,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 18:13:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:14,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 18:13:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:14,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:14,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {650#true} is VALID [2022-02-20 18:13:14,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {650#true} is VALID [2022-02-20 18:13:14,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {650#true} is VALID [2022-02-20 18:13:14,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {650#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {650#true} is VALID [2022-02-20 18:13:14,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {650#true} is VALID [2022-02-20 18:13:14,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:14,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:14,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {650#true} assume !(0 == ~n); {650#true} is VALID [2022-02-20 18:13:14,707 INFO L272 TraceCheckUtils]: 8: Hoare triple {650#true} call #t~ret5 := ackermann(~m, ~n - 1); {650#true} is VALID [2022-02-20 18:13:14,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:14,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:14,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {650#true} assume 0 == ~n; {650#true} is VALID [2022-02-20 18:13:14,708 INFO L272 TraceCheckUtils]: 12: Hoare triple {650#true} call #t~ret4 := ackermann(~m - 1, 1); {650#true} is VALID [2022-02-20 18:13:14,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {748#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:14,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {748#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,710 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {650#true} #45#return; {700#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:14,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {700#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {701#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#(<= 2 |ackermann_#res|)} assume true; {701#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,711 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {701#(<= 2 |ackermann_#res|)} {650#true} #47#return; {689#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:14,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {689#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:14,712 INFO L272 TraceCheckUtils]: 21: Hoare triple {689#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {650#true} is VALID [2022-02-20 18:13:14,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {748#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:14,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {748#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:14,717 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {705#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {689#(<= 2 |ackermann_#t~ret5|)} #49#return; {694#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:14,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {694#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {695#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {695#(<= 3 |ackermann_#res|)} assume true; {695#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:14,725 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {695#(<= 3 |ackermann_#res|)} {650#true} #43#return; {676#(<= 3 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:14,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {676#(<= 3 |ULTIMATE.start_main_#t~ret9#1|)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {677#(<= 3 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:14,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {677#(<= 3 |ULTIMATE.start_main_~result~0#1|)} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {651#false} is VALID [2022-02-20 18:13:14,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-02-20 18:13:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 18:13:14,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:16,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-02-20 18:13:16,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {806#(<= 0 |ULTIMATE.start_main_~result~0#1|)} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {651#false} is VALID [2022-02-20 18:13:16,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {810#(<= 0 |ULTIMATE.start_main_#t~ret9#1|)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {806#(<= 0 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:16,277 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {817#(<= 0 |ackermann_#res|)} {650#true} #43#return; {810#(<= 0 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:16,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {817#(<= 0 |ackermann_#res|)} assume true; {817#(<= 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:16,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {824#(<= 0 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {817#(<= 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:16,278 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {832#(or (<= 0 |ackermann_#res|) (< (+ |ackermann_#in~n| 1) 0))} {828#(<= 0 (+ |ackermann_#t~ret5| 1))} #49#return; {824#(<= 0 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:16,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {832#(or (<= 0 |ackermann_#res|) (< (+ |ackermann_#in~n| 1) 0))} assume true; {832#(or (<= 0 |ackermann_#res|) (< (+ |ackermann_#in~n| 1) 0))} is VALID [2022-02-20 18:13:16,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {839#(or (<= 0 (+ ackermann_~n 1)) (< (+ |ackermann_#in~n| 1) 0))} assume 0 == ~m;#res := 1 + ~n; {832#(or (<= 0 |ackermann_#res|) (< (+ |ackermann_#in~n| 1) 0))} is VALID [2022-02-20 18:13:16,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {839#(or (<= 0 (+ ackermann_~n 1)) (< (+ |ackermann_#in~n| 1) 0))} is VALID [2022-02-20 18:13:16,280 INFO L272 TraceCheckUtils]: 21: Hoare triple {828#(<= 0 (+ |ackermann_#t~ret5| 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {650#true} is VALID [2022-02-20 18:13:16,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {828#(<= 0 (+ |ackermann_#t~ret5| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {828#(<= 0 (+ |ackermann_#t~ret5| 1))} is VALID [2022-02-20 18:13:16,281 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {852#(<= 0 (+ |ackermann_#res| 1))} {650#true} #47#return; {828#(<= 0 (+ |ackermann_#t~ret5| 1))} is VALID [2022-02-20 18:13:16,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {852#(<= 0 (+ |ackermann_#res| 1))} assume true; {852#(<= 0 (+ |ackermann_#res| 1))} is VALID [2022-02-20 18:13:16,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {859#(<= 0 (+ |ackermann_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {852#(<= 0 (+ |ackermann_#res| 1))} is VALID [2022-02-20 18:13:16,283 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {866#(or (not (<= 1 |ackermann_#in~n|)) (<= 0 (+ |ackermann_#res| 1)))} {650#true} #45#return; {859#(<= 0 (+ |ackermann_#t~ret4| 1))} is VALID [2022-02-20 18:13:16,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {866#(or (not (<= 1 |ackermann_#in~n|)) (<= 0 (+ |ackermann_#res| 1)))} assume true; {866#(or (not (<= 1 |ackermann_#in~n|)) (<= 0 (+ |ackermann_#res| 1)))} is VALID [2022-02-20 18:13:16,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(or (<= 0 (+ ackermann_~n 2)) (not (<= 1 |ackermann_#in~n|)))} assume 0 == ~m;#res := 1 + ~n; {866#(or (not (<= 1 |ackermann_#in~n|)) (<= 0 (+ |ackermann_#res| 1)))} is VALID [2022-02-20 18:13:16,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {873#(or (<= 0 (+ ackermann_~n 2)) (not (<= 1 |ackermann_#in~n|)))} is VALID [2022-02-20 18:13:16,284 INFO L272 TraceCheckUtils]: 12: Hoare triple {650#true} call #t~ret4 := ackermann(~m - 1, 1); {650#true} is VALID [2022-02-20 18:13:16,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {650#true} assume 0 == ~n; {650#true} is VALID [2022-02-20 18:13:16,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:16,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:16,285 INFO L272 TraceCheckUtils]: 8: Hoare triple {650#true} call #t~ret5 := ackermann(~m, ~n - 1); {650#true} is VALID [2022-02-20 18:13:16,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {650#true} assume !(0 == ~n); {650#true} is VALID [2022-02-20 18:13:16,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#true} assume !(0 == ~m); {650#true} is VALID [2022-02-20 18:13:16,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} ~m := #in~m;~n := #in~n; {650#true} is VALID [2022-02-20 18:13:16,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {650#true} is VALID [2022-02-20 18:13:16,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {650#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {650#true} is VALID [2022-02-20 18:13:16,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {650#true} is VALID [2022-02-20 18:13:16,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {650#true} is VALID [2022-02-20 18:13:16,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {650#true} is VALID [2022-02-20 18:13:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 18:13:16,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195512544] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:16,286 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:16,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2022-02-20 18:13:16,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260596932] [2022-02-20 18:13:16,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:16,288 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 32 [2022-02-20 18:13:16,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:16,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 18:13:16,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:16,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 18:13:16,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:16,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 18:13:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:13:16,327 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 18:13:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:18,454 INFO L93 Difference]: Finished difference Result 72 states and 133 transitions. [2022-02-20 18:13:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-20 18:13:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 32 [2022-02-20 18:13:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 18:13:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 122 transitions. [2022-02-20 18:13:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 18:13:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 122 transitions. [2022-02-20 18:13:18,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 122 transitions. [2022-02-20 18:13:18,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:18,587 INFO L225 Difference]: With dead ends: 72 [2022-02-20 18:13:18,587 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 18:13:18,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=2027, Unknown=0, NotChecked=0, Total=2450 [2022-02-20 18:13:18,590 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 65 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:18,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 163 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 18:13:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 18:13:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 38. [2022-02-20 18:13:18,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:18,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) [2022-02-20 18:13:18,620 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) [2022-02-20 18:13:18,620 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) [2022-02-20 18:13:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:18,627 INFO L93 Difference]: Finished difference Result 66 states and 125 transitions. [2022-02-20 18:13:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 125 transitions. [2022-02-20 18:13:18,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:18,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:18,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) Second operand 66 states. [2022-02-20 18:13:18,629 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) Second operand 66 states. [2022-02-20 18:13:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:18,634 INFO L93 Difference]: Finished difference Result 66 states and 125 transitions. [2022-02-20 18:13:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 125 transitions. [2022-02-20 18:13:18,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:18,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:18,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:18,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) [2022-02-20 18:13:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2022-02-20 18:13:18,638 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 32 [2022-02-20 18:13:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:18,638 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2022-02-20 18:13:18,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 18:13:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2022-02-20 18:13:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 18:13:18,639 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:18,640 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:18,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:18,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 18:13:18,857 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash 372648096, now seen corresponding path program 2 times [2022-02-20 18:13:18,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:18,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124269142] [2022-02-20 18:13:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:18,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 18:13:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:18,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:18,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:18,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:18,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:18,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:18,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:18,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:18,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:18,974 INFO L272 TraceCheckUtils]: 3: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:18,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:18,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:18,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:18,976 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:18,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {1318#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:18,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {1318#(<= |ackermann_#in~m| 1)} assume true; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:18,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1318#(<= |ackermann_#in~m| 1)} {1219#true} #47#return; {1301#(<= ackermann_~m 1)} is VALID [2022-02-20 18:13:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:13:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:19,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,019 INFO L272 TraceCheckUtils]: 3: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,021 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {1324#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {1324#(<= 1 |ackermann_#in~m|)} assume true; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,022 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1324#(<= 1 |ackermann_#in~m|)} {1301#(<= ackermann_~m 1)} #49#return; {1220#false} is VALID [2022-02-20 18:13:19,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:19,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#true} assume !(0 == ~n); {1219#true} is VALID [2022-02-20 18:13:19,023 INFO L272 TraceCheckUtils]: 3: Hoare triple {1219#true} call #t~ret5 := ackermann(~m, ~n - 1); {1219#true} is VALID [2022-02-20 18:13:19,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,024 INFO L272 TraceCheckUtils]: 7: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,025 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {1318#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {1318#(<= |ackermann_#in~m| 1)} assume true; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,026 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1318#(<= |ackermann_#in~m| 1)} {1219#true} #47#return; {1301#(<= ackermann_~m 1)} is VALID [2022-02-20 18:13:19,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {1301#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1301#(<= ackermann_~m 1)} is VALID [2022-02-20 18:13:19,027 INFO L272 TraceCheckUtils]: 16: Hoare triple {1301#(<= ackermann_~m 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1219#true} is VALID [2022-02-20 18:13:19,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,028 INFO L272 TraceCheckUtils]: 20: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,029 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {1324#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {1324#(<= 1 |ackermann_#in~m|)} assume true; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,031 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1324#(<= 1 |ackermann_#in~m|)} {1301#(<= ackermann_~m 1)} #49#return; {1220#false} is VALID [2022-02-20 18:13:19,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {1220#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1220#false} is VALID [2022-02-20 18:13:19,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:19,031 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1220#false} {1219#true} #45#return; {1220#false} is VALID [2022-02-20 18:13:19,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:19,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#true} assume 0 == ~n; {1219#true} is VALID [2022-02-20 18:13:19,032 INFO L272 TraceCheckUtils]: 3: Hoare triple {1219#true} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:19,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#true} assume !(0 == ~n); {1219#true} is VALID [2022-02-20 18:13:19,032 INFO L272 TraceCheckUtils]: 7: Hoare triple {1219#true} call #t~ret5 := ackermann(~m, ~n - 1); {1219#true} is VALID [2022-02-20 18:13:19,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,033 INFO L272 TraceCheckUtils]: 11: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,035 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {1318#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {1318#(<= |ackermann_#in~m| 1)} assume true; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,036 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1318#(<= |ackermann_#in~m| 1)} {1219#true} #47#return; {1301#(<= ackermann_~m 1)} is VALID [2022-02-20 18:13:19,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {1301#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1301#(<= ackermann_~m 1)} is VALID [2022-02-20 18:13:19,036 INFO L272 TraceCheckUtils]: 20: Hoare triple {1301#(<= ackermann_~m 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1219#true} is VALID [2022-02-20 18:13:19,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,037 INFO L272 TraceCheckUtils]: 24: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,041 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {1324#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {1324#(<= 1 |ackermann_#in~m|)} assume true; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,042 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1324#(<= 1 |ackermann_#in~m|)} {1301#(<= ackermann_~m 1)} #49#return; {1220#false} is VALID [2022-02-20 18:13:19,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {1220#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1220#false} is VALID [2022-02-20 18:13:19,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:19,043 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1220#false} {1219#true} #45#return; {1220#false} is VALID [2022-02-20 18:13:19,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {1220#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1220#false} is VALID [2022-02-20 18:13:19,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:19,043 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1220#false} {1219#true} #43#return; {1220#false} is VALID [2022-02-20 18:13:19,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1219#true} is VALID [2022-02-20 18:13:19,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1219#true} is VALID [2022-02-20 18:13:19,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1219#true} is VALID [2022-02-20 18:13:19,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {1219#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {1219#true} is VALID [2022-02-20 18:13:19,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {1219#true} is VALID [2022-02-20 18:13:19,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:19,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {1219#true} assume 0 == ~n; {1219#true} is VALID [2022-02-20 18:13:19,045 INFO L272 TraceCheckUtils]: 8: Hoare triple {1219#true} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:19,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {1219#true} assume !(0 == ~n); {1219#true} is VALID [2022-02-20 18:13:19,045 INFO L272 TraceCheckUtils]: 12: Hoare triple {1219#true} call #t~ret5 := ackermann(~m, ~n - 1); {1219#true} is VALID [2022-02-20 18:13:19,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,046 INFO L272 TraceCheckUtils]: 16: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,048 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {1318#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {1318#(<= |ackermann_#in~m| 1)} assume true; {1318#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:19,049 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1318#(<= |ackermann_#in~m| 1)} {1219#true} #47#return; {1301#(<= ackermann_~m 1)} is VALID [2022-02-20 18:13:19,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {1301#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1301#(<= ackermann_~m 1)} is VALID [2022-02-20 18:13:19,049 INFO L272 TraceCheckUtils]: 25: Hoare triple {1301#(<= ackermann_~m 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1219#true} is VALID [2022-02-20 18:13:19,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,050 INFO L272 TraceCheckUtils]: 29: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1313#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {1313#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {1319#(= |ackermann_#in~m| 0)} assume true; {1319#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:19,052 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1319#(= |ackermann_#in~m| 0)} {1313#(= ackermann_~m |ackermann_#in~m|)} #45#return; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {1324#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {1324#(<= 1 |ackermann_#in~m|)} assume true; {1324#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:19,053 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1324#(<= 1 |ackermann_#in~m|)} {1301#(<= ackermann_~m 1)} #49#return; {1220#false} is VALID [2022-02-20 18:13:19,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {1220#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1220#false} is VALID [2022-02-20 18:13:19,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:19,053 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1220#false} {1219#true} #45#return; {1220#false} is VALID [2022-02-20 18:13:19,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {1220#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1220#false} is VALID [2022-02-20 18:13:19,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:19,053 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1220#false} {1219#true} #43#return; {1220#false} is VALID [2022-02-20 18:13:19,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {1220#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1220#false} is VALID [2022-02-20 18:13:19,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {1220#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {1220#false} is VALID [2022-02-20 18:13:19,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {1220#false} assume !false; {1220#false} is VALID [2022-02-20 18:13:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-20 18:13:19,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:19,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124269142] [2022-02-20 18:13:19,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124269142] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:19,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276577961] [2022-02-20 18:13:19,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:13:19,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:19,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:19,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:19,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 18:13:19,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:13:19,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:19,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 18:13:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:19,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:19,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1219#true} is VALID [2022-02-20 18:13:19,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1219#true} is VALID [2022-02-20 18:13:19,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1219#true} is VALID [2022-02-20 18:13:19,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {1219#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {1219#true} is VALID [2022-02-20 18:13:19,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {1219#true} is VALID [2022-02-20 18:13:19,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:19,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {1219#true} assume 0 == ~n; {1219#true} is VALID [2022-02-20 18:13:19,371 INFO L272 TraceCheckUtils]: 8: Hoare triple {1219#true} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:19,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {1219#true} assume !(0 == ~n); {1219#true} is VALID [2022-02-20 18:13:19,371 INFO L272 TraceCheckUtils]: 12: Hoare triple {1219#true} call #t~ret5 := ackermann(~m, ~n - 1); {1219#true} is VALID [2022-02-20 18:13:19,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:19,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {1219#true} assume 0 == ~n; {1219#true} is VALID [2022-02-20 18:13:19,372 INFO L272 TraceCheckUtils]: 16: Hoare triple {1219#true} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1379#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:19,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {1379#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {1383#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:19,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {1383#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1383#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:19,374 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1383#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1219#true} #45#return; {1390#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:19,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1394#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:19,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {1394#(<= 2 |ackermann_#res|)} assume true; {1394#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:19,375 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1394#(<= 2 |ackermann_#res|)} {1219#true} #47#return; {1401#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:19,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {1401#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1401#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:19,376 INFO L272 TraceCheckUtils]: 25: Hoare triple {1401#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1219#true} is VALID [2022-02-20 18:13:19,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1379#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:19,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {1379#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {1379#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:19,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {1379#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {1417#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:19,377 INFO L272 TraceCheckUtils]: 29: Hoare triple {1417#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:19,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:19,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {1219#true} assume 0 == ~m;#res := 1 + ~n; {1219#true} is VALID [2022-02-20 18:13:19,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {1219#true} assume true; {1219#true} is VALID [2022-02-20 18:13:19,377 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1219#true} {1417#(<= |ackermann_#in~n| 0)} #45#return; {1417#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:19,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {1417#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1417#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:19,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {1417#(<= |ackermann_#in~n| 0)} assume true; {1417#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:19,379 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1417#(<= |ackermann_#in~n| 0)} {1401#(<= 2 |ackermann_#t~ret5|)} #49#return; {1220#false} is VALID [2022-02-20 18:13:19,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {1220#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1220#false} is VALID [2022-02-20 18:13:19,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:19,379 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1220#false} {1219#true} #45#return; {1220#false} is VALID [2022-02-20 18:13:19,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {1220#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1220#false} is VALID [2022-02-20 18:13:19,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:19,379 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1220#false} {1219#true} #43#return; {1220#false} is VALID [2022-02-20 18:13:19,379 INFO L290 TraceCheckUtils]: 43: Hoare triple {1220#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1220#false} is VALID [2022-02-20 18:13:19,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {1220#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {1220#false} is VALID [2022-02-20 18:13:19,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {1220#false} assume !false; {1220#false} is VALID [2022-02-20 18:13:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 18:13:19,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:20,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {1220#false} assume !false; {1220#false} is VALID [2022-02-20 18:13:20,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {1220#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {1220#false} is VALID [2022-02-20 18:13:20,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {1220#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {1220#false} is VALID [2022-02-20 18:13:20,544 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1220#false} {1219#true} #43#return; {1220#false} is VALID [2022-02-20 18:13:20,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:20,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {1220#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1220#false} is VALID [2022-02-20 18:13:20,544 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1220#false} {1219#true} #45#return; {1220#false} is VALID [2022-02-20 18:13:20,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {1220#false} assume true; {1220#false} is VALID [2022-02-20 18:13:20,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {1220#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1220#false} is VALID [2022-02-20 18:13:20,553 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1417#(<= |ackermann_#in~n| 0)} {1502#(< 0 |ackermann_#t~ret5|)} #49#return; {1220#false} is VALID [2022-02-20 18:13:20,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {1417#(<= |ackermann_#in~n| 0)} assume true; {1417#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:20,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {1417#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1417#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:20,554 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1219#true} {1417#(<= |ackermann_#in~n| 0)} #45#return; {1417#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:20,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {1219#true} assume true; {1219#true} is VALID [2022-02-20 18:13:20,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {1219#true} assume 0 == ~m;#res := 1 + ~n; {1219#true} is VALID [2022-02-20 18:13:20,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:20,554 INFO L272 TraceCheckUtils]: 29: Hoare triple {1417#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:20,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {1530#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume 0 == ~n; {1417#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:20,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {1530#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume !(0 == ~m); {1530#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-20 18:13:20,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1530#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-20 18:13:20,555 INFO L272 TraceCheckUtils]: 25: Hoare triple {1502#(< 0 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1219#true} is VALID [2022-02-20 18:13:20,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {1502#(< 0 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1502#(< 0 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:20,560 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1546#(< 0 |ackermann_#res|)} {1219#true} #47#return; {1502#(< 0 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:20,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {1546#(< 0 |ackermann_#res|)} assume true; {1546#(< 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:20,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {1553#(< 0 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1546#(< 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:20,561 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1560#(or (not (<= 1 |ackermann_#in~n|)) (< 0 |ackermann_#res|))} {1219#true} #45#return; {1553#(< 0 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:20,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#(or (not (<= 1 |ackermann_#in~n|)) (< 0 |ackermann_#res|))} assume true; {1560#(or (not (<= 1 |ackermann_#in~n|)) (< 0 |ackermann_#res|))} is VALID [2022-02-20 18:13:20,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {1567#(or (< 0 (+ ackermann_~n 1)) (not (<= 1 |ackermann_#in~n|)))} assume 0 == ~m;#res := 1 + ~n; {1560#(or (not (<= 1 |ackermann_#in~n|)) (< 0 |ackermann_#res|))} is VALID [2022-02-20 18:13:20,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1567#(or (< 0 (+ ackermann_~n 1)) (not (<= 1 |ackermann_#in~n|)))} is VALID [2022-02-20 18:13:20,564 INFO L272 TraceCheckUtils]: 16: Hoare triple {1219#true} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1219#true} assume 0 == ~n; {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L272 TraceCheckUtils]: 12: Hoare triple {1219#true} call #t~ret5 := ackermann(~m, ~n - 1); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {1219#true} assume !(0 == ~n); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L272 TraceCheckUtils]: 8: Hoare triple {1219#true} call #t~ret4 := ackermann(~m - 1, 1); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {1219#true} assume 0 == ~n; {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#true} assume !(0 == ~m); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#true} ~m := #in~m;~n := #in~n; {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {1219#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1219#true} is VALID [2022-02-20 18:13:20,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1219#true} is VALID [2022-02-20 18:13:20,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1219#true} is VALID [2022-02-20 18:13:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 18:13:20,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276577961] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:20,565 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:20,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 19 [2022-02-20 18:13:20,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404846604] [2022-02-20 18:13:20,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:20,566 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 46 [2022-02-20 18:13:20,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:20,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:13:20,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:20,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:13:20,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:13:20,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:13:20,617 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:13:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:21,312 INFO L93 Difference]: Finished difference Result 96 states and 220 transitions. [2022-02-20 18:13:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:13:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 46 [2022-02-20 18:13:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:13:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-02-20 18:13:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:13:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-02-20 18:13:21,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 77 transitions. [2022-02-20 18:13:21,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:21,381 INFO L225 Difference]: With dead ends: 96 [2022-02-20 18:13:21,381 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 18:13:21,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2022-02-20 18:13:21,383 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:21,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 114 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:13:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 18:13:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-02-20 18:13:21,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:21,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57) [2022-02-20 18:13:21,413 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57) [2022-02-20 18:13:21,413 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57) [2022-02-20 18:13:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:21,417 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-02-20 18:13:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2022-02-20 18:13:21,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:21,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:21,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57) Second operand 63 states. [2022-02-20 18:13:21,418 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57) Second operand 63 states. [2022-02-20 18:13:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:21,422 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-02-20 18:13:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2022-02-20 18:13:21,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:21,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:21,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:21,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57) [2022-02-20 18:13:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 107 transitions. [2022-02-20 18:13:21,426 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 107 transitions. Word has length 46 [2022-02-20 18:13:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:21,426 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 107 transitions. [2022-02-20 18:13:21,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-02-20 18:13:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 107 transitions. [2022-02-20 18:13:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:13:21,428 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:21,428 INFO L514 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] [2022-02-20 18:13:21,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:21,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:21,647 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:21,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash 421612277, now seen corresponding path program 3 times [2022-02-20 18:13:21,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:21,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613404744] [2022-02-20 18:13:21,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:21,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 18:13:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:21,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,855 INFO L272 TraceCheckUtils]: 3: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:21,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,857 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {2147#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,859 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #47#return; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:13:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2137#(<= 2 |ackermann_#t~ret5|)} #49#return; {2142#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:21,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:21,886 INFO L272 TraceCheckUtils]: 3: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:21,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,886 INFO L272 TraceCheckUtils]: 7: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:21,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,888 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {2147#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,889 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #47#return; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,890 INFO L272 TraceCheckUtils]: 16: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:21,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,892 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2137#(<= 2 |ackermann_#t~ret5|)} #49#return; {2142#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:21,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {2142#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,893 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #45#return; {2124#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,894 INFO L272 TraceCheckUtils]: 3: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:21,895 INFO L272 TraceCheckUtils]: 7: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:21,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,895 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:21,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,897 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {2147#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,898 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #47#return; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,899 INFO L272 TraceCheckUtils]: 20: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:21,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,900 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2137#(<= 2 |ackermann_#t~ret5|)} #49#return; {2142#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:21,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {2142#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,902 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #45#return; {2124#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {2124#(<= 3 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,903 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #47#return; {2088#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 18:13:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:21,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:21,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:21,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#true} {2153#(= |ackermann_#in~n| 0)} #45#return; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,921 INFO L272 TraceCheckUtils]: 3: Hoare triple {2153#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:21,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:21,922 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1944#true} {2153#(= |ackermann_#in~n| 0)} #45#return; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {2153#(= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {2153#(= |ackermann_#in~n| 0)} assume true; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2153#(= |ackermann_#in~n| 0)} {2088#(<= 3 |ackermann_#t~ret5|)} #49#return; {1945#false} is VALID [2022-02-20 18:13:21,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:21,924 INFO L272 TraceCheckUtils]: 3: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:21,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,925 INFO L272 TraceCheckUtils]: 7: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:21,925 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:21,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,926 INFO L272 TraceCheckUtils]: 15: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:21,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,927 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {2147#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,928 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #47#return; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,929 INFO L272 TraceCheckUtils]: 24: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:21,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,930 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2137#(<= 2 |ackermann_#t~ret5|)} #49#return; {2142#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:21,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {2142#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,954 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #45#return; {2124#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {2124#(<= 3 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,955 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #47#return; {2088#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {2088#(<= 3 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2088#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,955 INFO L272 TraceCheckUtils]: 36: Hoare triple {2088#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:21,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,958 INFO L272 TraceCheckUtils]: 40: Hoare triple {2153#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:21,958 INFO L290 TraceCheckUtils]: 43: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:21,959 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1944#true} {2153#(= |ackermann_#in~n| 0)} #45#return; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {2153#(= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {2153#(= |ackermann_#in~n| 0)} assume true; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,960 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2153#(= |ackermann_#in~n| 0)} {2088#(<= 3 |ackermann_#t~ret5|)} #49#return; {1945#false} is VALID [2022-02-20 18:13:21,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {1945#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1945#false} is VALID [2022-02-20 18:13:21,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {1945#false} assume true; {1945#false} is VALID [2022-02-20 18:13:21,960 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1945#false} {1944#true} #45#return; {1945#false} is VALID [2022-02-20 18:13:21,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,961 INFO L272 TraceCheckUtils]: 3: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L272 TraceCheckUtils]: 7: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:21,962 INFO L272 TraceCheckUtils]: 15: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:21,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,963 INFO L272 TraceCheckUtils]: 19: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:21,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,965 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {2147#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,966 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #47#return; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,966 INFO L272 TraceCheckUtils]: 28: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:21,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,968 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2137#(<= 2 |ackermann_#t~ret5|)} #49#return; {2142#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:21,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {2142#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,969 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #45#return; {2124#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {2124#(<= 3 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,970 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #47#return; {2088#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {2088#(<= 3 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2088#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,970 INFO L272 TraceCheckUtils]: 40: Hoare triple {2088#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:21,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,971 INFO L272 TraceCheckUtils]: 44: Hoare triple {2153#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:21,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:21,972 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1944#true} {2153#(= |ackermann_#in~n| 0)} #45#return; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {2153#(= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {2153#(= |ackermann_#in~n| 0)} assume true; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,973 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2153#(= |ackermann_#in~n| 0)} {2088#(<= 3 |ackermann_#t~ret5|)} #49#return; {1945#false} is VALID [2022-02-20 18:13:21,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {1945#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1945#false} is VALID [2022-02-20 18:13:21,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {1945#false} assume true; {1945#false} is VALID [2022-02-20 18:13:21,973 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {1945#false} {1944#true} #45#return; {1945#false} is VALID [2022-02-20 18:13:21,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {1945#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1945#false} is VALID [2022-02-20 18:13:21,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {1945#false} assume true; {1945#false} is VALID [2022-02-20 18:13:21,974 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1945#false} {1944#true} #43#return; {2004#(<= 5 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:21,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1944#true} is VALID [2022-02-20 18:13:21,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1944#true} is VALID [2022-02-20 18:13:21,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1944#true} is VALID [2022-02-20 18:13:21,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {1944#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {1944#true} is VALID [2022-02-20 18:13:21,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {1944#true} is VALID [2022-02-20 18:13:21,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,975 INFO L272 TraceCheckUtils]: 8: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L272 TraceCheckUtils]: 12: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L272 TraceCheckUtils]: 16: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:21,976 INFO L272 TraceCheckUtils]: 20: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:21,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:21,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:21,977 INFO L272 TraceCheckUtils]: 24: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-20 18:13:21,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {2149#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-20 18:13:21,978 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2150#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {2147#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,980 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #47#return; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2137#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,980 INFO L272 TraceCheckUtils]: 33: Hoare triple {2137#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:21,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:21,982 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2137#(<= 2 |ackermann_#t~ret5|)} #49#return; {2142#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:21,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {2142#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,983 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #45#return; {2124#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:21,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {2124#(<= 3 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {2125#(<= 3 |ackermann_#res|)} assume true; {2125#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:21,984 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2125#(<= 3 |ackermann_#res|)} {1944#true} #47#return; {2088#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {2088#(<= 3 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2088#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:21,984 INFO L272 TraceCheckUtils]: 45: Hoare triple {2088#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:21,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {2151#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-20 18:13:21,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {2151#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,985 INFO L272 TraceCheckUtils]: 49: Hoare triple {2153#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:21,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:21,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:21,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:21,986 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1944#true} {2153#(= |ackermann_#in~n| 0)} #45#return; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {2153#(= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {2153#(= |ackermann_#in~n| 0)} assume true; {2153#(= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:21,987 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2153#(= |ackermann_#in~n| 0)} {2088#(<= 3 |ackermann_#t~ret5|)} #49#return; {1945#false} is VALID [2022-02-20 18:13:21,987 INFO L290 TraceCheckUtils]: 57: Hoare triple {1945#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1945#false} is VALID [2022-02-20 18:13:21,987 INFO L290 TraceCheckUtils]: 58: Hoare triple {1945#false} assume true; {1945#false} is VALID [2022-02-20 18:13:21,987 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {1945#false} {1944#true} #45#return; {1945#false} is VALID [2022-02-20 18:13:21,987 INFO L290 TraceCheckUtils]: 60: Hoare triple {1945#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1945#false} is VALID [2022-02-20 18:13:21,988 INFO L290 TraceCheckUtils]: 61: Hoare triple {1945#false} assume true; {1945#false} is VALID [2022-02-20 18:13:21,988 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {1945#false} {1944#true} #43#return; {2004#(<= 5 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:21,988 INFO L290 TraceCheckUtils]: 63: Hoare triple {2004#(<= 5 |ULTIMATE.start_main_#t~ret9#1|)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2005#(<= 5 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:21,988 INFO L290 TraceCheckUtils]: 64: Hoare triple {2005#(<= 5 |ULTIMATE.start_main_~result~0#1|)} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {1945#false} is VALID [2022-02-20 18:13:21,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {1945#false} assume !false; {1945#false} is VALID [2022-02-20 18:13:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 76 proven. 29 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-02-20 18:13:21,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:21,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613404744] [2022-02-20 18:13:21,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613404744] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:21,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910355359] [2022-02-20 18:13:21,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 18:13:21,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:21,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:21,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:21,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 18:13:22,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 18:13:22,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:22,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 18:13:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:22,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:22,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1944#true} is VALID [2022-02-20 18:13:22,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1944#true} is VALID [2022-02-20 18:13:22,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1944#true} is VALID [2022-02-20 18:13:22,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {1944#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {1944#true} is VALID [2022-02-20 18:13:22,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {1944#true} is VALID [2022-02-20 18:13:22,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:22,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:22,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L272 TraceCheckUtils]: 8: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L272 TraceCheckUtils]: 16: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:22,267 INFO L272 TraceCheckUtils]: 20: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L272 TraceCheckUtils]: 24: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1944#true} {1944#true} #45#return; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1944#true} {1944#true} #47#return; {1944#true} is VALID [2022-02-20 18:13:22,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {1944#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1944#true} is VALID [2022-02-20 18:13:22,269 INFO L272 TraceCheckUtils]: 33: Hoare triple {1944#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:22,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:22,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:22,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:22,269 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1944#true} {1944#true} #49#return; {1944#true} is VALID [2022-02-20 18:13:22,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1944#true} is VALID [2022-02-20 18:13:22,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:22,269 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1944#true} {1944#true} #45#return; {1944#true} is VALID [2022-02-20 18:13:22,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {1944#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1944#true} is VALID [2022-02-20 18:13:22,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:22,270 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1944#true} {1944#true} #47#return; {1944#true} is VALID [2022-02-20 18:13:22,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {1944#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1944#true} is VALID [2022-02-20 18:13:22,270 INFO L272 TraceCheckUtils]: 45: Hoare triple {1944#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:22,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:22,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:22,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:22,271 INFO L272 TraceCheckUtils]: 49: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:22,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2311#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:22,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {2311#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:22,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:22,279 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2152#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:22,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {2147#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:22,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:22,280 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #49#return; {2330#(<= 2 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:22,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {2330#(<= 2 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:22,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:22,282 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #45#return; {2147#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:22,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {2147#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:22,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {2148#(<= 2 |ackermann_#res|)} assume true; {2148#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:22,283 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2148#(<= 2 |ackermann_#res|)} {1944#true} #43#return; {2349#(<= 2 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:22,284 INFO L290 TraceCheckUtils]: 63: Hoare triple {2349#(<= 2 |ULTIMATE.start_main_#t~ret9#1|)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2353#(<= 2 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:22,284 INFO L290 TraceCheckUtils]: 64: Hoare triple {2353#(<= 2 |ULTIMATE.start_main_~result~0#1|)} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {1945#false} is VALID [2022-02-20 18:13:22,284 INFO L290 TraceCheckUtils]: 65: Hoare triple {1945#false} assume !false; {1945#false} is VALID [2022-02-20 18:13:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 53 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-02-20 18:13:22,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:24,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {1945#false} assume !false; {1945#false} is VALID [2022-02-20 18:13:24,165 INFO L290 TraceCheckUtils]: 64: Hoare triple {2363#(<= 0 |ULTIMATE.start_main_~result~0#1|)} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {1945#false} is VALID [2022-02-20 18:13:24,165 INFO L290 TraceCheckUtils]: 63: Hoare triple {2367#(<= 0 |ULTIMATE.start_main_#t~ret9#1|)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2363#(<= 0 |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:13:24,166 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2374#(<= 0 |ackermann_#res|)} {1944#true} #43#return; {2367#(<= 0 |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 18:13:24,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {2374#(<= 0 |ackermann_#res|)} assume true; {2374#(<= 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:24,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {2381#(<= 0 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2374#(<= 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:24,170 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2374#(<= 0 |ackermann_#res|)} {1944#true} #45#return; {2381#(<= 0 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:24,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {2374#(<= 0 |ackermann_#res|)} assume true; {2374#(<= 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:24,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {2394#(<= 0 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2374#(<= 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:24,172 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2374#(<= 0 |ackermann_#res|)} {1944#true} #49#return; {2394#(<= 0 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:24,172 INFO L290 TraceCheckUtils]: 55: Hoare triple {2374#(<= 0 |ackermann_#res|)} assume true; {2374#(<= 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:24,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {2381#(<= 0 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2374#(<= 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:24,173 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2413#(or (not (<= 1 |ackermann_#in~n|)) (<= 0 |ackermann_#res|))} {1944#true} #45#return; {2381#(<= 0 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:24,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {2413#(or (not (<= 1 |ackermann_#in~n|)) (<= 0 |ackermann_#res|))} assume true; {2413#(or (not (<= 1 |ackermann_#in~n|)) (<= 0 |ackermann_#res|))} is VALID [2022-02-20 18:13:24,174 INFO L290 TraceCheckUtils]: 51: Hoare triple {2420#(or (<= 0 (+ ackermann_~n 1)) (not (<= 1 |ackermann_#in~n|)))} assume 0 == ~m;#res := 1 + ~n; {2413#(or (not (<= 1 |ackermann_#in~n|)) (<= 0 |ackermann_#res|))} is VALID [2022-02-20 18:13:24,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {2420#(or (<= 0 (+ ackermann_~n 1)) (not (<= 1 |ackermann_#in~n|)))} is VALID [2022-02-20 18:13:24,175 INFO L272 TraceCheckUtils]: 49: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L272 TraceCheckUtils]: 45: Hoare triple {1944#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {1944#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1944#true} {1944#true} #47#return; {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {1944#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1944#true} {1944#true} #45#return; {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:24,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1944#true} {1944#true} #49#return; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L272 TraceCheckUtils]: 33: Hoare triple {1944#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {1944#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1944#true} {1944#true} #47#return; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1944#true} {1944#true} #45#return; {1944#true} is VALID [2022-02-20 18:13:24,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {1944#true} assume true; {1944#true} is VALID [2022-02-20 18:13:24,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {1944#true} assume 0 == ~m;#res := 1 + ~n; {1944#true} is VALID [2022-02-20 18:13:24,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:24,177 INFO L272 TraceCheckUtils]: 24: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:24,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:24,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:24,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:24,177 INFO L272 TraceCheckUtils]: 20: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:24,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:24,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:24,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:24,178 INFO L272 TraceCheckUtils]: 16: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:24,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:24,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:24,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:24,179 INFO L272 TraceCheckUtils]: 12: Hoare triple {1944#true} call #t~ret5 := ackermann(~m, ~n - 1); {1944#true} is VALID [2022-02-20 18:13:24,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {1944#true} assume !(0 == ~n); {1944#true} is VALID [2022-02-20 18:13:24,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:24,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:24,179 INFO L272 TraceCheckUtils]: 8: Hoare triple {1944#true} call #t~ret4 := ackermann(~m - 1, 1); {1944#true} is VALID [2022-02-20 18:13:24,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#true} assume 0 == ~n; {1944#true} is VALID [2022-02-20 18:13:24,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#true} assume !(0 == ~m); {1944#true} is VALID [2022-02-20 18:13:24,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#true} ~m := #in~m;~n := #in~n; {1944#true} is VALID [2022-02-20 18:13:24,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {1944#true} is VALID [2022-02-20 18:13:24,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {1944#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {1944#true} is VALID [2022-02-20 18:13:24,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1944#true} is VALID [2022-02-20 18:13:24,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1944#true} is VALID [2022-02-20 18:13:24,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1944#true} is VALID [2022-02-20 18:13:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-02-20 18:13:24,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910355359] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:24,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-20 18:13:24,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 9] total 27 [2022-02-20 18:13:24,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292687968] [2022-02-20 18:13:24,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:24,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-02-20 18:13:24,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:24,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 18:13:24,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:24,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:13:24,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:24,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:13:24,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-02-20 18:13:24,211 INFO L87 Difference]: Start difference. First operand 60 states and 107 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 18:13:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:24,544 INFO L93 Difference]: Finished difference Result 76 states and 139 transitions. [2022-02-20 18:13:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:13:24,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-02-20 18:13:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 18:13:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-02-20 18:13:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 18:13:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-02-20 18:13:24,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-02-20 18:13:24,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:24,589 INFO L225 Difference]: With dead ends: 76 [2022-02-20 18:13:24,589 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 18:13:24,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2022-02-20 18:13:24,590 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:24,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 85 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 18:13:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-02-20 18:13:24,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:24,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 15 states have return successors, (75), 21 states have call predecessors, (75), 9 states have call successors, (75) [2022-02-20 18:13:24,626 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 15 states have return successors, (75), 21 states have call predecessors, (75), 9 states have call successors, (75) [2022-02-20 18:13:24,627 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 15 states have return successors, (75), 21 states have call predecessors, (75), 9 states have call successors, (75) [2022-02-20 18:13:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:24,631 INFO L93 Difference]: Finished difference Result 72 states and 133 transitions. [2022-02-20 18:13:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2022-02-20 18:13:24,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:24,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:24,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 15 states have return successors, (75), 21 states have call predecessors, (75), 9 states have call successors, (75) Second operand 72 states. [2022-02-20 18:13:24,633 INFO L87 Difference]: Start difference. First operand has 72 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 15 states have return successors, (75), 21 states have call predecessors, (75), 9 states have call successors, (75) Second operand 72 states. [2022-02-20 18:13:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:24,637 INFO L93 Difference]: Finished difference Result 72 states and 133 transitions. [2022-02-20 18:13:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2022-02-20 18:13:24,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:24,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:24,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:24,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 15 states have return successors, (75), 21 states have call predecessors, (75), 9 states have call successors, (75) [2022-02-20 18:13:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2022-02-20 18:13:24,642 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 66 [2022-02-20 18:13:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:24,643 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2022-02-20 18:13:24,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 18:13:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2022-02-20 18:13:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 18:13:24,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:24,648 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 8, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:24,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 18:13:24,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:24,861 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash -558645120, now seen corresponding path program 4 times [2022-02-20 18:13:24,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:24,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425077767] [2022-02-20 18:13:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:24,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 18:13:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:24,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2883#true} {2883#true} #45#return; {2883#true} is VALID [2022-02-20 18:13:25,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,043 INFO L272 TraceCheckUtils]: 3: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,043 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2883#true} {2883#true} #45#return; {2883#true} is VALID [2022-02-20 18:13:25,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {2883#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2883#true} is VALID [2022-02-20 18:13:25,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2883#true} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:13:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #49#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,056 INFO L272 TraceCheckUtils]: 3: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,057 INFO L272 TraceCheckUtils]: 7: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,058 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2883#true} {2883#true} #45#return; {2883#true} is VALID [2022-02-20 18:13:25,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {2883#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2883#true} is VALID [2022-02-20 18:13:25,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,058 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2883#true} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,059 INFO L272 TraceCheckUtils]: 16: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,060 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #49#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,062 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,063 INFO L272 TraceCheckUtils]: 3: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,066 INFO L272 TraceCheckUtils]: 7: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,067 INFO L272 TraceCheckUtils]: 11: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2883#true} {2883#true} #45#return; {2883#true} is VALID [2022-02-20 18:13:25,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {2883#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2883#true} is VALID [2022-02-20 18:13:25,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,068 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2883#true} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,069 INFO L272 TraceCheckUtils]: 20: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,070 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #49#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,071 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume true; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,072 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3122#(<= |ackermann_#in~m| 2)} {2883#true} #47#return; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 18:13:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,128 INFO L272 TraceCheckUtils]: 3: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,129 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:13:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2883#true} {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,136 INFO L272 TraceCheckUtils]: 3: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,137 INFO L272 TraceCheckUtils]: 7: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,139 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,164 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,164 INFO L272 TraceCheckUtils]: 16: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,165 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2883#true} {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,167 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,168 INFO L272 TraceCheckUtils]: 3: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,169 INFO L272 TraceCheckUtils]: 7: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,170 INFO L272 TraceCheckUtils]: 11: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,171 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,172 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,173 INFO L272 TraceCheckUtils]: 20: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,174 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2883#true} {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,175 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume true; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,176 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3168#(<= 2 |ackermann_#in~m|)} {3065#(<= ackermann_~m 2)} #49#return; {2884#false} is VALID [2022-02-20 18:13:25,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume !(0 == ~n); {2883#true} is VALID [2022-02-20 18:13:25,177 INFO L272 TraceCheckUtils]: 3: Hoare triple {2883#true} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,178 INFO L272 TraceCheckUtils]: 7: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,179 INFO L272 TraceCheckUtils]: 11: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,179 INFO L272 TraceCheckUtils]: 15: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,180 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2883#true} {2883#true} #45#return; {2883#true} is VALID [2022-02-20 18:13:25,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {2883#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2883#true} is VALID [2022-02-20 18:13:25,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,180 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2883#true} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,181 INFO L272 TraceCheckUtils]: 24: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,182 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #49#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,183 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume true; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,185 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3122#(<= |ackermann_#in~m| 2)} {2883#true} #47#return; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {3065#(<= ackermann_~m 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,185 INFO L272 TraceCheckUtils]: 36: Hoare triple {3065#(<= ackermann_~m 2)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,186 INFO L272 TraceCheckUtils]: 40: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,187 INFO L272 TraceCheckUtils]: 44: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,188 INFO L290 TraceCheckUtils]: 47: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,188 INFO L272 TraceCheckUtils]: 48: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,189 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,191 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,191 INFO L272 TraceCheckUtils]: 57: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,192 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2883#true} {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,194 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,194 INFO L290 TraceCheckUtils]: 66: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume true; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,195 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3168#(<= 2 |ackermann_#in~m|)} {3065#(<= ackermann_~m 2)} #49#return; {2884#false} is VALID [2022-02-20 18:13:25,195 INFO L290 TraceCheckUtils]: 68: Hoare triple {2884#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2884#false} is VALID [2022-02-20 18:13:25,195 INFO L290 TraceCheckUtils]: 69: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:25,195 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2884#false} {2883#true} #45#return; {2884#false} is VALID [2022-02-20 18:13:25,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,196 INFO L272 TraceCheckUtils]: 3: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {2883#true} assume !(0 == ~n); {2883#true} is VALID [2022-02-20 18:13:25,196 INFO L272 TraceCheckUtils]: 7: Hoare triple {2883#true} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,197 INFO L272 TraceCheckUtils]: 11: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,199 INFO L272 TraceCheckUtils]: 15: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,200 INFO L272 TraceCheckUtils]: 19: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,200 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2883#true} {2883#true} #45#return; {2883#true} is VALID [2022-02-20 18:13:25,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {2883#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2883#true} is VALID [2022-02-20 18:13:25,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,201 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2883#true} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,201 INFO L272 TraceCheckUtils]: 28: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,203 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #49#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,204 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume true; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,205 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3122#(<= |ackermann_#in~m| 2)} {2883#true} #47#return; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {3065#(<= ackermann_~m 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,206 INFO L272 TraceCheckUtils]: 40: Hoare triple {3065#(<= ackermann_~m 2)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,207 INFO L272 TraceCheckUtils]: 44: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,208 INFO L272 TraceCheckUtils]: 48: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,209 INFO L272 TraceCheckUtils]: 52: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,210 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,211 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,212 INFO L290 TraceCheckUtils]: 60: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,212 INFO L272 TraceCheckUtils]: 61: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,213 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {2883#true} {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,213 INFO L290 TraceCheckUtils]: 66: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,213 INFO L290 TraceCheckUtils]: 67: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,214 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,214 INFO L290 TraceCheckUtils]: 69: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,215 INFO L290 TraceCheckUtils]: 70: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume true; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,215 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3168#(<= 2 |ackermann_#in~m|)} {3065#(<= ackermann_~m 2)} #49#return; {2884#false} is VALID [2022-02-20 18:13:25,215 INFO L290 TraceCheckUtils]: 72: Hoare triple {2884#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2884#false} is VALID [2022-02-20 18:13:25,215 INFO L290 TraceCheckUtils]: 73: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:25,216 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {2884#false} {2883#true} #45#return; {2884#false} is VALID [2022-02-20 18:13:25,216 INFO L290 TraceCheckUtils]: 75: Hoare triple {2884#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2884#false} is VALID [2022-02-20 18:13:25,216 INFO L290 TraceCheckUtils]: 76: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:25,216 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2884#false} {2883#true} #43#return; {2884#false} is VALID [2022-02-20 18:13:25,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2883#true} is VALID [2022-02-20 18:13:25,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2883#true} is VALID [2022-02-20 18:13:25,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2883#true} is VALID [2022-02-20 18:13:25,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {2883#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {2883#true} is VALID [2022-02-20 18:13:25,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {2883#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {2883#true} is VALID [2022-02-20 18:13:25,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,217 INFO L272 TraceCheckUtils]: 8: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {2883#true} assume !(0 == ~n); {2883#true} is VALID [2022-02-20 18:13:25,218 INFO L272 TraceCheckUtils]: 12: Hoare triple {2883#true} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,219 INFO L272 TraceCheckUtils]: 16: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,220 INFO L272 TraceCheckUtils]: 20: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,220 INFO L272 TraceCheckUtils]: 24: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,221 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2883#true} {2883#true} #45#return; {2883#true} is VALID [2022-02-20 18:13:25,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {2883#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2883#true} is VALID [2022-02-20 18:13:25,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,222 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2883#true} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,222 INFO L272 TraceCheckUtils]: 33: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,224 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #49#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,225 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume true; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,226 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3122#(<= |ackermann_#in~m| 2)} {2883#true} #47#return; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {3065#(<= ackermann_~m 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,226 INFO L272 TraceCheckUtils]: 45: Hoare triple {3065#(<= ackermann_~m 2)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,227 INFO L272 TraceCheckUtils]: 49: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,228 INFO L272 TraceCheckUtils]: 53: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,229 INFO L272 TraceCheckUtils]: 57: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3097#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {3097#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {3143#(= |ackermann_#in~m| 0)} assume true; {3143#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,231 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3143#(= |ackermann_#in~m| 0)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,232 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #47#return; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:25,233 INFO L272 TraceCheckUtils]: 66: Hoare triple {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,233 INFO L290 TraceCheckUtils]: 67: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,233 INFO L290 TraceCheckUtils]: 68: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,233 INFO L290 TraceCheckUtils]: 69: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,234 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2883#true} {3180#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,235 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3097#(= ackermann_~m |ackermann_#in~m|)} #45#return; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume true; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,237 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {3168#(<= 2 |ackermann_#in~m|)} {3065#(<= ackermann_~m 2)} #49#return; {2884#false} is VALID [2022-02-20 18:13:25,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {2884#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2884#false} is VALID [2022-02-20 18:13:25,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:25,237 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {2884#false} {2883#true} #45#return; {2884#false} is VALID [2022-02-20 18:13:25,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {2884#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2884#false} is VALID [2022-02-20 18:13:25,238 INFO L290 TraceCheckUtils]: 81: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:25,238 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {2884#false} {2883#true} #43#return; {2884#false} is VALID [2022-02-20 18:13:25,238 INFO L290 TraceCheckUtils]: 83: Hoare triple {2884#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2884#false} is VALID [2022-02-20 18:13:25,238 INFO L290 TraceCheckUtils]: 84: Hoare triple {2884#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {2884#false} is VALID [2022-02-20 18:13:25,238 INFO L290 TraceCheckUtils]: 85: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2022-02-20 18:13:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 136 proven. 61 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-02-20 18:13:25,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:25,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425077767] [2022-02-20 18:13:25,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425077767] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:25,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110013778] [2022-02-20 18:13:25,240 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 18:13:25,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:25,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:25,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:25,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 18:13:25,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 18:13:25,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:25,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 18:13:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:25,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2883#true} is VALID [2022-02-20 18:13:25,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2883#true} is VALID [2022-02-20 18:13:25,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2883#true} is VALID [2022-02-20 18:13:25,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {2883#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {2883#true} is VALID [2022-02-20 18:13:25,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {2883#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L272 TraceCheckUtils]: 8: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {2883#true} assume !(0 == ~n); {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L272 TraceCheckUtils]: 12: Hoare triple {2883#true} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} assume !(0 == ~m); {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} assume 0 == ~n; {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,746 INFO L272 TraceCheckUtils]: 16: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} assume !(0 == ~m); {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} assume !(0 == ~n); {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,747 INFO L272 TraceCheckUtils]: 20: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} assume !(0 == ~m); {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} assume 0 == ~n; {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,748 INFO L272 TraceCheckUtils]: 24: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3232#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2022-02-20 18:13:25,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {3232#(<= |ackermann_#in~m| ackermann_~m)} assume 0 == ~m;#res := 1 + ~n; {3272#(<= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {3272#(<= |ackermann_#in~m| 0)} assume true; {3272#(<= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:25,749 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3272#(<= |ackermann_#in~m| 0)} {3232#(<= |ackermann_#in~m| ackermann_~m)} #45#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,751 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3232#(<= |ackermann_#in~m| ackermann_~m)} #47#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,751 INFO L272 TraceCheckUtils]: 33: Hoare triple {3138#(<= |ackermann_#in~m| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,752 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2883#true} {3138#(<= |ackermann_#in~m| 1)} #49#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:25,753 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3232#(<= |ackermann_#in~m| ackermann_~m)} #45#return; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume true; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:25,754 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3122#(<= |ackermann_#in~m| 2)} {2883#true} #47#return; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {3065#(<= ackermann_~m 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:25,755 INFO L272 TraceCheckUtils]: 45: Hoare triple {3065#(<= ackermann_~m 2)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,766 INFO L272 TraceCheckUtils]: 49: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,767 INFO L272 TraceCheckUtils]: 53: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:25,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,768 INFO L272 TraceCheckUtils]: 57: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:25,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3333#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {3333#(<= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {3373#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {3373#(<= 0 |ackermann_#in~m|)} assume true; {3373#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,769 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3373#(<= 0 |ackermann_#in~m|)} {3333#(<= ackermann_~m |ackermann_#in~m|)} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,771 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3333#(<= ackermann_~m |ackermann_#in~m|)} #47#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,771 INFO L272 TraceCheckUtils]: 66: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:25,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:25,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:25,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:25,772 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2883#true} {3185#(<= 1 |ackermann_#in~m|)} #49#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,773 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3333#(<= ackermann_~m |ackermann_#in~m|)} #45#return; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume true; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:25,774 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {3168#(<= 2 |ackermann_#in~m|)} {3065#(<= ackermann_~m 2)} #49#return; {2884#false} is VALID [2022-02-20 18:13:25,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {2884#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {2884#false} {2883#true} #45#return; {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {2884#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {2884#false} {2883#true} #43#return; {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L290 TraceCheckUtils]: 83: Hoare triple {2884#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {2884#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2022-02-20 18:13:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 111 proven. 112 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-02-20 18:13:25,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:30,389 INFO L290 TraceCheckUtils]: 85: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2022-02-20 18:13:30,390 INFO L290 TraceCheckUtils]: 84: Hoare triple {2884#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {2884#false} is VALID [2022-02-20 18:13:30,390 INFO L290 TraceCheckUtils]: 83: Hoare triple {2884#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {2884#false} is VALID [2022-02-20 18:13:30,390 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {2884#false} {2883#true} #43#return; {2884#false} is VALID [2022-02-20 18:13:30,390 INFO L290 TraceCheckUtils]: 81: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:30,390 INFO L290 TraceCheckUtils]: 80: Hoare triple {2884#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {2884#false} is VALID [2022-02-20 18:13:30,390 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {2884#false} {2883#true} #45#return; {2884#false} is VALID [2022-02-20 18:13:30,390 INFO L290 TraceCheckUtils]: 78: Hoare triple {2884#false} assume true; {2884#false} is VALID [2022-02-20 18:13:30,390 INFO L290 TraceCheckUtils]: 77: Hoare triple {2884#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {2884#false} is VALID [2022-02-20 18:13:30,391 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {3168#(<= 2 |ackermann_#in~m|)} {3065#(<= ackermann_~m 2)} #49#return; {2884#false} is VALID [2022-02-20 18:13:30,391 INFO L290 TraceCheckUtils]: 75: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume true; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {3168#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,392 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3497#(or (< ackermann_~m 2) (<= 2 |ackermann_#in~m|))} #45#return; {3168#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,393 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2883#true} {3185#(<= 1 |ackermann_#in~m|)} #49#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,394 INFO L290 TraceCheckUtils]: 69: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:30,394 INFO L290 TraceCheckUtils]: 68: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:30,394 INFO L290 TraceCheckUtils]: 67: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:30,394 INFO L272 TraceCheckUtils]: 66: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:30,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,395 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3185#(<= 1 |ackermann_#in~m|)} {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} #47#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume true; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {3185#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,400 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3373#(<= 0 |ackermann_#in~m|)} {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} #45#return; {3185#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {3373#(<= 0 |ackermann_#in~m|)} assume true; {3373#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {3550#(or (not (<= 0 ackermann_~m)) (<= 0 |ackermann_#in~m|))} assume 0 == ~m;#res := 1 + ~n; {3373#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:30,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3550#(or (not (<= 0 ackermann_~m)) (<= 0 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,401 INFO L272 TraceCheckUtils]: 57: Hoare triple {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:30,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} assume 0 == ~n; {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} assume !(0 == ~m); {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,404 INFO L272 TraceCheckUtils]: 53: Hoare triple {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:30,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} assume !(0 == ~n); {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} assume !(0 == ~m); {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3528#(or (< ackermann_~m 1) (<= 1 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,405 INFO L272 TraceCheckUtils]: 49: Hoare triple {3497#(or (< ackermann_~m 2) (<= 2 |ackermann_#in~m|))} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:30,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {3497#(or (< ackermann_~m 2) (<= 2 |ackermann_#in~m|))} assume 0 == ~n; {3497#(or (< ackermann_~m 2) (<= 2 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {3497#(or (< ackermann_~m 2) (<= 2 |ackermann_#in~m|))} assume !(0 == ~m); {3497#(or (< ackermann_~m 2) (<= 2 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3497#(or (< ackermann_~m 2) (<= 2 |ackermann_#in~m|))} is VALID [2022-02-20 18:13:30,406 INFO L272 TraceCheckUtils]: 45: Hoare triple {3065#(<= ackermann_~m 2)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:30,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {3065#(<= ackermann_~m 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:30,407 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3122#(<= |ackermann_#in~m| 2)} {2883#true} #47#return; {3065#(<= ackermann_~m 2)} is VALID [2022-02-20 18:13:30,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume true; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:30,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {3122#(<= |ackermann_#in~m| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:30,408 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3599#(or (<= |ackermann_#in~m| 2) (< 2 ackermann_~m))} #45#return; {3122#(<= |ackermann_#in~m| 2)} is VALID [2022-02-20 18:13:30,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:30,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:30,410 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2883#true} {3138#(<= |ackermann_#in~m| 1)} #49#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:30,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {2883#true} assume true; {2883#true} is VALID [2022-02-20 18:13:30,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {2883#true} assume 0 == ~m;#res := 1 + ~n; {2883#true} is VALID [2022-02-20 18:13:30,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:30,410 INFO L272 TraceCheckUtils]: 33: Hoare triple {3138#(<= |ackermann_#in~m| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {2883#true} is VALID [2022-02-20 18:13:30,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:30,413 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3138#(<= |ackermann_#in~m| 1)} {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} #47#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:30,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume true; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:30,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {3138#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:30,414 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3272#(<= |ackermann_#in~m| 0)} {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} #45#return; {3138#(<= |ackermann_#in~m| 1)} is VALID [2022-02-20 18:13:30,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {3272#(<= |ackermann_#in~m| 0)} assume true; {3272#(<= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:30,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {3652#(or (not (<= ackermann_~m 0)) (<= |ackermann_#in~m| 0))} assume 0 == ~m;#res := 1 + ~n; {3272#(<= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:30,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3652#(or (not (<= ackermann_~m 0)) (<= |ackermann_#in~m| 0))} is VALID [2022-02-20 18:13:30,416 INFO L272 TraceCheckUtils]: 24: Hoare triple {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:30,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} assume 0 == ~n; {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} is VALID [2022-02-20 18:13:30,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} assume !(0 == ~m); {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} is VALID [2022-02-20 18:13:30,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} is VALID [2022-02-20 18:13:30,416 INFO L272 TraceCheckUtils]: 20: Hoare triple {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:30,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} assume !(0 == ~n); {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} is VALID [2022-02-20 18:13:30,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} assume !(0 == ~m); {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} is VALID [2022-02-20 18:13:30,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3630#(or (< 1 ackermann_~m) (<= |ackermann_#in~m| 1))} is VALID [2022-02-20 18:13:30,418 INFO L272 TraceCheckUtils]: 16: Hoare triple {3599#(or (<= |ackermann_#in~m| 2) (< 2 ackermann_~m))} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:30,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {3599#(or (<= |ackermann_#in~m| 2) (< 2 ackermann_~m))} assume 0 == ~n; {3599#(or (<= |ackermann_#in~m| 2) (< 2 ackermann_~m))} is VALID [2022-02-20 18:13:30,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {3599#(or (<= |ackermann_#in~m| 2) (< 2 ackermann_~m))} assume !(0 == ~m); {3599#(or (<= |ackermann_#in~m| 2) (< 2 ackermann_~m))} is VALID [2022-02-20 18:13:30,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {3599#(or (<= |ackermann_#in~m| 2) (< 2 ackermann_~m))} is VALID [2022-02-20 18:13:30,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {2883#true} call #t~ret5 := ackermann(~m, ~n - 1); {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {2883#true} assume !(0 == ~n); {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L272 TraceCheckUtils]: 8: Hoare triple {2883#true} call #t~ret4 := ackermann(~m - 1, 1); {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {2883#true} assume 0 == ~n; {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {2883#true} assume !(0 == ~m); {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {2883#true} ~m := #in~m;~n := #in~n; {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {2883#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {2883#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2883#true} is VALID [2022-02-20 18:13:30,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2883#true} is VALID [2022-02-20 18:13:30,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2883#true} is VALID [2022-02-20 18:13:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 111 proven. 128 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-02-20 18:13:30,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110013778] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:30,420 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:30,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 20 [2022-02-20 18:13:30,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057573118] [2022-02-20 18:13:30,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:30,422 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 86 [2022-02-20 18:13:34,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:34,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-02-20 18:13:34,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:34,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 18:13:34,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:34,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 18:13:34,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:13:34,888 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-02-20 18:13:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:35,685 INFO L93 Difference]: Finished difference Result 156 states and 445 transitions. [2022-02-20 18:13:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:13:35,686 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 86 [2022-02-20 18:13:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-02-20 18:13:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-02-20 18:13:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-02-20 18:13:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2022-02-20 18:13:35,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 100 transitions. [2022-02-20 18:13:35,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:35,788 INFO L225 Difference]: With dead ends: 156 [2022-02-20 18:13:35,789 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 18:13:35,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:13:35,793 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 106 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:35,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 134 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:13:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 18:13:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2022-02-20 18:13:35,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:35,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (60), 16 states have call predecessors, (60), 10 states have call successors, (60) [2022-02-20 18:13:35,853 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (60), 16 states have call predecessors, (60), 10 states have call successors, (60) [2022-02-20 18:13:35,853 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (60), 16 states have call predecessors, (60), 10 states have call successors, (60) [2022-02-20 18:13:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:35,861 INFO L93 Difference]: Finished difference Result 89 states and 181 transitions. [2022-02-20 18:13:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 181 transitions. [2022-02-20 18:13:35,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:35,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:35,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (60), 16 states have call predecessors, (60), 10 states have call successors, (60) Second operand 89 states. [2022-02-20 18:13:35,863 INFO L87 Difference]: Start difference. First operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (60), 16 states have call predecessors, (60), 10 states have call successors, (60) Second operand 89 states. [2022-02-20 18:13:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:35,871 INFO L93 Difference]: Finished difference Result 89 states and 181 transitions. [2022-02-20 18:13:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 181 transitions. [2022-02-20 18:13:35,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:35,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:35,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:35,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (60), 16 states have call predecessors, (60), 10 states have call successors, (60) [2022-02-20 18:13:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 123 transitions. [2022-02-20 18:13:35,877 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 123 transitions. Word has length 86 [2022-02-20 18:13:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:35,878 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 123 transitions. [2022-02-20 18:13:35,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 12 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-02-20 18:13:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 123 transitions. [2022-02-20 18:13:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-20 18:13:35,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:35,881 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 11, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:35,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:36,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:36,099 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1617123443, now seen corresponding path program 5 times [2022-02-20 18:13:36,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:36,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108979650] [2022-02-20 18:13:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 18:13:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,414 INFO L272 TraceCheckUtils]: 3: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,416 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:13:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#true} {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,424 INFO L272 TraceCheckUtils]: 3: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,425 INFO L272 TraceCheckUtils]: 7: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,427 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,429 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,429 INFO L272 TraceCheckUtils]: 16: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,431 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4177#true} {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,432 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,433 INFO L272 TraceCheckUtils]: 3: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,434 INFO L272 TraceCheckUtils]: 7: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,435 INFO L272 TraceCheckUtils]: 11: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,439 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,439 INFO L272 TraceCheckUtils]: 20: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,441 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4177#true} {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,442 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,444 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 18:13:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,455 INFO L272 TraceCheckUtils]: 3: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,455 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4177#true} {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,458 INFO L272 TraceCheckUtils]: 3: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,459 INFO L272 TraceCheckUtils]: 7: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,460 INFO L272 TraceCheckUtils]: 11: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,461 INFO L272 TraceCheckUtils]: 15: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,463 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,465 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,465 INFO L272 TraceCheckUtils]: 24: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,466 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4177#true} {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,468 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,469 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,470 INFO L272 TraceCheckUtils]: 36: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,470 INFO L272 TraceCheckUtils]: 40: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,471 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,472 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4177#true} {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,473 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,474 INFO L272 TraceCheckUtils]: 3: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,475 INFO L272 TraceCheckUtils]: 7: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,476 INFO L272 TraceCheckUtils]: 11: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,477 INFO L272 TraceCheckUtils]: 15: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,478 INFO L272 TraceCheckUtils]: 19: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,480 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,482 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,482 INFO L272 TraceCheckUtils]: 28: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,484 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4177#true} {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,485 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,486 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,487 INFO L272 TraceCheckUtils]: 40: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,487 INFO L272 TraceCheckUtils]: 44: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,488 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,489 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4177#true} {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,490 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume true; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,492 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4475#(<= 3 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-20 18:13:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,514 INFO L272 TraceCheckUtils]: 3: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,515 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4177#true} {4177#true} #47#return; {4177#true} is VALID [2022-02-20 18:13:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 18:13:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#true} {4177#true} #49#return; {4177#true} is VALID [2022-02-20 18:13:36,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:36,520 INFO L272 TraceCheckUtils]: 3: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,520 INFO L272 TraceCheckUtils]: 7: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,521 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,522 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4177#true} {4177#true} #47#return; {4177#true} is VALID [2022-02-20 18:13:36,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {4177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4177#true} is VALID [2022-02-20 18:13:36,522 INFO L272 TraceCheckUtils]: 16: Hoare triple {4177#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,523 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4177#true} {4177#true} #49#return; {4177#true} is VALID [2022-02-20 18:13:36,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {4177#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4177#true} is VALID [2022-02-20 18:13:36,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,523 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,524 INFO L272 TraceCheckUtils]: 3: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:36,524 INFO L272 TraceCheckUtils]: 7: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,525 INFO L272 TraceCheckUtils]: 11: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,526 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,526 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4177#true} {4177#true} #47#return; {4177#true} is VALID [2022-02-20 18:13:36,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {4177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4177#true} is VALID [2022-02-20 18:13:36,526 INFO L272 TraceCheckUtils]: 20: Hoare triple {4177#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,527 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4177#true} {4177#true} #49#return; {4177#true} is VALID [2022-02-20 18:13:36,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {4177#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4177#true} is VALID [2022-02-20 18:13:36,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,527 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,529 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4177#true} {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,571 INFO L272 TraceCheckUtils]: 3: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,572 INFO L272 TraceCheckUtils]: 7: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,574 INFO L272 TraceCheckUtils]: 15: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,575 INFO L272 TraceCheckUtils]: 19: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,576 INFO L272 TraceCheckUtils]: 23: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,577 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,578 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,579 INFO L272 TraceCheckUtils]: 32: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,580 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4177#true} {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,581 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,582 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,583 INFO L272 TraceCheckUtils]: 44: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L272 TraceCheckUtils]: 48: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,584 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4177#true} {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,586 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume true; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,587 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4475#(<= 3 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,587 INFO L272 TraceCheckUtils]: 63: Hoare triple {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 65: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L272 TraceCheckUtils]: 67: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L272 TraceCheckUtils]: 71: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L272 TraceCheckUtils]: 75: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 76: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,588 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 80: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 81: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {4177#true} {4177#true} #47#return; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 83: Hoare triple {4177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L272 TraceCheckUtils]: 84: Hoare triple {4177#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 85: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 86: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 87: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {4177#true} {4177#true} #49#return; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 89: Hoare triple {4177#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 90: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,590 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {4177#true} {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume true; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,591 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {4475#(<= 3 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4384#(<= 4 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,593 INFO L272 TraceCheckUtils]: 3: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,594 INFO L272 TraceCheckUtils]: 7: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,596 INFO L272 TraceCheckUtils]: 15: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,597 INFO L272 TraceCheckUtils]: 19: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,598 INFO L272 TraceCheckUtils]: 23: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,599 INFO L272 TraceCheckUtils]: 27: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,601 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,602 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,602 INFO L272 TraceCheckUtils]: 36: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,603 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4177#true} {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,604 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,605 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,606 INFO L272 TraceCheckUtils]: 48: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L272 TraceCheckUtils]: 52: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L290 TraceCheckUtils]: 54: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,607 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4177#true} {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,608 INFO L290 TraceCheckUtils]: 61: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,608 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,609 INFO L290 TraceCheckUtils]: 63: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,609 INFO L290 TraceCheckUtils]: 64: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume true; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,610 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {4475#(<= 3 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,610 INFO L290 TraceCheckUtils]: 66: Hoare triple {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,610 INFO L272 TraceCheckUtils]: 67: Hoare triple {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,610 INFO L290 TraceCheckUtils]: 68: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,610 INFO L290 TraceCheckUtils]: 69: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,610 INFO L290 TraceCheckUtils]: 70: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,610 INFO L272 TraceCheckUtils]: 71: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,610 INFO L290 TraceCheckUtils]: 72: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,610 INFO L290 TraceCheckUtils]: 74: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L272 TraceCheckUtils]: 75: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 76: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 77: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 78: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L272 TraceCheckUtils]: 79: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 80: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 81: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 82: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 84: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 85: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4177#true} {4177#true} #47#return; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 87: Hoare triple {4177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L272 TraceCheckUtils]: 88: Hoare triple {4177#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 89: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,611 INFO L290 TraceCheckUtils]: 90: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,612 INFO L290 TraceCheckUtils]: 91: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,612 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {4177#true} {4177#true} #49#return; {4177#true} is VALID [2022-02-20 18:13:36,612 INFO L290 TraceCheckUtils]: 93: Hoare triple {4177#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4177#true} is VALID [2022-02-20 18:13:36,612 INFO L290 TraceCheckUtils]: 94: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,612 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,612 INFO L290 TraceCheckUtils]: 96: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,612 INFO L290 TraceCheckUtils]: 97: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,613 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {4177#true} {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,613 INFO L290 TraceCheckUtils]: 99: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,613 INFO L290 TraceCheckUtils]: 100: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume true; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,614 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {4475#(<= 3 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4384#(<= 4 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,614 INFO L290 TraceCheckUtils]: 102: Hoare triple {4384#(<= 4 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4384#(<= 4 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,614 INFO L290 TraceCheckUtils]: 103: Hoare triple {4384#(<= 4 |ackermann_#in~m|)} assume true; {4384#(<= 4 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,615 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4384#(<= 4 |ackermann_#in~m|)} {4179#(<= |ULTIMATE.start_main_~m~0#1| 3)} #43#return; {4178#false} is VALID [2022-02-20 18:13:36,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4177#true} is VALID [2022-02-20 18:13:36,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4177#true} is VALID [2022-02-20 18:13:36,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4179#(<= |ULTIMATE.start_main_~m~0#1| 3)} is VALID [2022-02-20 18:13:36,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {4179#(<= |ULTIMATE.start_main_~m~0#1| 3)} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {4179#(<= |ULTIMATE.start_main_~m~0#1| 3)} is VALID [2022-02-20 18:13:36,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {4179#(<= |ULTIMATE.start_main_~m~0#1| 3)} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {4177#true} is VALID [2022-02-20 18:13:36,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,617 INFO L272 TraceCheckUtils]: 8: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,618 INFO L272 TraceCheckUtils]: 12: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,619 INFO L272 TraceCheckUtils]: 16: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,620 INFO L272 TraceCheckUtils]: 20: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,621 INFO L272 TraceCheckUtils]: 24: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,622 INFO L272 TraceCheckUtils]: 28: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,623 INFO L272 TraceCheckUtils]: 32: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4285#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {4285#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {4616#(= |ackermann_#in~m| 0)} assume true; {4616#(= |ackermann_#in~m| 0)} is VALID [2022-02-20 18:13:36,624 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4616#(= |ackermann_#in~m| 0)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,625 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,626 INFO L272 TraceCheckUtils]: 41: Hoare triple {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,627 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4177#true} {4606#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {4611#(<= 1 |ackermann_#in~m|)} assume true; {4611#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,628 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4611#(<= 1 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,629 INFO L290 TraceCheckUtils]: 50: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,629 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 52: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,630 INFO L272 TraceCheckUtils]: 53: Hoare triple {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 54: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L272 TraceCheckUtils]: 57: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 58: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 59: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 60: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 62: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,631 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4177#true} {4558#(and (<= 2 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,632 INFO L290 TraceCheckUtils]: 66: Hoare triple {4570#(<= 2 |ackermann_#in~m|)} assume true; {4570#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,632 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4570#(<= 2 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,633 INFO L290 TraceCheckUtils]: 68: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,633 INFO L290 TraceCheckUtils]: 69: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume true; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,634 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4475#(<= 3 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #47#return; {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 71: Hoare triple {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-20 18:13:36,634 INFO L272 TraceCheckUtils]: 72: Hoare triple {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 73: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 75: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,634 INFO L272 TraceCheckUtils]: 76: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 77: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,634 INFO L290 TraceCheckUtils]: 78: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 79: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L272 TraceCheckUtils]: 80: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 81: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 82: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 83: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L272 TraceCheckUtils]: 84: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 85: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 87: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 89: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 90: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {4177#true} {4177#true} #47#return; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 92: Hoare triple {4177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L272 TraceCheckUtils]: 93: Hoare triple {4177#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 94: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:36,635 INFO L290 TraceCheckUtils]: 95: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:36,636 INFO L290 TraceCheckUtils]: 96: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,636 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {4177#true} {4177#true} #49#return; {4177#true} is VALID [2022-02-20 18:13:36,636 INFO L290 TraceCheckUtils]: 98: Hoare triple {4177#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4177#true} is VALID [2022-02-20 18:13:36,636 INFO L290 TraceCheckUtils]: 99: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,636 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:36,636 INFO L290 TraceCheckUtils]: 101: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:36,636 INFO L290 TraceCheckUtils]: 102: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:36,637 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {4177#true} {4443#(and (<= 3 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #49#return; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,637 INFO L290 TraceCheckUtils]: 104: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,637 INFO L290 TraceCheckUtils]: 105: Hoare triple {4475#(<= 3 |ackermann_#in~m|)} assume true; {4475#(<= 3 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,638 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {4475#(<= 3 |ackermann_#in~m|)} {4285#(= ackermann_~m |ackermann_#in~m|)} #45#return; {4384#(<= 4 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,638 INFO L290 TraceCheckUtils]: 107: Hoare triple {4384#(<= 4 |ackermann_#in~m|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4384#(<= 4 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,638 INFO L290 TraceCheckUtils]: 108: Hoare triple {4384#(<= 4 |ackermann_#in~m|)} assume true; {4384#(<= 4 |ackermann_#in~m|)} is VALID [2022-02-20 18:13:36,639 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {4384#(<= 4 |ackermann_#in~m|)} {4179#(<= |ULTIMATE.start_main_~m~0#1| 3)} #43#return; {4178#false} is VALID [2022-02-20 18:13:36,639 INFO L290 TraceCheckUtils]: 110: Hoare triple {4178#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {4178#false} is VALID [2022-02-20 18:13:36,639 INFO L290 TraceCheckUtils]: 111: Hoare triple {4178#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {4178#false} is VALID [2022-02-20 18:13:36,639 INFO L290 TraceCheckUtils]: 112: Hoare triple {4178#false} assume !false; {4178#false} is VALID [2022-02-20 18:13:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 104 proven. 217 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-02-20 18:13:36,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:36,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108979650] [2022-02-20 18:13:36,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108979650] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:36,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171556736] [2022-02-20 18:13:36,640 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 18:13:36,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:36,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:36,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:36,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 18:13:36,734 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 18:13:36,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:36,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 18:13:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:37,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {4177#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {4177#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L272 TraceCheckUtils]: 8: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L272 TraceCheckUtils]: 12: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:37,141 INFO L272 TraceCheckUtils]: 16: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L272 TraceCheckUtils]: 20: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L272 TraceCheckUtils]: 24: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L272 TraceCheckUtils]: 28: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:37,142 INFO L272 TraceCheckUtils]: 32: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:37,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4766#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:37,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {4766#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {4770#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:37,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {4770#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4770#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:37,149 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4770#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4177#true} #45#return; {4777#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:37,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {4777#(<= 2 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4781#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:37,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {4781#(<= 2 |ackermann_#res|)} assume true; {4781#(<= 2 |ackermann_#res|)} is VALID [2022-02-20 18:13:37,151 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4781#(<= 2 |ackermann_#res|)} {4177#true} #47#return; {4788#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:37,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {4788#(<= 2 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4788#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:37,151 INFO L272 TraceCheckUtils]: 41: Hoare triple {4788#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:37,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4766#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:37,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {4766#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {4770#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:37,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {4770#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4770#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-20 18:13:37,153 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4770#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4788#(<= 2 |ackermann_#t~ret5|)} #49#return; {4807#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:37,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {4807#(<= 3 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4811#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:37,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {4811#(<= 3 |ackermann_#res|)} assume true; {4811#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:37,154 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4811#(<= 3 |ackermann_#res|)} {4177#true} #45#return; {4818#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:37,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {4818#(<= 3 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4811#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:37,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {4811#(<= 3 |ackermann_#res|)} assume true; {4811#(<= 3 |ackermann_#res|)} is VALID [2022-02-20 18:13:37,155 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4811#(<= 3 |ackermann_#res|)} {4177#true} #47#return; {4828#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:37,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {4828#(<= 3 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4828#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:37,156 INFO L272 TraceCheckUtils]: 53: Hoare triple {4828#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:37,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4766#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:37,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {4766#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {4766#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-20 18:13:37,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {4766#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {4844#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:37,157 INFO L272 TraceCheckUtils]: 57: Hoare triple {4844#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:37,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:37,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:37,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:37,157 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4177#true} {4844#(<= |ackermann_#in~n| 0)} #45#return; {4844#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:37,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {4844#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4844#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:37,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {4844#(<= |ackermann_#in~n| 0)} assume true; {4844#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:37,159 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4844#(<= |ackermann_#in~n| 0)} {4828#(<= 3 |ackermann_#t~ret5|)} #49#return; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {4178#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4178#false} {4177#true} #45#return; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {4178#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4178#false} {4177#true} #47#return; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 71: Hoare triple {4178#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L272 TraceCheckUtils]: 72: Hoare triple {4178#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 73: Hoare triple {4178#false} ~m := #in~m;~n := #in~n; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 74: Hoare triple {4178#false} assume !(0 == ~m); {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 75: Hoare triple {4178#false} assume 0 == ~n; {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L272 TraceCheckUtils]: 76: Hoare triple {4178#false} call #t~ret4 := ackermann(~m - 1, 1); {4178#false} is VALID [2022-02-20 18:13:37,159 INFO L290 TraceCheckUtils]: 77: Hoare triple {4178#false} ~m := #in~m;~n := #in~n; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 78: Hoare triple {4178#false} assume !(0 == ~m); {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 79: Hoare triple {4178#false} assume !(0 == ~n); {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L272 TraceCheckUtils]: 80: Hoare triple {4178#false} call #t~ret5 := ackermann(~m, ~n - 1); {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 81: Hoare triple {4178#false} ~m := #in~m;~n := #in~n; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {4178#false} assume !(0 == ~m); {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 83: Hoare triple {4178#false} assume 0 == ~n; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L272 TraceCheckUtils]: 84: Hoare triple {4178#false} call #t~ret4 := ackermann(~m - 1, 1); {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 85: Hoare triple {4178#false} ~m := #in~m;~n := #in~n; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {4178#false} assume 0 == ~m;#res := 1 + ~n; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 87: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {4178#false} {4178#false} #45#return; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {4178#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 90: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {4178#false} {4178#false} #47#return; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {4178#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L272 TraceCheckUtils]: 93: Hoare triple {4178#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4178#false} is VALID [2022-02-20 18:13:37,160 INFO L290 TraceCheckUtils]: 94: Hoare triple {4178#false} ~m := #in~m;~n := #in~n; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 95: Hoare triple {4178#false} assume 0 == ~m;#res := 1 + ~n; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {4178#false} {4178#false} #49#return; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {4178#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 99: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {4178#false} {4178#false} #45#return; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 101: Hoare triple {4178#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 102: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {4178#false} {4178#false} #49#return; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 104: Hoare triple {4178#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 105: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {4178#false} {4177#true} #45#return; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 107: Hoare triple {4178#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 108: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {4178#false} {4177#true} #43#return; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 110: Hoare triple {4178#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {4178#false} is VALID [2022-02-20 18:13:37,161 INFO L290 TraceCheckUtils]: 111: Hoare triple {4178#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {4178#false} is VALID [2022-02-20 18:13:37,162 INFO L290 TraceCheckUtils]: 112: Hoare triple {4178#false} assume !false; {4178#false} is VALID [2022-02-20 18:13:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 337 proven. 37 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-02-20 18:13:37,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:43,638 INFO L290 TraceCheckUtils]: 112: Hoare triple {4178#false} assume !false; {4178#false} is VALID [2022-02-20 18:13:43,638 INFO L290 TraceCheckUtils]: 111: Hoare triple {4178#false} assume !((main_~m~0#1 < 0 || main_~n~0#1 < 0) || main_~result~0#1 >= 0); {4178#false} is VALID [2022-02-20 18:13:43,638 INFO L290 TraceCheckUtils]: 110: Hoare triple {4178#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;main_~result~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1; {4178#false} is VALID [2022-02-20 18:13:43,638 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {4178#false} {4177#true} #43#return; {4178#false} is VALID [2022-02-20 18:13:43,638 INFO L290 TraceCheckUtils]: 108: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:43,638 INFO L290 TraceCheckUtils]: 107: Hoare triple {4178#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4178#false} is VALID [2022-02-20 18:13:43,638 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {4178#false} {4177#true} #45#return; {4178#false} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 105: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 104: Hoare triple {4178#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4178#false} is VALID [2022-02-20 18:13:43,639 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {4177#true} {4178#false} #49#return; {4178#false} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 102: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 101: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 99: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {4177#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {4177#true} {4177#true} #49#return; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 96: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 95: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 94: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L272 TraceCheckUtils]: 93: Hoare triple {4177#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {4177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4177#true} is VALID [2022-02-20 18:13:43,639 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {4177#true} {4177#true} #47#return; {4177#true} is VALID [2022-02-20 18:13:43,640 INFO L290 TraceCheckUtils]: 90: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:43,640 INFO L290 TraceCheckUtils]: 89: Hoare triple {4177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4177#true} is VALID [2022-02-20 18:13:43,640 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {4177#true} {4177#true} #45#return; {4177#true} is VALID [2022-02-20 18:13:43,640 INFO L290 TraceCheckUtils]: 87: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:43,640 INFO L290 TraceCheckUtils]: 86: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:43,640 INFO L290 TraceCheckUtils]: 85: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,640 INFO L272 TraceCheckUtils]: 84: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:43,640 INFO L290 TraceCheckUtils]: 83: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L290 TraceCheckUtils]: 82: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L290 TraceCheckUtils]: 81: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L272 TraceCheckUtils]: 80: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L290 TraceCheckUtils]: 79: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L290 TraceCheckUtils]: 78: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L290 TraceCheckUtils]: 77: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L272 TraceCheckUtils]: 76: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L290 TraceCheckUtils]: 75: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:43,641 INFO L290 TraceCheckUtils]: 74: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,642 INFO L290 TraceCheckUtils]: 73: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,642 INFO L272 TraceCheckUtils]: 72: Hoare triple {4178#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:43,642 INFO L290 TraceCheckUtils]: 71: Hoare triple {4178#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4178#false} is VALID [2022-02-20 18:13:43,642 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4178#false} {4177#true} #47#return; {4178#false} is VALID [2022-02-20 18:13:43,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:43,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {4178#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4178#false} is VALID [2022-02-20 18:13:43,642 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4178#false} {4177#true} #45#return; {4178#false} is VALID [2022-02-20 18:13:43,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {4178#false} assume true; {4178#false} is VALID [2022-02-20 18:13:43,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {4178#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {4178#false} is VALID [2022-02-20 18:13:43,667 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4844#(<= |ackermann_#in~n| 0)} {5169#(< 0 |ackermann_#t~ret5|)} #49#return; {4178#false} is VALID [2022-02-20 18:13:43,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {4844#(<= |ackermann_#in~n| 0)} assume true; {4844#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:43,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {4844#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {4844#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:43,669 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {4177#true} {4844#(<= |ackermann_#in~n| 0)} #45#return; {4844#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:43,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-02-20 18:13:43,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {4177#true} assume 0 == ~m;#res := 1 + ~n; {4177#true} is VALID [2022-02-20 18:13:43,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,669 INFO L272 TraceCheckUtils]: 57: Hoare triple {4844#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:43,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {5197#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume 0 == ~n; {4844#(<= |ackermann_#in~n| 0)} is VALID [2022-02-20 18:13:43,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {5197#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume !(0 == ~m); {5197#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-20 18:13:43,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {5197#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-20 18:13:43,670 INFO L272 TraceCheckUtils]: 53: Hoare triple {5169#(< 0 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:43,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {5169#(< 0 |ackermann_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5169#(< 0 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:43,671 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5213#(< 0 |ackermann_#res|)} {4177#true} #47#return; {5169#(< 0 |ackermann_#t~ret5|)} is VALID [2022-02-20 18:13:43,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {5213#(< 0 |ackermann_#res|)} assume true; {5213#(< 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:43,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {5220#(< 0 |ackermann_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {5213#(< 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:43,673 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5213#(< 0 |ackermann_#res|)} {4177#true} #45#return; {5220#(< 0 |ackermann_#t~ret4|)} is VALID [2022-02-20 18:13:43,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {5213#(< 0 |ackermann_#res|)} assume true; {5213#(< 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:43,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {5233#(< 0 |ackermann_#t~ret6|)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;#res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {5213#(< 0 |ackermann_#res|)} is VALID [2022-02-20 18:13:43,674 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5241#(or (<= (+ |ackermann_#in~n| 1) 0) (< 0 |ackermann_#res|))} {5237#(< 0 (+ |ackermann_#t~ret5| 1))} #49#return; {5233#(< 0 |ackermann_#t~ret6|)} is VALID [2022-02-20 18:13:43,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {5241#(or (<= (+ |ackermann_#in~n| 1) 0) (< 0 |ackermann_#res|))} assume true; {5241#(or (<= (+ |ackermann_#in~n| 1) 0) (< 0 |ackermann_#res|))} is VALID [2022-02-20 18:13:43,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {5248#(or (< 0 (+ ackermann_~n 1)) (<= (+ |ackermann_#in~n| 1) 0))} assume 0 == ~m;#res := 1 + ~n; {5241#(or (<= (+ |ackermann_#in~n| 1) 0) (< 0 |ackermann_#res|))} is VALID [2022-02-20 18:13:43,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {5248#(or (< 0 (+ ackermann_~n 1)) (<= (+ |ackermann_#in~n| 1) 0))} is VALID [2022-02-20 18:13:43,675 INFO L272 TraceCheckUtils]: 41: Hoare triple {5237#(< 0 (+ |ackermann_#t~ret5| 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4177#true} is VALID [2022-02-20 18:13:43,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {5237#(< 0 (+ |ackermann_#t~ret5| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5237#(< 0 (+ |ackermann_#t~ret5| 1))} is VALID [2022-02-20 18:13:43,676 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5261#(< 0 (+ |ackermann_#res| 1))} {4177#true} #47#return; {5237#(< 0 (+ |ackermann_#t~ret5| 1))} is VALID [2022-02-20 18:13:43,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {5261#(< 0 (+ |ackermann_#res| 1))} assume true; {5261#(< 0 (+ |ackermann_#res| 1))} is VALID [2022-02-20 18:13:43,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {5268#(< 0 (+ |ackermann_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := #t~ret4;havoc #t~ret4; {5261#(< 0 (+ |ackermann_#res| 1))} is VALID [2022-02-20 18:13:43,677 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5275#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ |ackermann_#res| 1)))} {4177#true} #45#return; {5268#(< 0 (+ |ackermann_#t~ret4| 1))} is VALID [2022-02-20 18:13:43,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {5275#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ |ackermann_#res| 1)))} assume true; {5275#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ |ackermann_#res| 1)))} is VALID [2022-02-20 18:13:43,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {5282#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ ackermann_~n 2)))} assume 0 == ~m;#res := 1 + ~n; {5275#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ |ackermann_#res| 1)))} is VALID [2022-02-20 18:13:43,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {5282#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ ackermann_~n 2)))} is VALID [2022-02-20 18:13:43,678 INFO L272 TraceCheckUtils]: 32: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:43,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:43,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L272 TraceCheckUtils]: 28: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L272 TraceCheckUtils]: 24: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L272 TraceCheckUtils]: 20: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L272 TraceCheckUtils]: 16: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L272 TraceCheckUtils]: 12: Hoare triple {4177#true} call #t~ret5 := ackermann(~m, ~n - 1); {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {4177#true} assume !(0 == ~n); {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L272 TraceCheckUtils]: 8: Hoare triple {4177#true} call #t~ret4 := ackermann(~m - 1, 1); {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {4177#true} assume 0 == ~n; {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {4177#true} assume !(0 == ~m); {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} ~m := #in~m;~n := #in~n; {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {4177#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {4177#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4177#true} is VALID [2022-02-20 18:13:43,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4177#true} is VALID [2022-02-20 18:13:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 148 proven. 142 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2022-02-20 18:13:43,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171556736] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:43,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:43,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 34 [2022-02-20 18:13:43,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878380450] [2022-02-20 18:13:43,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:43,682 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 12 states have call successors, (19), 2 states have call predecessors, (19), 15 states have return successors, (34), 20 states have call predecessors, (34), 12 states have call successors, (34) Word has length 113 [2022-02-20 18:13:43,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:43,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 12 states have call successors, (19), 2 states have call predecessors, (19), 15 states have return successors, (34), 20 states have call predecessors, (34), 12 states have call successors, (34) [2022-02-20 18:13:43,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:43,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-20 18:13:43,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-20 18:13:43,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 18:13:43,858 INFO L87 Difference]: Start difference. First operand 72 states and 123 transitions. Second operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 12 states have call successors, (19), 2 states have call predecessors, (19), 15 states have return successors, (34), 20 states have call predecessors, (34), 12 states have call successors, (34) [2022-02-20 18:13:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:47,167 INFO L93 Difference]: Finished difference Result 142 states and 351 transitions. [2022-02-20 18:13:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-20 18:13:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 12 states have call successors, (19), 2 states have call predecessors, (19), 15 states have return successors, (34), 20 states have call predecessors, (34), 12 states have call successors, (34) Word has length 113 [2022-02-20 18:13:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 12 states have call successors, (19), 2 states have call predecessors, (19), 15 states have return successors, (34), 20 states have call predecessors, (34), 12 states have call successors, (34) [2022-02-20 18:13:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 146 transitions. [2022-02-20 18:13:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 12 states have call successors, (19), 2 states have call predecessors, (19), 15 states have return successors, (34), 20 states have call predecessors, (34), 12 states have call successors, (34) [2022-02-20 18:13:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 146 transitions. [2022-02-20 18:13:47,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 146 transitions. [2022-02-20 18:13:47,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:47,298 INFO L225 Difference]: With dead ends: 142 [2022-02-20 18:13:47,298 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:13:47,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=778, Invalid=3382, Unknown=0, NotChecked=0, Total=4160 [2022-02-20 18:13:47,301 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:47,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 183 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 18:13:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:13:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:13:47,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:47,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:47,302 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:47,302 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:47,302 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:13:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:47,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:47,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:47,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 18:13:47,303 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 18:13:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:47,303 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:13:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:47,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:47,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:47,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:47,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:13:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:13:47,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2022-02-20 18:13:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:47,304 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:13:47,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 12 states have call successors, (19), 2 states have call predecessors, (19), 15 states have return successors, (34), 20 states have call predecessors, (34), 12 states have call successors, (34) [2022-02-20 18:13:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:13:47,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:47,307 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:13:47,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:47,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:47,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:13:48,577 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:13:48,578 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:13:48,578 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2022-02-20 18:13:48,578 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:13:48,578 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:13:48,578 INFO L861 garLoopResultBuilder]: At program point L28(lines 28 48) the Hoare annotation is: true [2022-02-20 18:13:48,578 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2022-02-20 18:13:48,578 INFO L858 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-02-20 18:13:48,578 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-02-20 18:13:48,578 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~m~0#1| 3) (<= 0 |ULTIMATE.start_main_~n~0#1|)) [2022-02-20 18:13:48,578 INFO L858 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-02-20 18:13:48,579 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 41) no Hoare annotation was computed. [2022-02-20 18:13:48,579 INFO L858 garLoopResultBuilder]: For program point ackermannEXIT(lines 17 25) no Hoare annotation was computed. [2022-02-20 18:13:48,579 INFO L854 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2022-02-20 18:13:48,579 INFO L858 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-02-20 18:13:48,579 INFO L854 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0)) (<= |ackermann_#in~n| 0)) [2022-02-20 18:13:48,579 INFO L854 garLoopResultBuilder]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse0 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (= ackermann_~m |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#in~m|) (<= 3 |ackermann_#t~ret5|) .cse0 .cse1) (and (not (= ackermann_~m 0)) (<= 0 |ackermann_#in~m|) .cse0 (<= 2 |ackermann_#t~ret5|) .cse1 (<= |ackermann_#in~m| 1)))) [2022-02-20 18:13:48,579 INFO L861 garLoopResultBuilder]: At program point ackermannENTRY(lines 17 25) the Hoare annotation is: true [2022-02-20 18:13:48,579 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-02-20 18:13:48,579 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-02-20 18:13:48,579 INFO L858 garLoopResultBuilder]: For program point L24-3(line 24) no Hoare annotation was computed. [2022-02-20 18:13:48,579 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-02-20 18:13:48,579 INFO L858 garLoopResultBuilder]: For program point ackermannFINAL(lines 17 25) no Hoare annotation was computed. [2022-02-20 18:13:48,582 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-02-20 18:13:48,583 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:13:48,586 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:13:48,586 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: ackermannFINAL has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 18:13:48,587 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:13:48,588 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 18:13:48,588 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 18:13:48,588 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2022-02-20 18:13:48,588 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2022-02-20 18:13:48,588 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2022-02-20 18:13:48,588 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2022-02-20 18:13:48,588 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 18:13:48,588 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 18:13:48,589 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 18:13:48,590 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 18:13:48,590 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 18:13:48,590 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:13:48,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:13:48 BoogieIcfgContainer [2022-02-20 18:13:48,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:13:48,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:13:48,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:13:48,598 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:13:48,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:11" (3/4) ... [2022-02-20 18:13:48,601 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:13:48,606 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2022-02-20 18:13:48,609 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 18:13:48,610 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 18:13:48,610 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:13:48,610 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:13:48,646 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:13:48,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:13:48,648 INFO L158 Benchmark]: Toolchain (without parser) took 38035.83ms. Allocated memory was 109.1MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 87.1MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 875.8MB. Max. memory is 16.1GB. [2022-02-20 18:13:48,649 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:13:48,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.11ms. Allocated memory is still 109.1MB. Free memory was 86.9MB in the beginning and 77.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:13:48,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.07ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 75.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:13:48,649 INFO L158 Benchmark]: Boogie Preprocessor took 27.56ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 74.6MB in the end (delta: 788.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:13:48,650 INFO L158 Benchmark]: RCFGBuilder took 304.69ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 63.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 18:13:48,650 INFO L158 Benchmark]: TraceAbstraction took 37430.29ms. Allocated memory was 109.1MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 62.5MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-02-20 18:13:48,651 INFO L158 Benchmark]: Witness Printer took 48.97ms. Allocated memory is still 6.1GB. Free memory was 5.2GB in the beginning and 5.2GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:13:48,657 INFO L339 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.14ms. Allocated memory is still 81.8MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.11ms. Allocated memory is still 109.1MB. Free memory was 86.9MB in the beginning and 77.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.07ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 75.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.56ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 74.6MB in the end (delta: 788.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 304.69ms. Allocated memory is still 109.1MB. Free memory was 74.5MB in the beginning and 63.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37430.29ms. Allocated memory was 109.1MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 62.5MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 48.97ms. Allocated memory is still 6.1GB. Free memory was 5.2GB in the beginning and 5.2GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.4s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 382 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 935 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 627 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2404 IncrementalHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 627 mSolverCounterUnsat, 164 mSDtfsCounter, 2404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1011 GetRequests, 785 SyntacticMatches, 4 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=6, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 55 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 166 PreInvPairs, 253 NumberOfFragments, 68 HoareAnnotationTreeSize, 166 FomulaSimplifications, 5648 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 6 FomulaSimplificationsInter, 8155 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 767 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1115 ConstructedInterpolants, 0 QuantifiedInterpolants, 2335 SizeOfPredicates, 20 NumberOfNonLiveVariables, 882 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 20 InterpolantComputations, 3 PerfectInterpolantSequences, 2845/3631 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 18:13:48,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE