/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-8fc6572 [2020-07-11 00:33:44,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:44,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:44,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:44,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:44,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:44,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:44,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:44,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:44,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:44,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:44,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:44,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:44,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:44,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:44,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:44,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:44,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:44,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:44,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:44,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:44,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:44,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:44,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:44,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:44,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:44,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:44,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:44,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:44,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:44,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:44,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:44,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:44,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:44,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:44,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:44,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:44,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:44,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:44,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:44,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:44,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:44,988 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:44,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:44,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:44,990 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:44,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:44,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:44,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:44,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:44,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:44,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:44,995 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:44,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:44,995 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:44,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:44,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:44,996 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:44,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:44,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:44,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:44,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:44,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:44,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:44,997 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-11 00:33:45,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:45,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:45,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:45,313 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:45,313 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:45,314 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann02.c [2020-07-11 00:33:45,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5270ff6c0/7371b4937e4241079688a12461e38510/FLAGe9ef6dd0c [2020-07-11 00:33:45,845 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:45,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann02.c [2020-07-11 00:33:45,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5270ff6c0/7371b4937e4241079688a12461e38510/FLAGe9ef6dd0c [2020-07-11 00:33:46,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5270ff6c0/7371b4937e4241079688a12461e38510 [2020-07-11 00:33:46,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:46,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:46,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:46,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:46,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:46,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278fc22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46, skipping insertion in model container [2020-07-11 00:33:46,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:46,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:46,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:46,406 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:46,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:46,441 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:46,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46 WrapperNode [2020-07-11 00:33:46,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:46,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:46,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:46,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:46,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (1/1) ... [2020-07-11 00:33:46,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:46,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:46,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:46,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:46,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (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-11 00:33:46,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:46,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:46,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-11 00:33:46,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:33:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-11 00:33:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:46,970 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:46,971 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:33:46,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:46 BoogieIcfgContainer [2020-07-11 00:33:46,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:46,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:46,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:46,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:46,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:46" (1/3) ... [2020-07-11 00:33:46,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375d9924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:46, skipping insertion in model container [2020-07-11 00:33:46,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:46" (2/3) ... [2020-07-11 00:33:46,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375d9924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:46, skipping insertion in model container [2020-07-11 00:33:46,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:46" (3/3) ... [2020-07-11 00:33:46,984 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann02.c [2020-07-11 00:33:46,997 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:47,004 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:47,019 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:47,043 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:47,043 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:47,043 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:47,043 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:47,043 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:47,044 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:47,044 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:47,044 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-11 00:33:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:33:47,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:47,074 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-11 00:33:47,074 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-07-11 00:33:47,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:47,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1432617080] [2020-07-11 00:33:47,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:47,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-11 00:33:47,334 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-11 00:33:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:47,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} ~m := #in~m; {58#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:47,400 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-11 00:33:47,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:47,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:47,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#(= 0 |ackermann_#in~m|)} assume true; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:47,409 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {59#(= 0 |ackermann_#in~m|)} {47#true} #67#return; {57#(<= main_~m~0 0)} is VALID [2020-07-11 00:33:47,411 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-11 00:33:47,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-11 00:33:47,412 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-11 00:33:47,412 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret6 := main(); {47#true} is VALID [2020-07-11 00:33:47,412 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {47#true} is VALID [2020-07-11 00:33:47,413 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~m~0 := #t~nondet3; {47#true} is VALID [2020-07-11 00:33:47,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#true} havoc #t~nondet3; {47#true} is VALID [2020-07-11 00:33:47,414 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume !(~m~0 < 0 || ~m~0 > 3); {47#true} is VALID [2020-07-11 00:33:47,414 INFO L280 TraceCheckUtils]: 8: Hoare triple {47#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {47#true} is VALID [2020-07-11 00:33:47,415 INFO L280 TraceCheckUtils]: 9: Hoare triple {47#true} ~n~0 := #t~nondet4; {47#true} is VALID [2020-07-11 00:33:47,416 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} havoc #t~nondet4; {47#true} is VALID [2020-07-11 00:33:47,416 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#true} assume !(~n~0 < 0 || ~n~0 > 23); {47#true} is VALID [2020-07-11 00:33:47,417 INFO L263 TraceCheckUtils]: 12: Hoare triple {47#true} call #t~ret5 := ackermann(~m~0, ~n~0); {47#true} is VALID [2020-07-11 00:33:47,418 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#true} ~m := #in~m; {58#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:47,420 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-11 00:33:47,422 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:47,424 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:47,426 INFO L280 TraceCheckUtils]: 17: Hoare triple {59#(= 0 |ackermann_#in~m|)} assume true; {59#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:47,429 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {59#(= 0 |ackermann_#in~m|)} {47#true} #67#return; {57#(<= main_~m~0 0)} is VALID [2020-07-11 00:33:47,431 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-11 00:33:47,433 INFO L280 TraceCheckUtils]: 20: Hoare triple {57#(<= main_~m~0 0)} ~result~0 := #t~ret5; {57#(<= main_~m~0 0)} is VALID [2020-07-11 00:33:47,435 INFO L280 TraceCheckUtils]: 21: Hoare triple {57#(<= main_~m~0 0)} havoc #t~ret5; {57#(<= main_~m~0 0)} is VALID [2020-07-11 00:33:47,437 INFO L280 TraceCheckUtils]: 22: Hoare triple {57#(<= main_~m~0 0)} assume !(~m~0 < 2 || ~result~0 >= 4); {48#false} is VALID [2020-07-11 00:33:47,438 INFO L280 TraceCheckUtils]: 23: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-11 00:33:47,441 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-11 00:33:47,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1432617080] [2020-07-11 00:33:47,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:47,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:33:47,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732327083] [2020-07-11 00:33:47,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-11 00:33:47,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:47,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:33:47,510 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-11 00:33:47,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:33:47,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:47,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:33:47,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:33:47,524 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2020-07-11 00:33:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:48,061 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2020-07-11 00:33:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:33:48,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-11 00:33:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:33:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-11 00:33:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:33:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2020-07-11 00:33:48,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2020-07-11 00:33:48,275 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-11 00:33:48,301 INFO L225 Difference]: With dead ends: 88 [2020-07-11 00:33:48,302 INFO L226 Difference]: Without dead ends: 45 [2020-07-11 00:33:48,319 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-11 00:33:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-11 00:33:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-11 00:33:48,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:48,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-11 00:33:48,404 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-11 00:33:48,405 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-11 00:33:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:48,413 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-07-11 00:33:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-07-11 00:33:48,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:48,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:48,416 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-11 00:33:48,416 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-11 00:33:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:48,422 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-07-11 00:33:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-07-11 00:33:48,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:48,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:48,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:48,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-11 00:33:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-07-11 00:33:48,436 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 24 [2020-07-11 00:33:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:48,437 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-07-11 00:33:48,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:33:48,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 52 transitions. [2020-07-11 00:33:48,527 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-11 00:33:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-07-11 00:33:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:33:48,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:48,531 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-11 00:33:48,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:48,532 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:48,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-07-11 00:33:48,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:48,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774084715] [2020-07-11 00:33:48,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,609 INFO L280 TraceCheckUtils]: 0: Hoare triple {420#true} assume true; {420#true} is VALID [2020-07-11 00:33:48,610 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {420#true} {420#true} #57#return; {420#true} is VALID [2020-07-11 00:33:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:48,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,684 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-11 00:33:48,684 INFO L280 TraceCheckUtils]: 2: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#(= 0 |ackermann_#in~m|)} assume true; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,687 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-11 00:33:48,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,689 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-11 00:33:48,689 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-11 00:33:48,690 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-11 00:33:48,690 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-11 00:33:48,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,692 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-11 00:33:48,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {449#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {449#(= 0 |ackermann_#in~m|)} assume true; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,695 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-11 00:33:48,696 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-11 00:33:48,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {448#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:48,697 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:48,698 INFO L280 TraceCheckUtils]: 14: Hoare triple {448#(<= |ackermann_#in~m| 1)} assume true; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:48,699 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {448#(<= |ackermann_#in~m| 1)} {420#true} #67#return; {440#(<= main_~m~0 1)} is VALID [2020-07-11 00:33:48,700 INFO L263 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2020-07-11 00:33:48,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {420#true} assume true; {420#true} is VALID [2020-07-11 00:33:48,701 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {420#true} {420#true} #57#return; {420#true} is VALID [2020-07-11 00:33:48,701 INFO L263 TraceCheckUtils]: 3: Hoare triple {420#true} call #t~ret6 := main(); {420#true} is VALID [2020-07-11 00:33:48,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {420#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {420#true} is VALID [2020-07-11 00:33:48,702 INFO L280 TraceCheckUtils]: 5: Hoare triple {420#true} ~m~0 := #t~nondet3; {420#true} is VALID [2020-07-11 00:33:48,702 INFO L280 TraceCheckUtils]: 6: Hoare triple {420#true} havoc #t~nondet3; {420#true} is VALID [2020-07-11 00:33:48,702 INFO L280 TraceCheckUtils]: 7: Hoare triple {420#true} assume !(~m~0 < 0 || ~m~0 > 3); {420#true} is VALID [2020-07-11 00:33:48,702 INFO L280 TraceCheckUtils]: 8: Hoare triple {420#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {420#true} is VALID [2020-07-11 00:33:48,703 INFO L280 TraceCheckUtils]: 9: Hoare triple {420#true} ~n~0 := #t~nondet4; {420#true} is VALID [2020-07-11 00:33:48,703 INFO L280 TraceCheckUtils]: 10: Hoare triple {420#true} havoc #t~nondet4; {420#true} is VALID [2020-07-11 00:33:48,703 INFO L280 TraceCheckUtils]: 11: Hoare triple {420#true} assume !(~n~0 < 0 || ~n~0 > 23); {420#true} is VALID [2020-07-11 00:33:48,704 INFO L263 TraceCheckUtils]: 12: Hoare triple {420#true} call #t~ret5 := ackermann(~m~0, ~n~0); {420#true} is VALID [2020-07-11 00:33:48,704 INFO L280 TraceCheckUtils]: 13: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,705 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-11 00:33:48,706 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-11 00:33:48,706 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-11 00:33:48,707 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-11 00:33:48,707 INFO L280 TraceCheckUtils]: 18: Hoare triple {420#true} ~m := #in~m; {441#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,708 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-11 00:33:48,709 INFO L280 TraceCheckUtils]: 20: Hoare triple {441#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,709 INFO L280 TraceCheckUtils]: 21: Hoare triple {449#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,710 INFO L280 TraceCheckUtils]: 22: Hoare triple {449#(= 0 |ackermann_#in~m|)} assume true; {449#(= 0 |ackermann_#in~m|)} is VALID [2020-07-11 00:33:48,711 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-11 00:33:48,712 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-11 00:33:48,712 INFO L280 TraceCheckUtils]: 25: Hoare triple {448#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:48,713 INFO L280 TraceCheckUtils]: 26: Hoare triple {448#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:48,714 INFO L280 TraceCheckUtils]: 27: Hoare triple {448#(<= |ackermann_#in~m| 1)} assume true; {448#(<= |ackermann_#in~m| 1)} is VALID [2020-07-11 00:33:48,715 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {448#(<= |ackermann_#in~m| 1)} {420#true} #67#return; {440#(<= main_~m~0 1)} is VALID [2020-07-11 00:33:48,716 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-11 00:33:48,716 INFO L280 TraceCheckUtils]: 30: Hoare triple {440#(<= main_~m~0 1)} ~result~0 := #t~ret5; {440#(<= main_~m~0 1)} is VALID [2020-07-11 00:33:48,717 INFO L280 TraceCheckUtils]: 31: Hoare triple {440#(<= main_~m~0 1)} havoc #t~ret5; {440#(<= main_~m~0 1)} is VALID [2020-07-11 00:33:48,718 INFO L280 TraceCheckUtils]: 32: Hoare triple {440#(<= main_~m~0 1)} assume !(~m~0 < 2 || ~result~0 >= 4); {421#false} is VALID [2020-07-11 00:33:48,718 INFO L280 TraceCheckUtils]: 33: Hoare triple {421#false} assume !false; {421#false} is VALID [2020-07-11 00:33:48,720 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-11 00:33:48,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774084715] [2020-07-11 00:33:48,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:48,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:33:48,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940306340] [2020-07-11 00:33:48,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-11 00:33:48,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:48,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:48,761 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-11 00:33:48,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:48,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:48,763 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 6 states. [2020-07-11 00:33:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:49,318 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2020-07-11 00:33:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:33:49,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-11 00:33:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2020-07-11 00:33:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2020-07-11 00:33:49,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 85 transitions. [2020-07-11 00:33:49,443 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-11 00:33:49,455 INFO L225 Difference]: With dead ends: 68 [2020-07-11 00:33:49,455 INFO L226 Difference]: Without dead ends: 62 [2020-07-11 00:33:49,456 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-11 00:33:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-11 00:33:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-11 00:33:49,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:49,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2020-07-11 00:33:49,557 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-11 00:33:49,558 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-11 00:33:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:49,564 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2020-07-11 00:33:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2020-07-11 00:33:49,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:49,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:49,566 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-11 00:33:49,567 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-11 00:33:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:49,573 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2020-07-11 00:33:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2020-07-11 00:33:49,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:49,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:49,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:49,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-11 00:33:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2020-07-11 00:33:49,580 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 34 [2020-07-11 00:33:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:49,581 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2020-07-11 00:33:49,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:49,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2020-07-11 00:33:49,690 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-11 00:33:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2020-07-11 00:33:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-11 00:33:49,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:49,692 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-11 00:33:49,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:49,693 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1453709960, now seen corresponding path program 2 times [2020-07-11 00:33:49,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:49,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1124220562] [2020-07-11 00:33:49,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-11 00:33:49,744 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {840#true} {840#true} #57#return; {840#true} is VALID [2020-07-11 00:33:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:49,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-11 00:33:49,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#true} assume 0 == ~m; {840#true} is VALID [2020-07-11 00:33:49,803 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#true} #res := 1 + ~n; {840#true} is VALID [2020-07-11 00:33:49,803 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-11 00:33:49,804 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {840#true} {887#(= 0 |ackermann_#in~n|)} #61#return; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#true} ~n := #in~n; {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,806 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-11 00:33:49,807 INFO L280 TraceCheckUtils]: 3: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,807 INFO L263 TraceCheckUtils]: 4: Hoare triple {887#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-11 00:33:49,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-11 00:33:49,808 INFO L280 TraceCheckUtils]: 7: Hoare triple {840#true} assume 0 == ~m; {840#true} is VALID [2020-07-11 00:33:49,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {840#true} #res := 1 + ~n; {840#true} is VALID [2020-07-11 00:33:49,809 INFO L280 TraceCheckUtils]: 9: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-11 00:33:49,810 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {840#true} {887#(= 0 |ackermann_#in~n|)} #61#return; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,811 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-11 00:33:49,811 INFO L280 TraceCheckUtils]: 12: Hoare triple {887#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,812 INFO L280 TraceCheckUtils]: 13: Hoare triple {887#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume true; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,814 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {887#(= 0 |ackermann_#in~n|)} {840#true} #61#return; {841#false} is VALID [2020-07-11 00:33:49,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-11 00:33:49,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#true} assume !(0 == ~m); {840#true} is VALID [2020-07-11 00:33:49,816 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#true} assume 0 == ~n; {840#true} is VALID [2020-07-11 00:33:49,816 INFO L263 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-11 00:33:49,816 INFO L280 TraceCheckUtils]: 5: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,817 INFO L280 TraceCheckUtils]: 6: Hoare triple {840#true} ~n := #in~n; {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,817 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-11 00:33:49,818 INFO L280 TraceCheckUtils]: 8: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,818 INFO L263 TraceCheckUtils]: 9: Hoare triple {887#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-11 00:33:49,819 INFO L280 TraceCheckUtils]: 10: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,819 INFO L280 TraceCheckUtils]: 11: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-11 00:33:49,819 INFO L280 TraceCheckUtils]: 12: Hoare triple {840#true} assume 0 == ~m; {840#true} is VALID [2020-07-11 00:33:49,820 INFO L280 TraceCheckUtils]: 13: Hoare triple {840#true} #res := 1 + ~n; {840#true} is VALID [2020-07-11 00:33:49,820 INFO L280 TraceCheckUtils]: 14: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-11 00:33:49,821 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {840#true} {887#(= 0 |ackermann_#in~n|)} #61#return; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,822 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-11 00:33:49,822 INFO L280 TraceCheckUtils]: 17: Hoare triple {887#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,823 INFO L280 TraceCheckUtils]: 18: Hoare triple {887#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,823 INFO L280 TraceCheckUtils]: 19: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume true; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,825 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {887#(= 0 |ackermann_#in~n|)} {840#true} #61#return; {841#false} is VALID [2020-07-11 00:33:49,825 INFO L280 TraceCheckUtils]: 21: Hoare triple {841#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {841#false} is VALID [2020-07-11 00:33:49,825 INFO L280 TraceCheckUtils]: 22: Hoare triple {841#false} #res := #t~ret0; {841#false} is VALID [2020-07-11 00:33:49,826 INFO L280 TraceCheckUtils]: 23: Hoare triple {841#false} havoc #t~ret0; {841#false} is VALID [2020-07-11 00:33:49,826 INFO L280 TraceCheckUtils]: 24: Hoare triple {841#false} assume true; {841#false} is VALID [2020-07-11 00:33:49,826 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {841#false} {840#true} #67#return; {841#false} is VALID [2020-07-11 00:33:49,827 INFO L263 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2020-07-11 00:33:49,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-11 00:33:49,828 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #57#return; {840#true} is VALID [2020-07-11 00:33:49,828 INFO L263 TraceCheckUtils]: 3: Hoare triple {840#true} call #t~ret6 := main(); {840#true} is VALID [2020-07-11 00:33:49,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {840#true} is VALID [2020-07-11 00:33:49,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {840#true} ~m~0 := #t~nondet3; {840#true} is VALID [2020-07-11 00:33:49,829 INFO L280 TraceCheckUtils]: 6: Hoare triple {840#true} havoc #t~nondet3; {840#true} is VALID [2020-07-11 00:33:49,829 INFO L280 TraceCheckUtils]: 7: Hoare triple {840#true} assume !(~m~0 < 0 || ~m~0 > 3); {840#true} is VALID [2020-07-11 00:33:49,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {840#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {840#true} is VALID [2020-07-11 00:33:49,830 INFO L280 TraceCheckUtils]: 9: Hoare triple {840#true} ~n~0 := #t~nondet4; {840#true} is VALID [2020-07-11 00:33:49,830 INFO L280 TraceCheckUtils]: 10: Hoare triple {840#true} havoc #t~nondet4; {840#true} is VALID [2020-07-11 00:33:49,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {840#true} assume !(~n~0 < 0 || ~n~0 > 23); {840#true} is VALID [2020-07-11 00:33:49,831 INFO L263 TraceCheckUtils]: 12: Hoare triple {840#true} call #t~ret5 := ackermann(~m~0, ~n~0); {840#true} is VALID [2020-07-11 00:33:49,831 INFO L280 TraceCheckUtils]: 13: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,831 INFO L280 TraceCheckUtils]: 14: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-11 00:33:49,831 INFO L280 TraceCheckUtils]: 15: Hoare triple {840#true} assume !(0 == ~m); {840#true} is VALID [2020-07-11 00:33:49,832 INFO L280 TraceCheckUtils]: 16: Hoare triple {840#true} assume 0 == ~n; {840#true} is VALID [2020-07-11 00:33:49,832 INFO L263 TraceCheckUtils]: 17: Hoare triple {840#true} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-11 00:33:49,832 INFO L280 TraceCheckUtils]: 18: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,833 INFO L280 TraceCheckUtils]: 19: Hoare triple {840#true} ~n := #in~n; {886#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,845 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-11 00:33:49,846 INFO L280 TraceCheckUtils]: 21: Hoare triple {886#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,846 INFO L263 TraceCheckUtils]: 22: Hoare triple {887#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {840#true} is VALID [2020-07-11 00:33:49,847 INFO L280 TraceCheckUtils]: 23: Hoare triple {840#true} ~m := #in~m; {840#true} is VALID [2020-07-11 00:33:49,847 INFO L280 TraceCheckUtils]: 24: Hoare triple {840#true} ~n := #in~n; {840#true} is VALID [2020-07-11 00:33:49,847 INFO L280 TraceCheckUtils]: 25: Hoare triple {840#true} assume 0 == ~m; {840#true} is VALID [2020-07-11 00:33:49,847 INFO L280 TraceCheckUtils]: 26: Hoare triple {840#true} #res := 1 + ~n; {840#true} is VALID [2020-07-11 00:33:49,848 INFO L280 TraceCheckUtils]: 27: Hoare triple {840#true} assume true; {840#true} is VALID [2020-07-11 00:33:49,849 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {840#true} {887#(= 0 |ackermann_#in~n|)} #61#return; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,849 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-11 00:33:49,853 INFO L280 TraceCheckUtils]: 30: Hoare triple {887#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,853 INFO L280 TraceCheckUtils]: 31: Hoare triple {887#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,854 INFO L280 TraceCheckUtils]: 32: Hoare triple {887#(= 0 |ackermann_#in~n|)} assume true; {887#(= 0 |ackermann_#in~n|)} is VALID [2020-07-11 00:33:49,855 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {887#(= 0 |ackermann_#in~n|)} {840#true} #61#return; {841#false} is VALID [2020-07-11 00:33:49,855 INFO L280 TraceCheckUtils]: 34: Hoare triple {841#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {841#false} is VALID [2020-07-11 00:33:49,856 INFO L280 TraceCheckUtils]: 35: Hoare triple {841#false} #res := #t~ret0; {841#false} is VALID [2020-07-11 00:33:49,856 INFO L280 TraceCheckUtils]: 36: Hoare triple {841#false} havoc #t~ret0; {841#false} is VALID [2020-07-11 00:33:49,856 INFO L280 TraceCheckUtils]: 37: Hoare triple {841#false} assume true; {841#false} is VALID [2020-07-11 00:33:49,856 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {841#false} {840#true} #67#return; {841#false} is VALID [2020-07-11 00:33:49,857 INFO L280 TraceCheckUtils]: 39: Hoare triple {841#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {841#false} is VALID [2020-07-11 00:33:49,857 INFO L280 TraceCheckUtils]: 40: Hoare triple {841#false} ~result~0 := #t~ret5; {841#false} is VALID [2020-07-11 00:33:49,857 INFO L280 TraceCheckUtils]: 41: Hoare triple {841#false} havoc #t~ret5; {841#false} is VALID [2020-07-11 00:33:49,857 INFO L280 TraceCheckUtils]: 42: Hoare triple {841#false} assume !(~m~0 < 2 || ~result~0 >= 4); {841#false} is VALID [2020-07-11 00:33:49,858 INFO L280 TraceCheckUtils]: 43: Hoare triple {841#false} assume !false; {841#false} is VALID [2020-07-11 00:33:49,860 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-11 00:33:49,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1124220562] [2020-07-11 00:33:49,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:49,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-11 00:33:49,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481992120] [2020-07-11 00:33:49,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-11 00:33:49,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:49,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:33:49,906 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-11 00:33:49,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:33:49,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:33:49,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:33:49,908 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 4 states. [2020-07-11 00:33:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:50,202 INFO L93 Difference]: Finished difference Result 115 states and 174 transitions. [2020-07-11 00:33:50,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:33:50,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-11 00:33:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-11 00:33:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-11 00:33:50,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2020-07-11 00:33:50,304 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-11 00:33:50,308 INFO L225 Difference]: With dead ends: 115 [2020-07-11 00:33:50,308 INFO L226 Difference]: Without dead ends: 66 [2020-07-11 00:33:50,311 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-11 00:33:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-11 00:33:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-11 00:33:50,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:50,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:50,425 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:50,425 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:50,434 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2020-07-11 00:33:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2020-07-11 00:33:50,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:50,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:50,437 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:50,437 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:50,443 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2020-07-11 00:33:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2020-07-11 00:33:50,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:50,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:50,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:50,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-11 00:33:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2020-07-11 00:33:50,450 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 44 [2020-07-11 00:33:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:50,451 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2020-07-11 00:33:50,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:33:50,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 89 transitions. [2020-07-11 00:33:50,592 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-11 00:33:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2020-07-11 00:33:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-11 00:33:50,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:50,596 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-11 00:33:50,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:50,597 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1096450289, now seen corresponding path program 1 times [2020-07-11 00:33:50,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:50,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [415501899] [2020-07-11 00:33:50,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:50,704 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 00:33:50,704 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 00:33:50,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:33:50,760 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 00:33:50,760 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:33:50,760 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:33:50,760 WARN L170 areAnnotationChecker]: ackermannENTRY has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:33:50,761 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: ackermannFINAL has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-11 00:33:50,762 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-11 00:33:50,763 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 00:33:50,765 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-11 00:33:50,765 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2020-07-11 00:33:50,766 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-11 00:33:50,766 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-11 00:33:50,766 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-11 00:33:50,766 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-11 00:33:50,766 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2020-07-11 00:33:50,766 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-11 00:33:50,766 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 00:33:50,767 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-11 00:33:50,767 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-11 00:33:50,767 WARN L170 areAnnotationChecker]: L21-6 has no Hoare annotation [2020-07-11 00:33:50,767 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 00:33:50,767 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 00:33:50,767 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-11 00:33:50,767 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-11 00:33:50,767 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-11 00:33:50,768 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-11 00:33:50,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:33:50 BoogieIcfgContainer [2020-07-11 00:33:50,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:33:50,777 INFO L168 Benchmark]: Toolchain (without parser) took 4597.25 ms. Allocated memory was 145.8 MB in the beginning and 273.2 MB in the end (delta: 127.4 MB). Free memory was 102.9 MB in the beginning and 235.7 MB in the end (delta: -132.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:33:50,785 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:33:50,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.13 ms. Allocated memory is still 145.8 MB. Free memory was 102.9 MB in the beginning and 93.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:50,789 INFO L168 Benchmark]: Boogie Preprocessor took 28.31 ms. Allocated memory is still 145.8 MB. Free memory was 93.2 MB in the beginning and 91.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:50,792 INFO L168 Benchmark]: RCFGBuilder took 504.67 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 91.5 MB in the beginning and 161.5 MB in the end (delta: -70.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:50,795 INFO L168 Benchmark]: TraceAbstraction took 3796.22 ms. Allocated memory was 203.9 MB in the beginning and 273.2 MB in the end (delta: 69.2 MB). Free memory was 160.5 MB in the beginning and 235.7 MB in the end (delta: -75.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:33:50,807 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.17 ms. Allocated memory is still 145.8 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 262.13 ms. Allocated memory is still 145.8 MB. Free memory was 102.9 MB in the beginning and 93.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.31 ms. Allocated memory is still 145.8 MB. Free memory was 93.2 MB in the beginning and 91.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 504.67 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 91.5 MB in the beginning and 161.5 MB in the end (delta: -70.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3796.22 ms. Allocated memory was 203.9 MB in the beginning and 273.2 MB in the end (delta: 69.2 MB). Free memory was 160.5 MB in the beginning and 235.7 MB in the end (delta: -75.2 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.6s, OverallIterations: 4, TraceHistogramMax: 5, AutomataDifference: 1.8s, 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.3s 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...