/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 21:49:00,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 21:49:00,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 21:49:00,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 21:49:00,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 21:49:00,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 21:49:00,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 21:49:00,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 21:49:00,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 21:49:00,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 21:49:00,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 21:49:00,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 21:49:00,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 21:49:00,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 21:49:00,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 21:49:00,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 21:49:00,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 21:49:00,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 21:49:00,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 21:49:00,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 21:49:00,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 21:49:00,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 21:49:00,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 21:49:00,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 21:49:00,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 21:49:00,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 21:49:00,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 21:49:00,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 21:49:00,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 21:49:00,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 21:49:00,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 21:49:00,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 21:49:00,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 21:49:00,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 21:49:00,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 21:49:00,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 21:49:00,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 21:49:00,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 21:49:00,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 21:49:00,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 21:49:00,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 21:49:00,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 21:49:00,657 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 21:49:00,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 21:49:00,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 21:49:00,659 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 21:49:00,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 21:49:00,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 21:49:00,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 21:49:00,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 21:49:00,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 21:49:00,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 21:49:00,661 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 21:49:00,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 21:49:00,662 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 21:49:00,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 21:49:00,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 21:49:00,663 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 21:49:00,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 21:49:00,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 21:49:00,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 21:49:00,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 21:49:00,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 21:49:00,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 21:49:00,664 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 21:49:00,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 21:49:00,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 21:49:01,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 21:49:01,002 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 21:49:01,003 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 21:49:01,003 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann02.c [2020-07-08 21:49:01,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be42d92e/5840a9c1a9524db198f0498e00c3c26a/FLAG828f90cbb [2020-07-08 21:49:01,464 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 21:49:01,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann02.c [2020-07-08 21:49:01,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be42d92e/5840a9c1a9524db198f0498e00c3c26a/FLAG828f90cbb [2020-07-08 21:49:01,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be42d92e/5840a9c1a9524db198f0498e00c3c26a [2020-07-08 21:49:01,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 21:49:01,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 21:49:01,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 21:49:01,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 21:49:01,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 21:49:01,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:49:01" (1/1) ... [2020-07-08 21:49:01,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b184564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:01, skipping insertion in model container [2020-07-08 21:49:01,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:49:01" (1/1) ... [2020-07-08 21:49:01,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 21:49:01,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 21:49:02,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:49:02,071 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 21:49:02,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:49:02,105 INFO L208 MainTranslator]: Completed translation [2020-07-08 21:49:02,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02 WrapperNode [2020-07-08 21:49:02,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 21:49:02,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 21:49:02,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 21:49:02,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 21:49:02,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (1/1) ... [2020-07-08 21:49:02,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 21:49:02,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 21:49:02,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 21:49:02,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 21:49:02,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (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-08 21:49:02,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 21:49:02,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 21:49:02,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-08 21:49:02,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 21:49:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 21:49:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 21:49:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-08 21:49:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 21:49:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 21:49:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 21:49:02,673 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 21:49:02,673 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 21:49:02,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:49:02 BoogieIcfgContainer [2020-07-08 21:49:02,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 21:49:02,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 21:49:02,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 21:49:02,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 21:49:02,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 09:49:01" (1/3) ... [2020-07-08 21:49:02,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383911d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:49:02, skipping insertion in model container [2020-07-08 21:49:02,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:02" (2/3) ... [2020-07-08 21:49:02,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383911d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:49:02, skipping insertion in model container [2020-07-08 21:49:02,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:49:02" (3/3) ... [2020-07-08 21:49:02,688 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann02.c [2020-07-08 21:49:02,701 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 21:49:02,710 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 21:49:02,744 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 21:49:02,793 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 21:49:02,793 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 21:49:02,793 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 21:49:02,793 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 21:49:02,793 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 21:49:02,794 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 21:49:02,794 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 21:49:02,794 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 21:49:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-08 21:49:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 21:49:02,832 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:02,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:02,834 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-07-08 21:49:02,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:02,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1117764617] [2020-07-08 21:49:02,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:03,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-08 21:49:03,077 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-08 21:49:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:03,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} ~m := #in~m; {58#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {58#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,161 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,163 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#(= 0 |ackermann_#in~m|)} assume true; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,169 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {59#(= 0 |ackermann_#in~m|)} {47#true} #67#return; {57#(<= main_~m~0 0)} is VALID [2020-07-08 21:49:03,170 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-08 21:49:03,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-08 21:49:03,171 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-08 21:49:03,171 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret6 := main(); {47#true} is VALID [2020-07-08 21:49:03,172 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {47#true} is VALID [2020-07-08 21:49:03,175 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~m~0 := #t~nondet3; {47#true} is VALID [2020-07-08 21:49:03,176 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#true} havoc #t~nondet3; {47#true} is VALID [2020-07-08 21:49:03,176 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume !(~m~0 < 0 || ~m~0 > 3); {47#true} is VALID [2020-07-08 21:49:03,177 INFO L280 TraceCheckUtils]: 8: Hoare triple {47#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {47#true} is VALID [2020-07-08 21:49:03,178 INFO L280 TraceCheckUtils]: 9: Hoare triple {47#true} ~n~0 := #t~nondet4; {47#true} is VALID [2020-07-08 21:49:03,178 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} havoc #t~nondet4; {47#true} is VALID [2020-07-08 21:49:03,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#true} assume !(~n~0 < 0 || ~n~0 > 23); {47#true} is VALID [2020-07-08 21:49:03,181 INFO L263 TraceCheckUtils]: 12: Hoare triple {47#true} call #t~ret5 := ackermann(~m~0, ~n~0); {47#true} is VALID [2020-07-08 21:49:03,182 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#true} ~m := #in~m; {58#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,184 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {58#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,185 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,186 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,189 INFO L280 TraceCheckUtils]: 17: Hoare triple {59#(= 0 |ackermann_#in~m|)} assume true; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:03,192 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {59#(= 0 |ackermann_#in~m|)} {47#true} #67#return; {57#(<= main_~m~0 0)} is VALID [2020-07-08 21:49:03,195 INFO L280 TraceCheckUtils]: 19: Hoare triple {57#(<= main_~m~0 0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {57#(<= main_~m~0 0)} is VALID [2020-07-08 21:49:03,196 INFO L280 TraceCheckUtils]: 20: Hoare triple {57#(<= main_~m~0 0)} ~result~0 := #t~ret5; {57#(<= main_~m~0 0)} is VALID [2020-07-08 21:49:03,197 INFO L280 TraceCheckUtils]: 21: Hoare triple {57#(<= main_~m~0 0)} havoc #t~ret5; {57#(<= main_~m~0 0)} is VALID [2020-07-08 21:49:03,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {57#(<= main_~m~0 0)} assume !(~m~0 < 2 || ~result~0 >= 4); {48#false} is VALID [2020-07-08 21:49:03,199 INFO L280 TraceCheckUtils]: 23: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-08 21:49:03,205 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-08 21:49:03,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1117764617] [2020-07-08 21:49:03,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:03,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 21:49:03,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709834348] [2020-07-08 21:49:03,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-08 21:49:03,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:03,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 21:49:03,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:03,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 21:49:03,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:03,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 21:49:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:49:03,303 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2020-07-08 21:49:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:03,807 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2020-07-08 21:49:03,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 21:49:03,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-08 21:49:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 21:49:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-08 21:49:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 21:49:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-08 21:49:03,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2020-07-08 21:49:04,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:04,028 INFO L225 Difference]: With dead ends: 88 [2020-07-08 21:49:04,029 INFO L226 Difference]: Without dead ends: 45 [2020-07-08 21:49:04,042 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-08 21:49:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-08 21:49:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-08 21:49:04,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:04,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-08 21:49:04,175 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-08 21:49:04,176 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-08 21:49:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:04,189 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-07-08 21:49:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-07-08 21:49:04,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:04,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:04,200 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-08 21:49:04,200 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-08 21:49:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:04,211 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-07-08 21:49:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-07-08 21:49:04,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:04,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:04,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:04,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 21:49:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-07-08 21:49:04,229 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 24 [2020-07-08 21:49:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:04,232 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-07-08 21:49:04,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 21:49:04,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 52 transitions. [2020-07-08 21:49:04,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-07-08 21:49:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 21:49:04,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:04,311 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:04,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 21:49:04,313 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-07-08 21:49:04,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:04,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [329730528] [2020-07-08 21:49:04,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:04,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {420#true} assume true; {420#true} is VALID [2020-07-08 21:49:04,424 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {420#true} {420#true} #57#return; {420#true} is VALID [2020-07-08 21:49:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:04,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#(= 0 |ackermann_#in~m|)} assume true; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,523 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {449#(= 0 |ackermann_#in~m|)} {441#(= ackermann_~m |ackermann_#in~m|)} #61#return; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,526 INFO L280 TraceCheckUtils]: 3: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,526 INFO L263 TraceCheckUtils]: 4: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {420#true} is VALID [2020-07-08 21:49:04,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,529 INFO L280 TraceCheckUtils]: 7: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,530 INFO L280 TraceCheckUtils]: 8: Hoare triple {449#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,530 INFO L280 TraceCheckUtils]: 9: Hoare triple {449#(= 0 |ackermann_#in~m|)} assume true; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,532 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {449#(= 0 |ackermann_#in~m|)} {441#(= ackermann_~m |ackermann_#in~m|)} #61#return; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,533 INFO L280 TraceCheckUtils]: 11: Hoare triple {448#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,534 INFO L280 TraceCheckUtils]: 12: Hoare triple {448#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,534 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,535 INFO L280 TraceCheckUtils]: 14: Hoare triple {448#(<= |ackermann_#in~m| 1)} assume true; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,536 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {448#(<= |ackermann_#in~m| 1)} {420#true} #67#return; {440#(<= main_~m~0 1)} is VALID [2020-07-08 21:49:04,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2020-07-08 21:49:04,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {420#true} assume true; {420#true} is VALID [2020-07-08 21:49:04,538 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {420#true} {420#true} #57#return; {420#true} is VALID [2020-07-08 21:49:04,539 INFO L263 TraceCheckUtils]: 3: Hoare triple {420#true} call #t~ret6 := main(); {420#true} is VALID [2020-07-08 21:49:04,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {420#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {420#true} is VALID [2020-07-08 21:49:04,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {420#true} ~m~0 := #t~nondet3; {420#true} is VALID [2020-07-08 21:49:04,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {420#true} havoc #t~nondet3; {420#true} is VALID [2020-07-08 21:49:04,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {420#true} assume !(~m~0 < 0 || ~m~0 > 3); {420#true} is VALID [2020-07-08 21:49:04,540 INFO L280 TraceCheckUtils]: 8: Hoare triple {420#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {420#true} is VALID [2020-07-08 21:49:04,540 INFO L280 TraceCheckUtils]: 9: Hoare triple {420#true} ~n~0 := #t~nondet4; {420#true} is VALID [2020-07-08 21:49:04,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {420#true} havoc #t~nondet4; {420#true} is VALID [2020-07-08 21:49:04,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {420#true} assume !(~n~0 < 0 || ~n~0 > 23); {420#true} is VALID [2020-07-08 21:49:04,541 INFO L263 TraceCheckUtils]: 12: Hoare triple {420#true} call #t~ret5 := ackermann(~m~0, ~n~0); {420#true} is VALID [2020-07-08 21:49:04,542 INFO L280 TraceCheckUtils]: 13: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,543 INFO L280 TraceCheckUtils]: 14: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,544 INFO L280 TraceCheckUtils]: 15: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,545 INFO L280 TraceCheckUtils]: 16: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,545 INFO L263 TraceCheckUtils]: 17: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {420#true} is VALID [2020-07-08 21:49:04,546 INFO L280 TraceCheckUtils]: 18: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,547 INFO L280 TraceCheckUtils]: 19: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,548 INFO L280 TraceCheckUtils]: 20: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,548 INFO L280 TraceCheckUtils]: 21: Hoare triple {449#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,549 INFO L280 TraceCheckUtils]: 22: Hoare triple {449#(= 0 |ackermann_#in~m|)} assume true; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-08 21:49:04,551 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {449#(= 0 |ackermann_#in~m|)} {441#(= ackermann_~m |ackermann_#in~m|)} #61#return; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,551 INFO L280 TraceCheckUtils]: 24: Hoare triple {448#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,552 INFO L280 TraceCheckUtils]: 25: Hoare triple {448#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,553 INFO L280 TraceCheckUtils]: 26: Hoare triple {448#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,554 INFO L280 TraceCheckUtils]: 27: Hoare triple {448#(<= |ackermann_#in~m| 1)} assume true; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-08 21:49:04,555 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {448#(<= |ackermann_#in~m| 1)} {420#true} #67#return; {440#(<= main_~m~0 1)} is VALID [2020-07-08 21:49:04,556 INFO L280 TraceCheckUtils]: 29: Hoare triple {440#(<= main_~m~0 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {440#(<= main_~m~0 1)} is VALID [2020-07-08 21:49:04,557 INFO L280 TraceCheckUtils]: 30: Hoare triple {440#(<= main_~m~0 1)} ~result~0 := #t~ret5; {440#(<= main_~m~0 1)} is VALID [2020-07-08 21:49:04,557 INFO L280 TraceCheckUtils]: 31: Hoare triple {440#(<= main_~m~0 1)} havoc #t~ret5; {440#(<= main_~m~0 1)} is VALID [2020-07-08 21:49:04,558 INFO L280 TraceCheckUtils]: 32: Hoare triple {440#(<= main_~m~0 1)} assume !(~m~0 < 2 || ~result~0 >= 4); {421#false} is VALID [2020-07-08 21:49:04,559 INFO L280 TraceCheckUtils]: 33: Hoare triple {421#false} assume !false; {421#false} is VALID [2020-07-08 21:49:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-08 21:49:04,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [329730528] [2020-07-08 21:49:04,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:04,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 21:49:04,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486050190] [2020-07-08 21:49:04,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-08 21:49:04,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:04,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 21:49:04,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:04,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 21:49:04,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 21:49:04,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:49:04,605 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 6 states. [2020-07-08 21:49:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:05,190 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2020-07-08 21:49:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 21:49:05,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-08 21:49:05,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:49:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2020-07-08 21:49:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:49:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2020-07-08 21:49:05,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 85 transitions. [2020-07-08 21:49:05,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:05,338 INFO L225 Difference]: With dead ends: 68 [2020-07-08 21:49:05,339 INFO L226 Difference]: Without dead ends: 62 [2020-07-08 21:49:05,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-08 21:49:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-08 21:49:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-08 21:49:05,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:05,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2020-07-08 21:49:05,448 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-08 21:49:05,449 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-08 21:49:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:05,456 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2020-07-08 21:49:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2020-07-08 21:49:05,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:05,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:05,458 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-08 21:49:05,459 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-08 21:49:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:05,464 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2020-07-08 21:49:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2020-07-08 21:49:05,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:05,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:05,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:05,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-08 21:49:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2020-07-08 21:49:05,474 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 34 [2020-07-08 21:49:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:05,475 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2020-07-08 21:49:05,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 21:49:05,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2020-07-08 21:49:05,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2020-07-08 21:49:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 21:49:05,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:05,584 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:05,584 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 21:49:05,585 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:05,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1453709960, now seen corresponding path program 2 times [2020-07-08 21:49:05,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:05,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [822775101] [2020-07-08 21:49:05,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-08 21:49:05,622 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {840#true} {840#true} #57#return; {840#true} is VALID [2020-07-08 21:49:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:05,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-08 21:49:05,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#true} assume 0 == ~m; {840#true} is VALID [2020-07-08 21:49:05,684 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#true} #res := 1 + ~n; {840#true} is VALID [2020-07-08 21:49:05,684 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-08 21:49:05,685 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {840#true} {887#(= 0 |ackermann_#in~n|)} #61#return; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#true} ~n := #in~n; {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,687 INFO L280 TraceCheckUtils]: 2: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,688 INFO L280 TraceCheckUtils]: 3: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,689 INFO L263 TraceCheckUtils]: 4: Hoare triple {887#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-08 21:49:05,689 INFO L280 TraceCheckUtils]: 5: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-08 21:49:05,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {840#true} assume 0 == ~m; {840#true} is VALID [2020-07-08 21:49:05,690 INFO L280 TraceCheckUtils]: 8: Hoare triple {840#true} #res := 1 + ~n; {840#true} is VALID [2020-07-08 21:49:05,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-08 21:49:05,691 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {840#true} {887#(= 0 |ackermann_#in~n|)} #61#return; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,693 INFO L280 TraceCheckUtils]: 12: Hoare triple {887#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,693 INFO L280 TraceCheckUtils]: 13: Hoare triple {887#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,694 INFO L280 TraceCheckUtils]: 14: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume true; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,695 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {887#(= 0 |ackermann_#in~n|)} {840#true} #61#return; {841#false} is VALID [2020-07-08 21:49:05,696 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-08 21:49:05,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#true} assume !(0 == ~m); {840#true} is VALID [2020-07-08 21:49:05,697 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#true} assume 0 == ~n; {840#true} is VALID [2020-07-08 21:49:05,697 INFO L263 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-08 21:49:05,698 INFO L280 TraceCheckUtils]: 5: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {840#true} ~n := #in~n; {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,699 INFO L280 TraceCheckUtils]: 7: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,700 INFO L280 TraceCheckUtils]: 8: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,700 INFO L263 TraceCheckUtils]: 9: Hoare triple {887#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-08 21:49:05,700 INFO L280 TraceCheckUtils]: 10: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,701 INFO L280 TraceCheckUtils]: 11: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-08 21:49:05,701 INFO L280 TraceCheckUtils]: 12: Hoare triple {840#true} assume 0 == ~m; {840#true} is VALID [2020-07-08 21:49:05,701 INFO L280 TraceCheckUtils]: 13: Hoare triple {840#true} #res := 1 + ~n; {840#true} is VALID [2020-07-08 21:49:05,702 INFO L280 TraceCheckUtils]: 14: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-08 21:49:05,703 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {840#true} {887#(= 0 |ackermann_#in~n|)} #61#return; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,704 INFO L280 TraceCheckUtils]: 17: Hoare triple {887#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,705 INFO L280 TraceCheckUtils]: 18: Hoare triple {887#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,706 INFO L280 TraceCheckUtils]: 19: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume true; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,707 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {887#(= 0 |ackermann_#in~n|)} {840#true} #61#return; {841#false} is VALID [2020-07-08 21:49:05,707 INFO L280 TraceCheckUtils]: 21: Hoare triple {841#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {841#false} is VALID [2020-07-08 21:49:05,708 INFO L280 TraceCheckUtils]: 22: Hoare triple {841#false} #res := #t~ret0; {841#false} is VALID [2020-07-08 21:49:05,708 INFO L280 TraceCheckUtils]: 23: Hoare triple {841#false} havoc #t~ret0; {841#false} is VALID [2020-07-08 21:49:05,708 INFO L280 TraceCheckUtils]: 24: Hoare triple {841#false} assume true; {841#false} is VALID [2020-07-08 21:49:05,708 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {841#false} {840#true} #67#return; {841#false} is VALID [2020-07-08 21:49:05,710 INFO L263 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2020-07-08 21:49:05,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-08 21:49:05,710 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #57#return; {840#true} is VALID [2020-07-08 21:49:05,710 INFO L263 TraceCheckUtils]: 3: Hoare triple {840#true} call #t~ret6 := main(); {840#true} is VALID [2020-07-08 21:49:05,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {840#true} is VALID [2020-07-08 21:49:05,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {840#true} ~m~0 := #t~nondet3; {840#true} is VALID [2020-07-08 21:49:05,711 INFO L280 TraceCheckUtils]: 6: Hoare triple {840#true} havoc #t~nondet3; {840#true} is VALID [2020-07-08 21:49:05,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {840#true} assume !(~m~0 < 0 || ~m~0 > 3); {840#true} is VALID [2020-07-08 21:49:05,712 INFO L280 TraceCheckUtils]: 8: Hoare triple {840#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {840#true} is VALID [2020-07-08 21:49:05,712 INFO L280 TraceCheckUtils]: 9: Hoare triple {840#true} ~n~0 := #t~nondet4; {840#true} is VALID [2020-07-08 21:49:05,712 INFO L280 TraceCheckUtils]: 10: Hoare triple {840#true} havoc #t~nondet4; {840#true} is VALID [2020-07-08 21:49:05,713 INFO L280 TraceCheckUtils]: 11: Hoare triple {840#true} assume !(~n~0 < 0 || ~n~0 > 23); {840#true} is VALID [2020-07-08 21:49:05,713 INFO L263 TraceCheckUtils]: 12: Hoare triple {840#true} call #t~ret5 := ackermann(~m~0, ~n~0); {840#true} is VALID [2020-07-08 21:49:05,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,713 INFO L280 TraceCheckUtils]: 14: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-08 21:49:05,714 INFO L280 TraceCheckUtils]: 15: Hoare triple {840#true} assume !(0 == ~m); {840#true} is VALID [2020-07-08 21:49:05,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {840#true} assume 0 == ~n; {840#true} is VALID [2020-07-08 21:49:05,714 INFO L263 TraceCheckUtils]: 17: Hoare triple {840#true} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-08 21:49:05,714 INFO L280 TraceCheckUtils]: 18: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {840#true} ~n := #in~n; {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,717 INFO L280 TraceCheckUtils]: 21: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,717 INFO L263 TraceCheckUtils]: 22: Hoare triple {887#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-08 21:49:05,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-08 21:49:05,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-08 21:49:05,718 INFO L280 TraceCheckUtils]: 25: Hoare triple {840#true} assume 0 == ~m; {840#true} is VALID [2020-07-08 21:49:05,718 INFO L280 TraceCheckUtils]: 26: Hoare triple {840#true} #res := 1 + ~n; {840#true} is VALID [2020-07-08 21:49:05,718 INFO L280 TraceCheckUtils]: 27: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-08 21:49:05,732 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {840#true} {887#(= 0 |ackermann_#in~n|)} #61#return; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,732 INFO L280 TraceCheckUtils]: 29: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,733 INFO L280 TraceCheckUtils]: 30: Hoare triple {887#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,734 INFO L280 TraceCheckUtils]: 31: Hoare triple {887#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,734 INFO L280 TraceCheckUtils]: 32: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume true; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-08 21:49:05,736 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {887#(= 0 |ackermann_#in~n|)} {840#true} #61#return; {841#false} is VALID [2020-07-08 21:49:05,736 INFO L280 TraceCheckUtils]: 34: Hoare triple {841#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {841#false} is VALID [2020-07-08 21:49:05,736 INFO L280 TraceCheckUtils]: 35: Hoare triple {841#false} #res := #t~ret0; {841#false} is VALID [2020-07-08 21:49:05,737 INFO L280 TraceCheckUtils]: 36: Hoare triple {841#false} havoc #t~ret0; {841#false} is VALID [2020-07-08 21:49:05,737 INFO L280 TraceCheckUtils]: 37: Hoare triple {841#false} assume true; {841#false} is VALID [2020-07-08 21:49:05,737 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {841#false} {840#true} #67#return; {841#false} is VALID [2020-07-08 21:49:05,737 INFO L280 TraceCheckUtils]: 39: Hoare triple {841#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {841#false} is VALID [2020-07-08 21:49:05,738 INFO L280 TraceCheckUtils]: 40: Hoare triple {841#false} ~result~0 := #t~ret5; {841#false} is VALID [2020-07-08 21:49:05,738 INFO L280 TraceCheckUtils]: 41: Hoare triple {841#false} havoc #t~ret5; {841#false} is VALID [2020-07-08 21:49:05,738 INFO L280 TraceCheckUtils]: 42: Hoare triple {841#false} assume !(~m~0 < 2 || ~result~0 >= 4); {841#false} is VALID [2020-07-08 21:49:05,738 INFO L280 TraceCheckUtils]: 43: Hoare triple {841#false} assume !false; {841#false} is VALID [2020-07-08 21:49:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 21:49:05,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [822775101] [2020-07-08 21:49:05,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:05,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-08 21:49:05,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911683522] [2020-07-08 21:49:05,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-08 21:49:05,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:05,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 21:49:05,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:05,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 21:49:05,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 21:49:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 21:49:05,782 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 4 states. [2020-07-08 21:49:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:06,095 INFO L93 Difference]: Finished difference Result 115 states and 174 transitions. [2020-07-08 21:49:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 21:49:06,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-08 21:49:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:49:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-08 21:49:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:49:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-08 21:49:06,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2020-07-08 21:49:06,205 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-08 21:49:06,209 INFO L225 Difference]: With dead ends: 115 [2020-07-08 21:49:06,210 INFO L226 Difference]: Without dead ends: 66 [2020-07-08 21:49:06,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:49:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-08 21:49:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-08 21:49:06,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:06,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-08 21:49:06,340 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-08 21:49:06,341 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-08 21:49:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:06,352 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2020-07-08 21:49:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2020-07-08 21:49:06,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:06,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:06,354 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-08 21:49:06,355 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-08 21:49:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:06,366 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2020-07-08 21:49:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2020-07-08 21:49:06,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:06,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:06,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:06,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-08 21:49:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2020-07-08 21:49:06,381 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 44 [2020-07-08 21:49:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:06,381 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2020-07-08 21:49:06,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 21:49:06,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 89 transitions. [2020-07-08 21:49:06,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2020-07-08 21:49:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-08 21:49:06,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:06,536 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:06,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 21:49:06,536 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:06,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1096450289, now seen corresponding path program 1 times [2020-07-08 21:49:06,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:06,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589611374] [2020-07-08 21:49:06,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 21:49:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 21:49:06,610 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 21:49:06,610 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 21:49:06,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 21:49:06,645 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 21:49:06,645 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 21:49:06,645 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 21:49:06,645 WARN L170 areAnnotationChecker]: ackermannENTRY has no Hoare annotation [2020-07-08 21:49:06,645 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 21:49:06,645 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 21:49:06,646 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 21:49:06,646 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 21:49:06,646 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 21:49:06,646 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 21:49:06,646 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 21:49:06,646 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 21:49:06,646 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 21:49:06,646 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: ackermannFINAL has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 21:49:06,647 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-08 21:49:06,648 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 21:49:06,649 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 21:49:06,650 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 21:49:06,651 WARN L170 areAnnotationChecker]: L21-6 has no Hoare annotation [2020-07-08 21:49:06,651 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 21:49:06,651 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 21:49:06,651 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 21:49:06,651 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 21:49:06,651 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 21:49:06,651 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-08 21:49:06,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 09:49:06 BoogieIcfgContainer [2020-07-08 21:49:06,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 21:49:06,658 INFO L168 Benchmark]: Toolchain (without parser) took 4800.60 ms. Allocated memory was 145.8 MB in the beginning and 274.7 MB in the end (delta: 129.0 MB). Free memory was 104.2 MB in the beginning and 234.9 MB in the end (delta: -130.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 21:49:06,659 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 21:49:06,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.29 ms. Allocated memory is still 145.8 MB. Free memory was 103.9 MB in the beginning and 94.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:06,661 INFO L168 Benchmark]: Boogie Preprocessor took 28.84 ms. Allocated memory is still 145.8 MB. Free memory was 94.2 MB in the beginning and 92.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:06,662 INFO L168 Benchmark]: RCFGBuilder took 542.79 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 92.8 MB in the beginning and 161.1 MB in the end (delta: -68.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:06,663 INFO L168 Benchmark]: TraceAbstraction took 3975.10 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 160.4 MB in the beginning and 234.9 MB in the end (delta: -74.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 21:49:06,666 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 248.29 ms. Allocated memory is still 145.8 MB. Free memory was 103.9 MB in the beginning and 94.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.84 ms. Allocated memory is still 145.8 MB. Free memory was 94.2 MB in the beginning and 92.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 542.79 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 92.8 MB in the beginning and 161.1 MB in the end (delta: -68.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3975.10 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 160.4 MB in the beginning and 234.9 MB in the end (delta: -74.5 MB). There was no memory consumed. 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(); VAL [__VERIFIER_nondet_int()=2, m=2] [L27] COND FALSE !(m < 0 || m > 3) VAL [m=2] [L32] int n = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, m=2, n=0] [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 VAL [\old(m)=0, \old(n)=1, m=0, n=1] [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); VAL [\old(m)=1, \old(n)=0, \result=2, ackermann(m-1,1)=2, m=1, n=0] [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 VAL [\old(m)=0, \old(n)=2, m=0, n=2] [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)); VAL [\old(m)=1, \old(n)=1, \result=3, ackermann(m,n-1)=2, ackermann(m-1,ackermann(m,n-1))=3, m=1, 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); VAL [\old(m)=2, \old(n)=0, \result=3, ackermann(m-1,1)=3, m=2, n=0] [L39] RET, EXPR ackermann(m,n) VAL [ackermann(m,n)=3, m=2, n=0] [L39] int result = ackermann(m,n); VAL [ackermann(m,n)=3, m=2, n=0, result=3] [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, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 5, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 128 SDtfs, 77 SDslu, 245 SDs, 0 SdLazy, 129 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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.4s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 5757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 22/25 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...