/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/recHanoi02-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:44:37,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:44:37,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:44:37,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:44:37,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:44:37,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:44:37,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:44:37,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:44:37,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:44:37,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:44:37,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:44:37,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:44:37,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:44:37,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:44:37,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:44:37,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:44:37,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:44:37,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:44:37,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:44:37,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:44:37,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:44:37,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:44:37,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:44:37,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:44:37,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:44:37,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:44:37,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:44:37,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:44:37,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:44:37,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:44:37,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:44:37,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:44:37,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:44:37,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:44:37,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:44:37,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:44:37,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:44:37,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:44:37,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:44:37,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:44:37,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:44:37,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:44:37,684 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:44:37,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:44:37,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:44:37,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:44:37,691 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:44:37,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:44:37,692 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:44:37,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:44:37,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:44:37,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:44:37,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:44:37,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:44:37,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:44:37,693 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:44:37,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:44:37,694 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:44:37,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:44:37,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:44:37,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:44:37,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:44:37,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:44:37,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:44:37,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:44:37,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:44:37,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:44:37,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:44:37,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:44:37,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:44:37,698 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:44:37,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:44:38,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:44:38,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:44:38,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:44:38,081 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:44:38,081 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:44:38,082 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/recHanoi02-2.c [2020-07-10 14:44:38,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a11e3a9/0d9a5d01693c4a92bc89d83ae50e4cb0/FLAG1274887e6 [2020-07-10 14:44:38,615 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:44:38,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/recHanoi02-2.c [2020-07-10 14:44:38,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a11e3a9/0d9a5d01693c4a92bc89d83ae50e4cb0/FLAG1274887e6 [2020-07-10 14:44:38,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a11e3a9/0d9a5d01693c4a92bc89d83ae50e4cb0 [2020-07-10 14:44:39,006 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:44:39,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:44:39,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:44:39,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:44:39,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:44:39,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:44:38" (1/1) ... [2020-07-10 14:44:39,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ba5ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39, skipping insertion in model container [2020-07-10 14:44:39,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:44:38" (1/1) ... [2020-07-10 14:44:39,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:44:39,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:44:39,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:44:39,201 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:44:39,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:44:39,234 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:44:39,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39 WrapperNode [2020-07-10 14:44:39,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:44:39,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:44:39,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:44:39,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:44:39,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (1/1) ... [2020-07-10 14:44:39,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (1/1) ... [2020-07-10 14:44:39,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (1/1) ... [2020-07-10 14:44:39,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (1/1) ... [2020-07-10 14:44:39,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (1/1) ... [2020-07-10 14:44:39,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (1/1) ... [2020-07-10 14:44:39,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (1/1) ... [2020-07-10 14:44:39,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:44:39,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:44:39,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:44:39,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:44:39,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:44:39,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:44:39,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:44:39,406 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2020-07-10 14:44:39,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:44:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:44:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:44:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2020-07-10 14:44:39,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:44:39,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:44:39,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:44:39,659 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:44:39,659 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:44:39,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:44:39 BoogieIcfgContainer [2020-07-10 14:44:39,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:44:39,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:44:39,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:44:39,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:44:39,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:44:38" (1/3) ... [2020-07-10 14:44:39,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258e25d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:44:39, skipping insertion in model container [2020-07-10 14:44:39,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:39" (2/3) ... [2020-07-10 14:44:39,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258e25d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:44:39, skipping insertion in model container [2020-07-10 14:44:39,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:44:39" (3/3) ... [2020-07-10 14:44:39,674 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi02-2.c [2020-07-10 14:44:39,690 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:44:39,697 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:44:39,717 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:44:39,747 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:44:39,748 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:44:39,748 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:44:39,748 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:44:39,748 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:44:39,748 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:44:39,748 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:44:39,749 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:44:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 14:44:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 14:44:39,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:39,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:39,801 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash 913793727, now seen corresponding path program 1 times [2020-07-10 14:44:39,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:39,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541667052] [2020-07-10 14:44:39,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:44:40,049 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:44:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~n := #in~n; {24#true} is VALID [2020-07-10 14:44:40,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume 1 == ~n;#res := 1; {34#(<= 1 |hanoi_#res|)} is VALID [2020-07-10 14:44:40,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(<= 1 |hanoi_#res|)} assume true; {34#(<= 1 |hanoi_#res|)} is VALID [2020-07-10 14:44:40,098 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#(<= 1 |hanoi_#res|)} {24#true} #34#return; {32#(<= 1 |main_#t~ret2|)} is VALID [2020-07-10 14:44:40,099 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 14:44:40,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:44:40,099 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:44:40,100 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-10 14:44:40,100 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2020-07-10 14:44:40,101 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !(~n~0 < 1 || ~n~0 > 31); {24#true} is VALID [2020-07-10 14:44:40,101 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#true} call #t~ret2 := hanoi(~n~0); {24#true} is VALID [2020-07-10 14:44:40,102 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} ~n := #in~n; {24#true} is VALID [2020-07-10 14:44:40,103 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#true} assume 1 == ~n;#res := 1; {34#(<= 1 |hanoi_#res|)} is VALID [2020-07-10 14:44:40,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {34#(<= 1 |hanoi_#res|)} assume true; {34#(<= 1 |hanoi_#res|)} is VALID [2020-07-10 14:44:40,107 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {34#(<= 1 |hanoi_#res|)} {24#true} #34#return; {32#(<= 1 |main_#t~ret2|)} is VALID [2020-07-10 14:44:40,109 INFO L280 TraceCheckUtils]: 11: Hoare triple {32#(<= 1 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {33#(<= 1 main_~result~0)} is VALID [2020-07-10 14:44:40,111 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#(<= 1 main_~result~0)} assume !(~result~0 >= 0); {25#false} is VALID [2020-07-10 14:44:40,111 INFO L280 TraceCheckUtils]: 13: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 14:44:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:44:40,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541667052] [2020-07-10 14:44:40,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:40,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:44:40,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956774299] [2020-07-10 14:44:40,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 14:44:40,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:40,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:44:40,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:40,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:44:40,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:40,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:44:40,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:44:40,189 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-10 14:44:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:40,413 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 14:44:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:44:40,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 14:44:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:44:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-10 14:44:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:44:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-10 14:44:40,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-10 14:44:40,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:40,562 INFO L225 Difference]: With dead ends: 33 [2020-07-10 14:44:40,562 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 14:44:40,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:44:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 14:44:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 14:44:40,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:40,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:40,630 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:40,631 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:40,636 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 14:44:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 14:44:40,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:40,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:40,637 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:40,637 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:40,641 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 14:44:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 14:44:40,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:40,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:40,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:40,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:44:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-10 14:44:40,647 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2020-07-10 14:44:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:40,648 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-10 14:44:40,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:44:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 14:44:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 14:44:40,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:40,650 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:40,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:44:40,650 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:40,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1998834103, now seen corresponding path program 1 times [2020-07-10 14:44:40,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:40,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123331275] [2020-07-10 14:44:40,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:44:40,730 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:44:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,834 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~n := #in~n; {141#true} is VALID [2020-07-10 14:44:40,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume 1 == ~n;#res := 1; {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:40,837 INFO L280 TraceCheckUtils]: 2: Hoare triple {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:40,839 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {141#true} #28#return; {161#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-10 14:44:40,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~n := #in~n; {141#true} is VALID [2020-07-10 14:44:40,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume !(1 == ~n); {141#true} is VALID [2020-07-10 14:44:40,841 INFO L263 TraceCheckUtils]: 2: Hoare triple {141#true} call #t~ret0 := hanoi(~n - 1); {141#true} is VALID [2020-07-10 14:44:40,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#true} ~n := #in~n; {141#true} is VALID [2020-07-10 14:44:40,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume 1 == ~n;#res := 1; {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:40,844 INFO L280 TraceCheckUtils]: 5: Hoare triple {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:40,846 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {141#true} #28#return; {161#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-10 14:44:40,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#(= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {162#(<= 3 |hanoi_#res|)} is VALID [2020-07-10 14:44:40,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {162#(<= 3 |hanoi_#res|)} assume true; {162#(<= 3 |hanoi_#res|)} is VALID [2020-07-10 14:44:40,850 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {162#(<= 3 |hanoi_#res|)} {141#true} #34#return; {155#(<= 3 |main_#t~ret2|)} is VALID [2020-07-10 14:44:40,852 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-10 14:44:40,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:44:40,853 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:44:40,853 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-10 14:44:40,854 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {141#true} is VALID [2020-07-10 14:44:40,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {141#true} assume !(~n~0 < 1 || ~n~0 > 31); {141#true} is VALID [2020-07-10 14:44:40,854 INFO L263 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret2 := hanoi(~n~0); {141#true} is VALID [2020-07-10 14:44:40,855 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} ~n := #in~n; {141#true} is VALID [2020-07-10 14:44:40,855 INFO L280 TraceCheckUtils]: 8: Hoare triple {141#true} assume !(1 == ~n); {141#true} is VALID [2020-07-10 14:44:40,856 INFO L263 TraceCheckUtils]: 9: Hoare triple {141#true} call #t~ret0 := hanoi(~n - 1); {141#true} is VALID [2020-07-10 14:44:40,856 INFO L280 TraceCheckUtils]: 10: Hoare triple {141#true} ~n := #in~n; {141#true} is VALID [2020-07-10 14:44:40,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {141#true} assume 1 == ~n;#res := 1; {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:40,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:40,862 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {163#(and (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {141#true} #28#return; {161#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-10 14:44:40,864 INFO L280 TraceCheckUtils]: 14: Hoare triple {161#(= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {162#(<= 3 |hanoi_#res|)} is VALID [2020-07-10 14:44:40,865 INFO L280 TraceCheckUtils]: 15: Hoare triple {162#(<= 3 |hanoi_#res|)} assume true; {162#(<= 3 |hanoi_#res|)} is VALID [2020-07-10 14:44:40,867 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {162#(<= 3 |hanoi_#res|)} {141#true} #34#return; {155#(<= 3 |main_#t~ret2|)} is VALID [2020-07-10 14:44:40,869 INFO L280 TraceCheckUtils]: 17: Hoare triple {155#(<= 3 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {156#(<= 3 main_~result~0)} is VALID [2020-07-10 14:44:40,870 INFO L280 TraceCheckUtils]: 18: Hoare triple {156#(<= 3 main_~result~0)} assume !(~result~0 >= 0); {142#false} is VALID [2020-07-10 14:44:40,871 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-10 14:44:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:44:40,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123331275] [2020-07-10 14:44:40,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752750464] [2020-07-10 14:44:40,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:44:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:44:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:40,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:44:41,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-10 14:44:41,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:44:41,135 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:44:41,135 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-10 14:44:41,136 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {141#true} is VALID [2020-07-10 14:44:41,136 INFO L280 TraceCheckUtils]: 5: Hoare triple {141#true} assume !(~n~0 < 1 || ~n~0 > 31); {141#true} is VALID [2020-07-10 14:44:41,138 INFO L263 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret2 := hanoi(~n~0); {141#true} is VALID [2020-07-10 14:44:41,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} ~n := #in~n; {141#true} is VALID [2020-07-10 14:44:41,139 INFO L280 TraceCheckUtils]: 8: Hoare triple {141#true} assume !(1 == ~n); {141#true} is VALID [2020-07-10 14:44:41,139 INFO L263 TraceCheckUtils]: 9: Hoare triple {141#true} call #t~ret0 := hanoi(~n - 1); {141#true} is VALID [2020-07-10 14:44:41,140 INFO L280 TraceCheckUtils]: 10: Hoare triple {141#true} ~n := #in~n; {141#true} is VALID [2020-07-10 14:44:41,141 INFO L280 TraceCheckUtils]: 11: Hoare triple {141#true} assume 1 == ~n;#res := 1; {200#(<= 1 |hanoi_#res|)} is VALID [2020-07-10 14:44:41,142 INFO L280 TraceCheckUtils]: 12: Hoare triple {200#(<= 1 |hanoi_#res|)} assume true; {200#(<= 1 |hanoi_#res|)} is VALID [2020-07-10 14:44:41,144 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {200#(<= 1 |hanoi_#res|)} {141#true} #28#return; {207#(<= 1 |hanoi_#t~ret0|)} is VALID [2020-07-10 14:44:41,146 INFO L280 TraceCheckUtils]: 14: Hoare triple {207#(<= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {162#(<= 3 |hanoi_#res|)} is VALID [2020-07-10 14:44:41,146 INFO L280 TraceCheckUtils]: 15: Hoare triple {162#(<= 3 |hanoi_#res|)} assume true; {162#(<= 3 |hanoi_#res|)} is VALID [2020-07-10 14:44:41,148 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {162#(<= 3 |hanoi_#res|)} {141#true} #34#return; {155#(<= 3 |main_#t~ret2|)} is VALID [2020-07-10 14:44:41,149 INFO L280 TraceCheckUtils]: 17: Hoare triple {155#(<= 3 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {156#(<= 3 main_~result~0)} is VALID [2020-07-10 14:44:41,150 INFO L280 TraceCheckUtils]: 18: Hoare triple {156#(<= 3 main_~result~0)} assume !(~result~0 >= 0); {142#false} is VALID [2020-07-10 14:44:41,150 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-10 14:44:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:44:41,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:44:41,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2020-07-10 14:44:41,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362048948] [2020-07-10 14:44:41,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 14:44:41,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:41,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:44:41,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:41,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:44:41,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:44:41,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:44:41,188 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 7 states. [2020-07-10 14:44:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:41,297 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 14:44:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:44:41,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 14:44:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:44:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-10 14:44:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:44:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-10 14:44:41,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2020-07-10 14:44:41,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:41,354 INFO L225 Difference]: With dead ends: 19 [2020-07-10 14:44:41,355 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:44:41,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:44:41,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:44:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:44:41,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:41,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:41,357 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:41,357 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:41,358 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:44:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:41,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:41,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:41,359 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:41,359 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:41,359 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:44:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:41,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:41,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:41,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:41,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:44:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:44:41,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2020-07-10 14:44:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:41,361 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:44:41,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:44:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:41,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:41,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 14:44:41,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:44:41,604 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:44:41,604 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:44:41,604 INFO L268 CegarLoopResult]: For program point hanoiEXIT(lines 18 23) no Hoare annotation was computed. [2020-07-10 14:44:41,605 INFO L271 CegarLoopResult]: At program point hanoiENTRY(lines 18 23) the Hoare annotation is: true [2020-07-10 14:44:41,605 INFO L268 CegarLoopResult]: For program point hanoiFINAL(lines 18 23) no Hoare annotation was computed. [2020-07-10 14:44:41,605 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-10 14:44:41,605 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-10 14:44:41,605 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-10 14:44:41,605 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:44:41,606 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:44:41,606 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:44:41,606 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:44:41,606 INFO L268 CegarLoopResult]: For program point L32(lines 32 36) no Hoare annotation was computed. [2020-07-10 14:44:41,606 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2020-07-10 14:44:41,607 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-10 14:44:41,607 INFO L268 CegarLoopResult]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-07-10 14:44:41,607 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 37) the Hoare annotation is: true [2020-07-10 14:44:41,607 INFO L268 CegarLoopResult]: For program point L28(lines 28 30) no Hoare annotation was computed. [2020-07-10 14:44:41,607 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 26 37) no Hoare annotation was computed. [2020-07-10 14:44:41,607 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 26 37) no Hoare annotation was computed. [2020-07-10 14:44:41,608 INFO L268 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-07-10 14:44:41,613 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:44:41,613 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:44:41,614 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:44:41,614 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:44:41,614 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:44:41,614 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 14:44:41,614 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:44:41,614 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:44:41,614 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 14:44:41,615 WARN L170 areAnnotationChecker]: hanoiFINAL has no Hoare annotation [2020-07-10 14:44:41,615 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 14:44:41,615 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:44:41,615 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:44:41,615 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 14:44:41,615 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2020-07-10 14:44:41,616 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2020-07-10 14:44:41,616 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 14:44:41,616 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:44:41,616 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 14:44:41,616 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 14:44:41,616 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 14:44:41,616 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 14:44:41,617 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 14:44:41,617 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:44:41,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:44:41 BoogieIcfgContainer [2020-07-10 14:44:41,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:44:41,623 INFO L168 Benchmark]: Toolchain (without parser) took 2614.37 ms. Allocated memory was 135.3 MB in the beginning and 226.0 MB in the end (delta: 90.7 MB). Free memory was 100.1 MB in the beginning and 144.4 MB in the end (delta: -44.3 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:41,624 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:44:41,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.25 ms. Allocated memory is still 135.3 MB. Free memory was 99.9 MB in the beginning and 90.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:41,626 INFO L168 Benchmark]: Boogie Preprocessor took 24.99 ms. Allocated memory is still 135.3 MB. Free memory was 90.3 MB in the beginning and 88.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:41,627 INFO L168 Benchmark]: RCFGBuilder took 404.01 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 88.9 MB in the beginning and 162.3 MB in the end (delta: -73.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:41,628 INFO L168 Benchmark]: TraceAbstraction took 1954.27 ms. Allocated memory was 198.7 MB in the beginning and 226.0 MB in the end (delta: 27.3 MB). Free memory was 161.6 MB in the beginning and 144.4 MB in the end (delta: 17.3 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:41,632 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.46 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 225.25 ms. Allocated memory is still 135.3 MB. Free memory was 99.9 MB in the beginning and 90.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.99 ms. Allocated memory is still 135.3 MB. Free memory was 90.3 MB in the beginning and 88.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 404.01 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 88.9 MB in the beginning and 162.3 MB in the end (delta: -73.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1954.27 ms. Allocated memory was 198.7 MB in the beginning and 226.0 MB in the end (delta: 27.3 MB). Free memory was 161.6 MB in the beginning and 144.4 MB in the end (delta: 17.3 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 SDtfs, 2 SDslu, 137 SDs, 0 SdLazy, 20 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 7 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 1679 SizeOfPredicates, 1 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...