/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:58,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:58,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:58,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:58,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:58,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:58,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:58,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:58,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:58,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:58,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:58,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:58,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:58,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:58,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:58,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:58,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:58,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:58,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:58,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:58,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:58,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:58,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:58,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:58,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:58,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:58,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:58,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:58,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:58,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:58,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:58,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:58,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:58,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:58,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:58,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:58,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:58,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:58,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:58,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:58,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:58,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:42:58,328 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:58,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:58,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:58,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:58,330 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:58,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:58,331 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:58,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:58,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:58,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:58,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:58,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:58,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:58,332 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:58,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:58,332 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:58,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:58,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:58,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:58,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:58,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:58,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:58,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:58,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:58,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:58,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:58,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:58,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:58,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:58,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:58,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:58,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:58,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:58,636 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:58,637 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:58,638 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann02.c [2020-07-10 14:42:58,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e59995e/173a2c2b6ad04ec1a10ecd58eafb27f2/FLAGe57c74116 [2020-07-10 14:42:59,159 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:59,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann02.c [2020-07-10 14:42:59,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e59995e/173a2c2b6ad04ec1a10ecd58eafb27f2/FLAGe57c74116 [2020-07-10 14:42:59,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e59995e/173a2c2b6ad04ec1a10ecd58eafb27f2 [2020-07-10 14:42:59,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:59,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:59,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:59,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:59,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:59,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58bb5dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59, skipping insertion in model container [2020-07-10 14:42:59,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:59,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:59,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:59,859 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:59,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:59,893 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:59,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59 WrapperNode [2020-07-10 14:42:59,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:59,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:59,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:59,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:59,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (1/1) ... [2020-07-10 14:42:59,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:59,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:59,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:59,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:59,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:43:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:43:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:43:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-10 14:43:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:43:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:43:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:43:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-10 14:43:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:43:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:43:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:43:00,460 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:43:00,461 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:43:00,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:00 BoogieIcfgContainer [2020-07-10 14:43:00,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:43:00,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:43:00,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:43:00,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:43:00,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:59" (1/3) ... [2020-07-10 14:43:00,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706eaad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:00, skipping insertion in model container [2020-07-10 14:43:00,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:59" (2/3) ... [2020-07-10 14:43:00,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706eaad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:00, skipping insertion in model container [2020-07-10 14:43:00,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:00" (3/3) ... [2020-07-10 14:43:00,473 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann02.c [2020-07-10 14:43:00,484 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:43:00,492 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:43:00,506 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:43:00,527 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:43:00,527 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:43:00,528 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:43:00,528 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:43:00,528 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:43:00,528 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:43:00,528 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:43:00,528 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:43:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-10 14:43:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 14:43:00,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:00,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:00,555 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1796234678, now seen corresponding path program 1 times [2020-07-10 14:43:00,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:00,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973493866] [2020-07-10 14:43:00,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:00,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 14:43:00,782 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #40#return; {30#true} is VALID [2020-07-10 14:43:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:00,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~m := #in~m;~n := #in~n; {39#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:00,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {40#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:00,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#(= 0 |ackermann_#in~m|)} assume true; {40#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:00,868 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#(= 0 |ackermann_#in~m|)} {30#true} #50#return; {38#(= 0 main_~m~0)} is VALID [2020-07-10 14:43:00,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-10 14:43:00,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 14:43:00,869 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #40#return; {30#true} is VALID [2020-07-10 14:43:00,870 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret6 := main(); {30#true} is VALID [2020-07-10 14:43:00,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {30#true} is VALID [2020-07-10 14:43:00,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {30#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {30#true} is VALID [2020-07-10 14:43:00,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#true} assume !(~n~0 < 0 || ~n~0 > 23); {30#true} is VALID [2020-07-10 14:43:00,872 INFO L263 TraceCheckUtils]: 7: Hoare triple {30#true} call #t~ret5 := ackermann(~m~0, ~n~0); {30#true} is VALID [2020-07-10 14:43:00,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#true} ~m := #in~m;~n := #in~n; {39#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:00,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {40#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:00,876 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#(= 0 |ackermann_#in~m|)} assume true; {40#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:00,879 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#(= 0 |ackermann_#in~m|)} {30#true} #50#return; {38#(= 0 main_~m~0)} is VALID [2020-07-10 14:43:00,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#(= 0 main_~m~0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {38#(= 0 main_~m~0)} is VALID [2020-07-10 14:43:00,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#(= 0 main_~m~0)} assume !(~m~0 < 2 || ~result~0 >= 4); {31#false} is VALID [2020-07-10 14:43:00,883 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-10 14:43:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:43:00,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973493866] [2020-07-10 14:43:00,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:00,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:43:00,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339376661] [2020-07-10 14:43:00,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 14:43:00,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:00,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:43:00,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:00,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:43:00,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:00,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:43:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:43:00,948 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-10 14:43:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:01,328 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2020-07-10 14:43:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:43:01,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 14:43:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:43:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2020-07-10 14:43:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:43:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2020-07-10 14:43:01,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2020-07-10 14:43:01,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:01,520 INFO L225 Difference]: With dead ends: 55 [2020-07-10 14:43:01,521 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 14:43:01,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 14:43:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 14:43:01,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:01,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 14:43:01,574 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 14:43:01,574 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 14:43:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:01,580 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-10 14:43:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-10 14:43:01,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:01,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:01,583 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 14:43:01,583 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 14:43:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:01,588 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-10 14:43:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-10 14:43:01,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:01,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:01,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:01,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 14:43:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-10 14:43:01,597 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2020-07-10 14:43:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:01,597 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-10 14:43:01,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:43:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-10 14:43:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:43:01,599 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:01,600 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:01,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:43:01,600 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -895156504, now seen corresponding path program 1 times [2020-07-10 14:43:01,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:01,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211690877] [2020-07-10 14:43:01,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {208#true} assume true; {208#true} is VALID [2020-07-10 14:43:01,693 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {208#true} {208#true} #40#return; {208#true} is VALID [2020-07-10 14:43:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {208#true} ~m := #in~m;~n := #in~n; {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {230#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#(= 0 |ackermann_#in~m|)} assume true; {230#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,763 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {230#(= 0 |ackermann_#in~m|)} {224#(= ackermann_~m |ackermann_#in~m|)} #44#return; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {208#true} ~m := #in~m;~n := #in~n; {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,766 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {208#true} is VALID [2020-07-10 14:43:01,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {208#true} ~m := #in~m;~n := #in~n; {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {230#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#(= 0 |ackermann_#in~m|)} assume true; {230#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,769 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {230#(= 0 |ackermann_#in~m|)} {224#(= ackermann_~m |ackermann_#in~m|)} #44#return; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,770 INFO L280 TraceCheckUtils]: 8: Hoare triple {229#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,771 INFO L280 TraceCheckUtils]: 9: Hoare triple {229#(<= |ackermann_#in~m| 1)} assume true; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,772 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {229#(<= |ackermann_#in~m| 1)} {208#true} #50#return; {223#(<= main_~m~0 1)} is VALID [2020-07-10 14:43:01,773 INFO L263 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2020-07-10 14:43:01,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {208#true} assume true; {208#true} is VALID [2020-07-10 14:43:01,774 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} #40#return; {208#true} is VALID [2020-07-10 14:43:01,774 INFO L263 TraceCheckUtils]: 3: Hoare triple {208#true} call #t~ret6 := main(); {208#true} is VALID [2020-07-10 14:43:01,774 INFO L280 TraceCheckUtils]: 4: Hoare triple {208#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {208#true} is VALID [2020-07-10 14:43:01,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {208#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {208#true} is VALID [2020-07-10 14:43:01,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {208#true} assume !(~n~0 < 0 || ~n~0 > 23); {208#true} is VALID [2020-07-10 14:43:01,775 INFO L263 TraceCheckUtils]: 7: Hoare triple {208#true} call #t~ret5 := ackermann(~m~0, ~n~0); {208#true} is VALID [2020-07-10 14:43:01,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {208#true} ~m := #in~m;~n := #in~n; {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,777 INFO L280 TraceCheckUtils]: 9: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,778 INFO L280 TraceCheckUtils]: 10: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,778 INFO L263 TraceCheckUtils]: 11: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {208#true} is VALID [2020-07-10 14:43:01,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#true} ~m := #in~m;~n := #in~n; {224#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,779 INFO L280 TraceCheckUtils]: 13: Hoare triple {224#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {230#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,780 INFO L280 TraceCheckUtils]: 14: Hoare triple {230#(= 0 |ackermann_#in~m|)} assume true; {230#(= 0 |ackermann_#in~m|)} is VALID [2020-07-10 14:43:01,782 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {230#(= 0 |ackermann_#in~m|)} {224#(= ackermann_~m |ackermann_#in~m|)} #44#return; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,782 INFO L280 TraceCheckUtils]: 16: Hoare triple {229#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,783 INFO L280 TraceCheckUtils]: 17: Hoare triple {229#(<= |ackermann_#in~m| 1)} assume true; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,784 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {229#(<= |ackermann_#in~m| 1)} {208#true} #50#return; {223#(<= main_~m~0 1)} is VALID [2020-07-10 14:43:01,785 INFO L280 TraceCheckUtils]: 19: Hoare triple {223#(<= main_~m~0 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {223#(<= main_~m~0 1)} is VALID [2020-07-10 14:43:01,786 INFO L280 TraceCheckUtils]: 20: Hoare triple {223#(<= main_~m~0 1)} assume !(~m~0 < 2 || ~result~0 >= 4); {209#false} is VALID [2020-07-10 14:43:01,786 INFO L280 TraceCheckUtils]: 21: Hoare triple {209#false} assume !false; {209#false} is VALID [2020-07-10 14:43:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:43:01,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211690877] [2020-07-10 14:43:01,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399276778] [2020-07-10 14:43:01,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:43:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:01,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:01,952 INFO L263 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2020-07-10 14:43:01,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {208#true} assume true; {208#true} is VALID [2020-07-10 14:43:01,953 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} #40#return; {208#true} is VALID [2020-07-10 14:43:01,954 INFO L263 TraceCheckUtils]: 3: Hoare triple {208#true} call #t~ret6 := main(); {208#true} is VALID [2020-07-10 14:43:01,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {208#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {208#true} is VALID [2020-07-10 14:43:01,954 INFO L280 TraceCheckUtils]: 5: Hoare triple {208#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {208#true} is VALID [2020-07-10 14:43:01,955 INFO L280 TraceCheckUtils]: 6: Hoare triple {208#true} assume !(~n~0 < 0 || ~n~0 > 23); {208#true} is VALID [2020-07-10 14:43:01,955 INFO L263 TraceCheckUtils]: 7: Hoare triple {208#true} call #t~ret5 := ackermann(~m~0, ~n~0); {208#true} is VALID [2020-07-10 14:43:01,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {208#true} ~m := #in~m;~n := #in~n; {258#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2020-07-10 14:43:01,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {258#(<= |ackermann_#in~m| ackermann_~m)} assume !(0 == ~m); {258#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2020-07-10 14:43:01,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {258#(<= |ackermann_#in~m| ackermann_~m)} assume 0 == ~n; {258#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2020-07-10 14:43:01,957 INFO L263 TraceCheckUtils]: 11: Hoare triple {258#(<= |ackermann_#in~m| ackermann_~m)} call #t~ret0 := ackermann(~m - 1, 1); {208#true} is VALID [2020-07-10 14:43:01,958 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#true} ~m := #in~m;~n := #in~n; {258#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2020-07-10 14:43:01,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {258#(<= |ackermann_#in~m| ackermann_~m)} assume 0 == ~m;#res := 1 + ~n; {274#(<= |ackermann_#in~m| 0)} is VALID [2020-07-10 14:43:01,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {274#(<= |ackermann_#in~m| 0)} assume true; {274#(<= |ackermann_#in~m| 0)} is VALID [2020-07-10 14:43:01,961 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {274#(<= |ackermann_#in~m| 0)} {258#(<= |ackermann_#in~m| ackermann_~m)} #44#return; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,962 INFO L280 TraceCheckUtils]: 16: Hoare triple {229#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,963 INFO L280 TraceCheckUtils]: 17: Hoare triple {229#(<= |ackermann_#in~m| 1)} assume true; {229#(<= |ackermann_#in~m| 1)} is VALID [2020-07-10 14:43:01,964 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {229#(<= |ackermann_#in~m| 1)} {208#true} #50#return; {223#(<= main_~m~0 1)} is VALID [2020-07-10 14:43:01,965 INFO L280 TraceCheckUtils]: 19: Hoare triple {223#(<= main_~m~0 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {223#(<= main_~m~0 1)} is VALID [2020-07-10 14:43:01,966 INFO L280 TraceCheckUtils]: 20: Hoare triple {223#(<= main_~m~0 1)} assume !(~m~0 < 2 || ~result~0 >= 4); {209#false} is VALID [2020-07-10 14:43:01,966 INFO L280 TraceCheckUtils]: 21: Hoare triple {209#false} assume !false; {209#false} is VALID [2020-07-10 14:43:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:43:01,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:01,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-10 14:43:01,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061449864] [2020-07-10 14:43:01,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-10 14:43:01,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:01,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 14:43:02,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:02,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 14:43:02,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:02,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 14:43:02,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 14:43:02,005 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 8 states. [2020-07-10 14:43:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:02,460 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2020-07-10 14:43:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:43:02,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-10 14:43:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:43:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2020-07-10 14:43:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:43:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2020-07-10 14:43:02,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2020-07-10 14:43:02,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:02,586 INFO L225 Difference]: With dead ends: 60 [2020-07-10 14:43:02,587 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 14:43:02,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:43:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 14:43:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-10 14:43:02,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:02,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-10 14:43:02,604 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 14:43:02,604 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 14:43:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:02,609 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-07-10 14:43:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2020-07-10 14:43:02,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:02,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:02,610 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 14:43:02,611 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 14:43:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:02,615 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-07-10 14:43:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2020-07-10 14:43:02,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:02,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:02,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:02,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 14:43:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2020-07-10 14:43:02,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2020-07-10 14:43:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:02,621 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-07-10 14:43:02,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 14:43:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2020-07-10 14:43:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 14:43:02,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:02,622 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:02,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 14:43:02,836 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:02,838 INFO L82 PathProgramCache]: Analyzing trace with hash 687949058, now seen corresponding path program 2 times [2020-07-10 14:43:02,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:02,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731983878] [2020-07-10 14:43:02,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:02,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 14:43:02,877 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {493#true} {493#true} #40#return; {493#true} is VALID [2020-07-10 14:43:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:02,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {493#true} is VALID [2020-07-10 14:43:02,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {493#true} assume 0 == ~m;#res := 1 + ~n; {493#true} is VALID [2020-07-10 14:43:02,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 14:43:02,980 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {493#true} {527#(= 0 |ackermann_#in~n|)} #44#return; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,981 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {526#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {526#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {526#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {526#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,983 INFO L263 TraceCheckUtils]: 3: Hoare triple {527#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {493#true} is VALID [2020-07-10 14:43:02,983 INFO L280 TraceCheckUtils]: 4: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {493#true} is VALID [2020-07-10 14:43:02,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {493#true} assume 0 == ~m;#res := 1 + ~n; {493#true} is VALID [2020-07-10 14:43:02,984 INFO L280 TraceCheckUtils]: 6: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 14:43:02,985 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {493#true} {527#(= 0 |ackermann_#in~n|)} #44#return; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,986 INFO L280 TraceCheckUtils]: 8: Hoare triple {527#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,986 INFO L280 TraceCheckUtils]: 9: Hoare triple {527#(= 0 |ackermann_#in~n|)} assume true; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,988 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {527#(= 0 |ackermann_#in~n|)} {493#true} #44#return; {494#false} is VALID [2020-07-10 14:43:02,988 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {493#true} is VALID [2020-07-10 14:43:02,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {493#true} assume !(0 == ~m); {493#true} is VALID [2020-07-10 14:43:02,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {493#true} assume 0 == ~n; {493#true} is VALID [2020-07-10 14:43:02,989 INFO L263 TraceCheckUtils]: 3: Hoare triple {493#true} call #t~ret0 := ackermann(~m - 1, 1); {493#true} is VALID [2020-07-10 14:43:02,990 INFO L280 TraceCheckUtils]: 4: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {526#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {526#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {526#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,991 INFO L280 TraceCheckUtils]: 6: Hoare triple {526#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,992 INFO L263 TraceCheckUtils]: 7: Hoare triple {527#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {493#true} is VALID [2020-07-10 14:43:02,992 INFO L280 TraceCheckUtils]: 8: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {493#true} is VALID [2020-07-10 14:43:02,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {493#true} assume 0 == ~m;#res := 1 + ~n; {493#true} is VALID [2020-07-10 14:43:02,992 INFO L280 TraceCheckUtils]: 10: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 14:43:02,994 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {493#true} {527#(= 0 |ackermann_#in~n|)} #44#return; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,994 INFO L280 TraceCheckUtils]: 12: Hoare triple {527#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,995 INFO L280 TraceCheckUtils]: 13: Hoare triple {527#(= 0 |ackermann_#in~n|)} assume true; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:02,996 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {527#(= 0 |ackermann_#in~n|)} {493#true} #44#return; {494#false} is VALID [2020-07-10 14:43:02,996 INFO L280 TraceCheckUtils]: 15: Hoare triple {494#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {494#false} is VALID [2020-07-10 14:43:02,997 INFO L280 TraceCheckUtils]: 16: Hoare triple {494#false} assume true; {494#false} is VALID [2020-07-10 14:43:02,997 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {494#false} {493#true} #50#return; {494#false} is VALID [2020-07-10 14:43:02,998 INFO L263 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2020-07-10 14:43:02,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 14:43:02,998 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {493#true} {493#true} #40#return; {493#true} is VALID [2020-07-10 14:43:02,999 INFO L263 TraceCheckUtils]: 3: Hoare triple {493#true} call #t~ret6 := main(); {493#true} is VALID [2020-07-10 14:43:02,999 INFO L280 TraceCheckUtils]: 4: Hoare triple {493#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {493#true} is VALID [2020-07-10 14:43:02,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {493#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {493#true} is VALID [2020-07-10 14:43:02,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {493#true} assume !(~n~0 < 0 || ~n~0 > 23); {493#true} is VALID [2020-07-10 14:43:03,000 INFO L263 TraceCheckUtils]: 7: Hoare triple {493#true} call #t~ret5 := ackermann(~m~0, ~n~0); {493#true} is VALID [2020-07-10 14:43:03,000 INFO L280 TraceCheckUtils]: 8: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {493#true} is VALID [2020-07-10 14:43:03,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {493#true} assume !(0 == ~m); {493#true} is VALID [2020-07-10 14:43:03,001 INFO L280 TraceCheckUtils]: 10: Hoare triple {493#true} assume 0 == ~n; {493#true} is VALID [2020-07-10 14:43:03,001 INFO L263 TraceCheckUtils]: 11: Hoare triple {493#true} call #t~ret0 := ackermann(~m - 1, 1); {493#true} is VALID [2020-07-10 14:43:03,002 INFO L280 TraceCheckUtils]: 12: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {526#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,002 INFO L280 TraceCheckUtils]: 13: Hoare triple {526#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {526#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,003 INFO L280 TraceCheckUtils]: 14: Hoare triple {526#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,003 INFO L263 TraceCheckUtils]: 15: Hoare triple {527#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {493#true} is VALID [2020-07-10 14:43:03,004 INFO L280 TraceCheckUtils]: 16: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {493#true} is VALID [2020-07-10 14:43:03,004 INFO L280 TraceCheckUtils]: 17: Hoare triple {493#true} assume 0 == ~m;#res := 1 + ~n; {493#true} is VALID [2020-07-10 14:43:03,004 INFO L280 TraceCheckUtils]: 18: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 14:43:03,005 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {493#true} {527#(= 0 |ackermann_#in~n|)} #44#return; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,006 INFO L280 TraceCheckUtils]: 20: Hoare triple {527#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,007 INFO L280 TraceCheckUtils]: 21: Hoare triple {527#(= 0 |ackermann_#in~n|)} assume true; {527#(= 0 |ackermann_#in~n|)} is VALID [2020-07-10 14:43:03,008 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {527#(= 0 |ackermann_#in~n|)} {493#true} #44#return; {494#false} is VALID [2020-07-10 14:43:03,008 INFO L280 TraceCheckUtils]: 23: Hoare triple {494#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {494#false} is VALID [2020-07-10 14:43:03,008 INFO L280 TraceCheckUtils]: 24: Hoare triple {494#false} assume true; {494#false} is VALID [2020-07-10 14:43:03,009 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {494#false} {493#true} #50#return; {494#false} is VALID [2020-07-10 14:43:03,009 INFO L280 TraceCheckUtils]: 26: Hoare triple {494#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {494#false} is VALID [2020-07-10 14:43:03,009 INFO L280 TraceCheckUtils]: 27: Hoare triple {494#false} assume !(~m~0 < 2 || ~result~0 >= 4); {494#false} is VALID [2020-07-10 14:43:03,010 INFO L280 TraceCheckUtils]: 28: Hoare triple {494#false} assume !false; {494#false} is VALID [2020-07-10 14:43:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:43:03,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731983878] [2020-07-10 14:43:03,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191616125] [2020-07-10 14:43:03,012 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:03,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:43:03,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:03,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 14:43:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:03,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:03,113 INFO L263 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2020-07-10 14:43:03,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 14:43:03,113 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {493#true} {493#true} #40#return; {493#true} is VALID [2020-07-10 14:43:03,114 INFO L263 TraceCheckUtils]: 3: Hoare triple {493#true} call #t~ret6 := main(); {493#true} is VALID [2020-07-10 14:43:03,114 INFO L280 TraceCheckUtils]: 4: Hoare triple {493#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; {493#true} is VALID [2020-07-10 14:43:03,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {493#true} assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {493#true} is VALID [2020-07-10 14:43:03,115 INFO L280 TraceCheckUtils]: 6: Hoare triple {493#true} assume !(~n~0 < 0 || ~n~0 > 23); {493#true} is VALID [2020-07-10 14:43:03,115 INFO L263 TraceCheckUtils]: 7: Hoare triple {493#true} call #t~ret5 := ackermann(~m~0, ~n~0); {493#true} is VALID [2020-07-10 14:43:03,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {493#true} is VALID [2020-07-10 14:43:03,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {493#true} assume !(0 == ~m); {493#true} is VALID [2020-07-10 14:43:03,116 INFO L280 TraceCheckUtils]: 10: Hoare triple {493#true} assume 0 == ~n; {493#true} is VALID [2020-07-10 14:43:03,116 INFO L263 TraceCheckUtils]: 11: Hoare triple {493#true} call #t~ret0 := ackermann(~m - 1, 1); {493#true} is VALID [2020-07-10 14:43:03,117 INFO L280 TraceCheckUtils]: 12: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {571#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:03,118 INFO L280 TraceCheckUtils]: 13: Hoare triple {571#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {571#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-10 14:43:03,118 INFO L280 TraceCheckUtils]: 14: Hoare triple {571#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {578#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:03,119 INFO L263 TraceCheckUtils]: 15: Hoare triple {578#(<= |ackermann_#in~n| 0)} call #t~ret0 := ackermann(~m - 1, 1); {493#true} is VALID [2020-07-10 14:43:03,119 INFO L280 TraceCheckUtils]: 16: Hoare triple {493#true} ~m := #in~m;~n := #in~n; {493#true} is VALID [2020-07-10 14:43:03,119 INFO L280 TraceCheckUtils]: 17: Hoare triple {493#true} assume 0 == ~m;#res := 1 + ~n; {493#true} is VALID [2020-07-10 14:43:03,119 INFO L280 TraceCheckUtils]: 18: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 14:43:03,121 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {493#true} {578#(<= |ackermann_#in~n| 0)} #44#return; {578#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:03,122 INFO L280 TraceCheckUtils]: 20: Hoare triple {578#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {578#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:03,122 INFO L280 TraceCheckUtils]: 21: Hoare triple {578#(<= |ackermann_#in~n| 0)} assume true; {578#(<= |ackermann_#in~n| 0)} is VALID [2020-07-10 14:43:03,124 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {578#(<= |ackermann_#in~n| 0)} {493#true} #44#return; {494#false} is VALID [2020-07-10 14:43:03,124 INFO L280 TraceCheckUtils]: 23: Hoare triple {494#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {494#false} is VALID [2020-07-10 14:43:03,124 INFO L280 TraceCheckUtils]: 24: Hoare triple {494#false} assume true; {494#false} is VALID [2020-07-10 14:43:03,125 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {494#false} {493#true} #50#return; {494#false} is VALID [2020-07-10 14:43:03,125 INFO L280 TraceCheckUtils]: 26: Hoare triple {494#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; {494#false} is VALID [2020-07-10 14:43:03,125 INFO L280 TraceCheckUtils]: 27: Hoare triple {494#false} assume !(~m~0 < 2 || ~result~0 >= 4); {494#false} is VALID [2020-07-10 14:43:03,126 INFO L280 TraceCheckUtils]: 28: Hoare triple {494#false} assume !false; {494#false} is VALID [2020-07-10 14:43:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:43:03,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:03,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-10 14:43:03,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823474800] [2020-07-10 14:43:03,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-10 14:43:03,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:03,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:43:03,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:03,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:43:03,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:03,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:43:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:03,172 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 6 states. [2020-07-10 14:43:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:03,336 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2020-07-10 14:43:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:43:03,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-10 14:43:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2020-07-10 14:43:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2020-07-10 14:43:03,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2020-07-10 14:43:03,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:03,440 INFO L225 Difference]: With dead ends: 62 [2020-07-10 14:43:03,440 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 14:43:03,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:43:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 14:43:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-10 14:43:03,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:03,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:03,469 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:03,469 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:03,474 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2020-07-10 14:43:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-10 14:43:03,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:03,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:03,475 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:03,476 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:03,479 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2020-07-10 14:43:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-10 14:43:03,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:03,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:03,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:03,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 14:43:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-07-10 14:43:03,484 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 29 [2020-07-10 14:43:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:03,485 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-07-10 14:43:03,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:43:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-10 14:43:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 14:43:03,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:03,487 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:03,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:03,700 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1711672813, now seen corresponding path program 1 times [2020-07-10 14:43:03,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:03,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934442499] [2020-07-10 14:43:03,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:43:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:43:03,802 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:43:03,802 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:43:03,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:43:03,828 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: ackermannENTRY has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 14:43:03,829 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: ackermannFINAL has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:43:03,830 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:43:03,831 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 14:43:03,831 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 14:43:03,831 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:43:03,831 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:43:03,831 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:43:03,831 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-10 14:43:03,831 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-10 14:43:03,831 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-10 14:43:03,832 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 14:43:03,832 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 14:43:03,832 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 14:43:03,832 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 14:43:03,832 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 14:43:03,832 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:43:03,832 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:43:03,832 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:43:03,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:43:03 BoogieIcfgContainer [2020-07-10 14:43:03,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:43:03,838 INFO L168 Benchmark]: Toolchain (without parser) took 4236.92 ms. Allocated memory was 146.3 MB in the beginning and 245.9 MB in the end (delta: 99.6 MB). Free memory was 103.9 MB in the beginning and 203.3 MB in the end (delta: -99.4 MB). Peak memory consumption was 251.8 kB. Max. memory is 7.1 GB. [2020-07-10 14:43:03,839 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:43:03,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.45 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 93.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:03,841 INFO L168 Benchmark]: Boogie Preprocessor took 31.71 ms. Allocated memory is still 146.3 MB. Free memory was 93.9 MB in the beginning and 92.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:03,842 INFO L168 Benchmark]: RCFGBuilder took 537.64 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.3 MB in the beginning and 162.5 MB in the end (delta: -70.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:03,843 INFO L168 Benchmark]: TraceAbstraction took 3369.23 ms. Allocated memory was 202.9 MB in the beginning and 245.9 MB in the end (delta: 43.0 MB). Free memory was 161.8 MB in the beginning and 203.3 MB in the end (delta: -41.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:03,847 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.45 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 93.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.71 ms. Allocated memory is still 146.3 MB. Free memory was 93.9 MB in the beginning and 92.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 537.64 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.3 MB in the beginning and 162.5 MB in the end (delta: -70.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3369.23 ms. Allocated memory was 202.9 MB in the beginning and 245.9 MB in the end (delta: 43.0 MB). Free memory was 161.8 MB in the beginning and 203.3 MB in the end (delta: -41.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0 || m > 3) [L32] int n = __VERIFIER_nondet_int(); [L33] COND FALSE !(n < 0 || n > 23) VAL [m=2, n=0] [L39] CALL, EXPR ackermann(m,n) VAL [\old(m)=2, \old(n)=0] [L15] COND FALSE !(m==0) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L18] COND TRUE n==0 VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L19] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=1] [L15] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L18] COND FALSE !(n==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L21] CALL, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=0] [L15] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L18] COND TRUE n==0 VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L19] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=0, \old(n)=1] [L15] COND TRUE m==0 [L16] return n+1; VAL [\old(m)=0, \old(n)=1, \result=2, m=0, n=1] [L19] RET, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=0, ackermann(m-1,1)=2, m=1, n=0] [L19] return ackermann(m-1,1); [L21] RET, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=1, ackermann(m,n-1)=2, m=1, n=1] [L21] CALL, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=0, \old(n)=2] [L15] COND TRUE m==0 [L16] return n+1; VAL [\old(m)=0, \old(n)=2, \result=3, m=0, n=2] [L21] RET, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=1, \old(n)=1, ackermann(m,n-1)=2, ackermann(m-1,ackermann(m,n-1))=3, m=1, n=1] [L21] return ackermann(m-1,ackermann(m,n-1)); [L19] RET, EXPR ackermann(m-1,1) VAL [\old(m)=2, \old(n)=0, ackermann(m-1,1)=3, m=2, n=0] [L19] return ackermann(m-1,1); [L39] RET, EXPR ackermann(m,n) VAL [ackermann(m,n)=3, m=2, n=0] [L39] int result = ackermann(m,n); [L40] COND FALSE !(m < 2 || result >= 4) VAL [m=2, n=0, result=3] [L43] __VERIFIER_error() VAL [m=2, n=0, result=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 5, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 75 SDtfs, 48 SDslu, 156 SDs, 0 SdLazy, 135 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 4382 SizeOfPredicates, 4 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 32/38 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...