/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/recHanoi03-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:44:43,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:44:43,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:44:43,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:44:43,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:44:43,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:44:43,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:44:43,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:44:43,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:44:43,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:44:43,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:44:43,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:44:43,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:44:43,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:44:43,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:44:43,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:44:43,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:44:43,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:44:43,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:44:43,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:44:43,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:44:43,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:44:43,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:44:43,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:44:43,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:44:43,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:44:43,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:44:43,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:44:43,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:44:43,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:44:43,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:44:43,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:44:43,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:44:43,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:44:43,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:44:43,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:44:43,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:44:43,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:44:43,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:44:43,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:44:43,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:44:43,957 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:43,973 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:44:43,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:44:43,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:44:43,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:44:43,975 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:44:43,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:44:43,976 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:44:43,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:44:43,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:44:43,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:44:43,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:44:43,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:44:43,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:44:43,977 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:44:43,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:44:43,978 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:44:43,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:44:43,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:44:43,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:44:43,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:44:43,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:44:43,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:44:43,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:44:43,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:44:43,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:44:43,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:44:43,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:44:43,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:44:43,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:44:43,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:44:44,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:44:44,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:44:44,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:44:44,313 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:44:44,313 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:44:44,314 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/recHanoi03-2.c [2020-07-10 14:44:44,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b7da273/2f62ab9559f543c5981f54c3befe4c1e/FLAGf9c112818 [2020-07-10 14:44:44,897 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:44:44,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/recHanoi03-2.c [2020-07-10 14:44:44,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b7da273/2f62ab9559f543c5981f54c3befe4c1e/FLAGf9c112818 [2020-07-10 14:44:45,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b7da273/2f62ab9559f543c5981f54c3befe4c1e [2020-07-10 14:44:45,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:44:45,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:44:45,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:44:45,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:44:45,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:44:45,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:44:45" (1/1) ... [2020-07-10 14:44:45,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb4b9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:45, skipping insertion in model container [2020-07-10 14:44:45,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:44:45" (1/1) ... [2020-07-10 14:44:45,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:44:45,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:44:45,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:44:45,473 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:44:45,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:44:45,505 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:44:45,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:45 WrapperNode [2020-07-10 14:44:45,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:44:45,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:44:45,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:44:45,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:44:45,521 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:45" (1/1) ... [2020-07-10 14:44:45,521 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:45" (1/1) ... [2020-07-10 14:44:45,530 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:45" (1/1) ... [2020-07-10 14:44:45,531 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:45" (1/1) ... [2020-07-10 14:44:45,535 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:45" (1/1) ... [2020-07-10 14:44:45,538 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:45" (1/1) ... [2020-07-10 14:44:45,539 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:45" (1/1) ... [2020-07-10 14:44:45,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:44:45,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:44:45,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:44:45,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:44:45,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:45" (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:45,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:44:45,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:44:45,689 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2020-07-10 14:44:45,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:44:45,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:44:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:44:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2020-07-10 14:44:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:44:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:44:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:44:45,912 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:44:45,912 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:44:45,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:44:45 BoogieIcfgContainer [2020-07-10 14:44:45,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:44:45,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:44:45,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:44:45,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:44:45,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:44:45" (1/3) ... [2020-07-10 14:44:45,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12945413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:44:45, skipping insertion in model container [2020-07-10 14:44:45,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:45" (2/3) ... [2020-07-10 14:44:45,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12945413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:44:45, skipping insertion in model container [2020-07-10 14:44:45,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:44:45" (3/3) ... [2020-07-10 14:44:45,925 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2020-07-10 14:44:45,937 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:44:45,945 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:44:45,960 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:44:45,992 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:44:45,992 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:44:45,993 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:44:45,993 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:44:45,993 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:44:45,993 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:44:45,994 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:44:45,994 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:44:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 14:44:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 14:44:46,026 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:46,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:46,028 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:46,036 INFO L82 PathProgramCache]: Analyzing trace with hash 913793727, now seen corresponding path program 1 times [2020-07-10 14:44:46,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:46,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751481574] [2020-07-10 14:44:46,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:46,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:44:46,303 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:44:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:46,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~n := #in~n; {34#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:46,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:46,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} assume true; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:46,371 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} {24#true} #34#return; {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} is VALID [2020-07-10 14:44:46,372 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 14:44:46,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:44:46,373 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:44:46,373 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-10 14:44:46,374 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:46,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !(~n~0 < 1 || ~n~0 > 31); {24#true} is VALID [2020-07-10 14:44:46,375 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#true} call #t~ret2 := hanoi(~n~0); {24#true} is VALID [2020-07-10 14:44:46,376 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} ~n := #in~n; {34#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:46,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:46,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} assume true; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:46,380 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} {24#true} #34#return; {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} is VALID [2020-07-10 14:44:46,382 INFO L280 TraceCheckUtils]: 11: Hoare triple {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {33#(and (= 1 main_~n~0) (<= 1 main_~result~0))} is VALID [2020-07-10 14:44:46,384 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#(and (= 1 main_~n~0) (<= 1 main_~result~0))} assume !(~result~0 >= ~n~0); {25#false} is VALID [2020-07-10 14:44:46,384 INFO L280 TraceCheckUtils]: 13: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 14:44:46,387 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:46,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751481574] [2020-07-10 14:44:46,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:46,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:44:46,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102587511] [2020-07-10 14:44:46,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 14:44:46,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:46,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:44:46,439 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:46,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:44:46,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:46,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:44:46,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:44:46,452 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 6 states. [2020-07-10 14:44:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:46,810 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 14:44:46,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:44:46,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 14:44:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-10 14:44:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-10 14:44:46,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-10 14:44:46,900 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:46,921 INFO L225 Difference]: With dead ends: 33 [2020-07-10 14:44:46,921 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 14:44:46,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:44:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 14:44:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 14:44:46,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:46,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:46,986 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:46,986 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:46,991 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 14:44:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 14:44:46,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:46,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:46,993 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:46,993 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:44:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:46,997 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 14:44:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 14:44:46,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:46,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:46,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:46,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:44:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-10 14:44:47,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2020-07-10 14:44:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:47,003 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-10 14:44:47,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:44:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 14:44:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 14:44:47,005 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:47,005 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:47,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:44:47,006 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1998834103, now seen corresponding path program 1 times [2020-07-10 14:44:47,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:47,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051743401] [2020-07-10 14:44:47,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:47,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-10 14:44:47,092 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-10 14:44:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:47,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:47,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:47,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:47,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:47,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:47,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:47,230 INFO L263 TraceCheckUtils]: 2: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-10 14:44:47,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:47,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:47,233 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:47,234 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:47,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-10 14:44:47,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} assume true; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-10 14:44:47,237 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} {144#true} #34#return; {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} is VALID [2020-07-10 14:44:47,238 INFO L263 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2020-07-10 14:44:47,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-10 14:44:47,239 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-10 14:44:47,239 INFO L263 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret3 := main(); {144#true} is VALID [2020-07-10 14:44:47,240 INFO L280 TraceCheckUtils]: 4: Hoare triple {144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {144#true} is VALID [2020-07-10 14:44:47,240 INFO L280 TraceCheckUtils]: 5: Hoare triple {144#true} assume !(~n~0 < 1 || ~n~0 > 31); {144#true} is VALID [2020-07-10 14:44:47,240 INFO L263 TraceCheckUtils]: 6: Hoare triple {144#true} call #t~ret2 := hanoi(~n~0); {144#true} is VALID [2020-07-10 14:44:47,241 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:47,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:47,242 INFO L263 TraceCheckUtils]: 9: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-10 14:44:47,243 INFO L280 TraceCheckUtils]: 10: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:47,244 INFO L280 TraceCheckUtils]: 11: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:47,244 INFO L280 TraceCheckUtils]: 12: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:47,246 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:47,247 INFO L280 TraceCheckUtils]: 14: Hoare triple {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-10 14:44:47,248 INFO L280 TraceCheckUtils]: 15: Hoare triple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} assume true; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-10 14:44:47,250 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} {144#true} #34#return; {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} is VALID [2020-07-10 14:44:47,251 INFO L280 TraceCheckUtils]: 17: Hoare triple {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {159#(<= (+ main_~n~0 1) main_~result~0)} is VALID [2020-07-10 14:44:47,252 INFO L280 TraceCheckUtils]: 18: Hoare triple {159#(<= (+ main_~n~0 1) main_~result~0)} assume !(~result~0 >= ~n~0); {145#false} is VALID [2020-07-10 14:44:47,253 INFO L280 TraceCheckUtils]: 19: Hoare triple {145#false} assume !false; {145#false} is VALID [2020-07-10 14:44:47,254 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:47,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051743401] [2020-07-10 14:44:47,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854743465] [2020-07-10 14:44:47,255 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:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:47,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-10 14:44:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:47,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:44:47,655 INFO L263 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2020-07-10 14:44:47,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-10 14:44:47,656 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-10 14:44:47,656 INFO L263 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret3 := main(); {144#true} is VALID [2020-07-10 14:44:47,657 INFO L280 TraceCheckUtils]: 4: Hoare triple {144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {144#true} is VALID [2020-07-10 14:44:47,657 INFO L280 TraceCheckUtils]: 5: Hoare triple {144#true} assume !(~n~0 < 1 || ~n~0 > 31); {144#true} is VALID [2020-07-10 14:44:47,657 INFO L263 TraceCheckUtils]: 6: Hoare triple {144#true} call #t~ret2 := hanoi(~n~0); {144#true} is VALID [2020-07-10 14:44:47,658 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#true} ~n := #in~n; {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-10 14:44:47,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-10 14:44:47,659 INFO L263 TraceCheckUtils]: 9: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-10 14:44:47,660 INFO L280 TraceCheckUtils]: 10: Hoare triple {144#true} ~n := #in~n; {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-10 14:44:47,661 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-10 14:44:47,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-10 14:44:47,664 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {192#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {212#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:47,665 INFO L280 TraceCheckUtils]: 14: Hoare triple {212#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-10 14:44:47,666 INFO L280 TraceCheckUtils]: 15: Hoare triple {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} assume true; {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-10 14:44:47,668 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} {144#true} #34#return; {223#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| |main_#t~ret2|))) (<= main_~n~0 2))} is VALID [2020-07-10 14:44:47,669 INFO L280 TraceCheckUtils]: 17: Hoare triple {223#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| |main_#t~ret2|))) (<= main_~n~0 2))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {227#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| main_~result~0))) (<= main_~n~0 2))} is VALID [2020-07-10 14:44:47,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {227#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| main_~result~0))) (<= main_~n~0 2))} assume !(~result~0 >= ~n~0); {145#false} is VALID [2020-07-10 14:44:47,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {145#false} assume !false; {145#false} is VALID [2020-07-10 14:44:47,673 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:47,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:44:47,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-10 14:44:47,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665304602] [2020-07-10 14:44:47,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2020-07-10 14:44:47,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:47,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 14:44:47,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:47,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 14:44:47,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 14:44:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-10 14:44:47,725 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 14 states. [2020-07-10 14:44:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:48,193 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-10 14:44:48,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:44:48,193 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2020-07-10 14:44:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:44:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2020-07-10 14:44:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:44:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2020-07-10 14:44:48,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2020-07-10 14:44:48,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:48,249 INFO L225 Difference]: With dead ends: 26 [2020-07-10 14:44:48,250 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 14:44:48,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-07-10 14:44:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 14:44:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-10 14:44:48,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:48,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-10 14:44:48,260 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 14:44:48,260 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 14:44:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:48,263 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 14:44:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 14:44:48,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:48,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:48,264 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 14:44:48,265 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 14:44:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:48,268 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 14:44:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 14:44:48,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:48,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:48,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:48,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 14:44:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-10 14:44:48,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2020-07-10 14:44:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:48,272 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-10 14:44:48,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 14:44:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 14:44:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:44:48,273 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:48,274 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:48,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 14:44:48,489 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:48,490 INFO L82 PathProgramCache]: Analyzing trace with hash 293522751, now seen corresponding path program 2 times [2020-07-10 14:44:48,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:48,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470845132] [2020-07-10 14:44:48,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:48,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-10 14:44:48,564 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-10 14:44:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:48,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,729 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:48,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,731 INFO L263 TraceCheckUtils]: 2: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-10 14:44:48,732 INFO L280 TraceCheckUtils]: 3: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,733 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,734 INFO L280 TraceCheckUtils]: 5: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,735 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:48,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,739 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:48,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,741 INFO L263 TraceCheckUtils]: 2: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-10 14:44:48,742 INFO L280 TraceCheckUtils]: 3: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,742 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,743 INFO L263 TraceCheckUtils]: 5: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-10 14:44:48,743 INFO L280 TraceCheckUtils]: 6: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,747 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:48,748 INFO L280 TraceCheckUtils]: 10: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,749 INFO L280 TraceCheckUtils]: 11: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,750 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:48,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-10 14:44:48,752 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} assume true; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-10 14:44:48,754 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} {345#true} #34#return; {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} is VALID [2020-07-10 14:44:48,755 INFO L263 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2020-07-10 14:44:48,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-10 14:44:48,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-10 14:44:48,756 INFO L263 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret3 := main(); {345#true} is VALID [2020-07-10 14:44:48,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {345#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {345#true} is VALID [2020-07-10 14:44:48,756 INFO L280 TraceCheckUtils]: 5: Hoare triple {345#true} assume !(~n~0 < 1 || ~n~0 > 31); {345#true} is VALID [2020-07-10 14:44:48,756 INFO L263 TraceCheckUtils]: 6: Hoare triple {345#true} call #t~ret2 := hanoi(~n~0); {345#true} is VALID [2020-07-10 14:44:48,757 INFO L280 TraceCheckUtils]: 7: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,758 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,758 INFO L263 TraceCheckUtils]: 9: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-10 14:44:48,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,760 INFO L280 TraceCheckUtils]: 11: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,760 INFO L263 TraceCheckUtils]: 12: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-10 14:44:48,761 INFO L280 TraceCheckUtils]: 13: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:48,762 INFO L280 TraceCheckUtils]: 14: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,763 INFO L280 TraceCheckUtils]: 15: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,764 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:48,765 INFO L280 TraceCheckUtils]: 17: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,766 INFO L280 TraceCheckUtils]: 18: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:48,782 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:48,787 INFO L280 TraceCheckUtils]: 20: Hoare triple {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-10 14:44:48,788 INFO L280 TraceCheckUtils]: 21: Hoare triple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} assume true; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-10 14:44:48,789 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} {345#true} #34#return; {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} is VALID [2020-07-10 14:44:48,790 INFO L280 TraceCheckUtils]: 23: Hoare triple {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {366#(<= (+ main_~n~0 4) main_~result~0)} is VALID [2020-07-10 14:44:48,791 INFO L280 TraceCheckUtils]: 24: Hoare triple {366#(<= (+ main_~n~0 4) main_~result~0)} assume !(~result~0 >= ~n~0); {346#false} is VALID [2020-07-10 14:44:48,791 INFO L280 TraceCheckUtils]: 25: Hoare triple {346#false} assume !false; {346#false} is VALID [2020-07-10 14:44:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:44:48,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470845132] [2020-07-10 14:44:48,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933242966] [2020-07-10 14:44:48,793 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-10 14:44:48,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:44:48,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:44:48,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:44:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:48,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:44:51,420 INFO L263 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2020-07-10 14:44:51,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-10 14:44:51,421 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-10 14:44:51,422 INFO L263 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret3 := main(); {345#true} is VALID [2020-07-10 14:44:51,422 INFO L280 TraceCheckUtils]: 4: Hoare triple {345#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {345#true} is VALID [2020-07-10 14:44:51,422 INFO L280 TraceCheckUtils]: 5: Hoare triple {345#true} assume !(~n~0 < 1 || ~n~0 > 31); {345#true} is VALID [2020-07-10 14:44:51,423 INFO L263 TraceCheckUtils]: 6: Hoare triple {345#true} call #t~ret2 := hanoi(~n~0); {345#true} is VALID [2020-07-10 14:44:51,423 INFO L280 TraceCheckUtils]: 7: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-10 14:44:51,424 INFO L280 TraceCheckUtils]: 8: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-10 14:44:51,424 INFO L263 TraceCheckUtils]: 9: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-10 14:44:51,425 INFO L280 TraceCheckUtils]: 10: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-10 14:44:51,425 INFO L280 TraceCheckUtils]: 11: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-10 14:44:51,425 INFO L263 TraceCheckUtils]: 12: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-10 14:44:51,426 INFO L280 TraceCheckUtils]: 13: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-10 14:44:51,426 INFO L280 TraceCheckUtils]: 14: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-10 14:44:51,427 INFO L280 TraceCheckUtils]: 15: Hoare triple {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-10 14:44:51,428 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {411#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {440#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:51,429 INFO L280 TraceCheckUtils]: 17: Hoare triple {440#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-10 14:44:51,430 INFO L280 TraceCheckUtils]: 18: Hoare triple {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} assume true; {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-10 14:44:51,435 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} {411#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {451#(and (<= |hanoi_#in~n| 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} is VALID [2020-07-10 14:44:51,443 INFO L280 TraceCheckUtils]: 20: Hoare triple {451#(and (<= |hanoi_#in~n| 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} is VALID [2020-07-10 14:44:51,444 INFO L280 TraceCheckUtils]: 21: Hoare triple {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} assume true; {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} is VALID [2020-07-10 14:44:51,447 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} {345#true} #34#return; {462#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_5| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))) (<= main_~n~0 3))} is VALID [2020-07-10 14:44:51,451 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_5| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))) (<= main_~n~0 3))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {466#(and (<= main_~n~0 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_5| main_~result~0) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} is VALID [2020-07-10 14:44:51,453 INFO L280 TraceCheckUtils]: 24: Hoare triple {466#(and (<= main_~n~0 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_5| main_~result~0) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} assume !(~result~0 >= ~n~0); {346#false} is VALID [2020-07-10 14:44:51,453 INFO L280 TraceCheckUtils]: 25: Hoare triple {346#false} assume !false; {346#false} is VALID [2020-07-10 14:44:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:44:51,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:44:51,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-07-10 14:44:51,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910337981] [2020-07-10 14:44:51,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-10 14:44:51,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:51,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 14:44:51,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:51,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 14:44:51,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 14:44:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=263, Unknown=1, NotChecked=0, Total=306 [2020-07-10 14:44:51,549 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 18 states. [2020-07-10 14:44:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:52,359 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-10 14:44:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 14:44:52,359 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-10 14:44:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 14:44:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2020-07-10 14:44:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 14:44:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2020-07-10 14:44:52,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 36 transitions. [2020-07-10 14:44:52,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:52,437 INFO L225 Difference]: With dead ends: 34 [2020-07-10 14:44:52,437 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 14:44:52,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=85, Invalid=514, Unknown=1, NotChecked=0, Total=600 [2020-07-10 14:44:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 14:44:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 14:44:52,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:52,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 14:44:52,451 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 14:44:52,451 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 14:44:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:52,455 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 14:44:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 14:44:52,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:52,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:52,456 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 14:44:52,456 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 14:44:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:52,459 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 14:44:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 14:44:52,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:52,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:52,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:52,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 14:44:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-10 14:44:52,463 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2020-07-10 14:44:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:52,464 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-10 14:44:52,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 14:44:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 14:44:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 14:44:52,466 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:52,466 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:52,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:44:52,682 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1152432193, now seen corresponding path program 3 times [2020-07-10 14:44:52,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:52,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605720264] [2020-07-10 14:44:52,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:52,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-10 14:44:52,787 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-10 14:44:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:53,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,101 INFO L280 TraceCheckUtils]: 2: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,103 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,105 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,106 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,107 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,110 INFO L280 TraceCheckUtils]: 5: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,112 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,113 INFO L280 TraceCheckUtils]: 7: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,113 INFO L280 TraceCheckUtils]: 8: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,115 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,118 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,119 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,120 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,120 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,121 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,122 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,123 INFO L280 TraceCheckUtils]: 8: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,125 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,126 INFO L280 TraceCheckUtils]: 10: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,127 INFO L280 TraceCheckUtils]: 11: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,130 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,132 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,132 INFO L280 TraceCheckUtils]: 14: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,134 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,137 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,139 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,140 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,141 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,141 INFO L263 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,144 INFO L280 TraceCheckUtils]: 10: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,150 INFO L280 TraceCheckUtils]: 11: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,152 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,153 INFO L280 TraceCheckUtils]: 13: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,156 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,158 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,159 INFO L280 TraceCheckUtils]: 17: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,161 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,163 INFO L280 TraceCheckUtils]: 19: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,164 INFO L280 TraceCheckUtils]: 20: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,166 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,170 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,171 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,172 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,172 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,173 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,174 INFO L263 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,175 INFO L280 TraceCheckUtils]: 9: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,176 INFO L280 TraceCheckUtils]: 10: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,176 INFO L263 TraceCheckUtils]: 11: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,177 INFO L280 TraceCheckUtils]: 12: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,178 INFO L280 TraceCheckUtils]: 13: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,179 INFO L280 TraceCheckUtils]: 14: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,181 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,183 INFO L280 TraceCheckUtils]: 16: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,183 INFO L280 TraceCheckUtils]: 17: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,185 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,187 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,187 INFO L280 TraceCheckUtils]: 20: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,190 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,192 INFO L280 TraceCheckUtils]: 23: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,194 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,196 INFO L280 TraceCheckUtils]: 25: Hoare triple {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-10 14:44:53,197 INFO L280 TraceCheckUtils]: 26: Hoare triple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} assume true; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-10 14:44:53,199 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} {618#true} #34#return; {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} is VALID [2020-07-10 14:44:53,201 INFO L263 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2020-07-10 14:44:53,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-10 14:44:53,202 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-10 14:44:53,202 INFO L263 TraceCheckUtils]: 3: Hoare triple {618#true} call #t~ret3 := main(); {618#true} is VALID [2020-07-10 14:44:53,203 INFO L280 TraceCheckUtils]: 4: Hoare triple {618#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {618#true} is VALID [2020-07-10 14:44:53,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#true} assume !(~n~0 < 1 || ~n~0 > 31); {618#true} is VALID [2020-07-10 14:44:53,203 INFO L263 TraceCheckUtils]: 6: Hoare triple {618#true} call #t~ret2 := hanoi(~n~0); {618#true} is VALID [2020-07-10 14:44:53,204 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,206 INFO L263 TraceCheckUtils]: 9: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,207 INFO L280 TraceCheckUtils]: 11: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,207 INFO L263 TraceCheckUtils]: 12: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,208 INFO L280 TraceCheckUtils]: 13: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,209 INFO L280 TraceCheckUtils]: 14: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,209 INFO L263 TraceCheckUtils]: 15: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,210 INFO L280 TraceCheckUtils]: 16: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,210 INFO L280 TraceCheckUtils]: 17: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,211 INFO L263 TraceCheckUtils]: 18: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:44:53,212 INFO L280 TraceCheckUtils]: 19: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-10 14:44:53,213 INFO L280 TraceCheckUtils]: 20: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,214 INFO L280 TraceCheckUtils]: 21: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,216 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,217 INFO L280 TraceCheckUtils]: 23: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,218 INFO L280 TraceCheckUtils]: 24: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,220 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,221 INFO L280 TraceCheckUtils]: 26: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,222 INFO L280 TraceCheckUtils]: 27: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,223 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,225 INFO L280 TraceCheckUtils]: 29: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,226 INFO L280 TraceCheckUtils]: 30: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-10 14:44:53,227 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-10 14:44:53,228 INFO L280 TraceCheckUtils]: 32: Hoare triple {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-10 14:44:53,229 INFO L280 TraceCheckUtils]: 33: Hoare triple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} assume true; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-10 14:44:53,230 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} {618#true} #34#return; {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} is VALID [2020-07-10 14:44:53,231 INFO L280 TraceCheckUtils]: 35: Hoare triple {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {651#(<= (+ main_~n~0 26) main_~result~0)} is VALID [2020-07-10 14:44:53,232 INFO L280 TraceCheckUtils]: 36: Hoare triple {651#(<= (+ main_~n~0 26) main_~result~0)} assume !(~result~0 >= ~n~0); {619#false} is VALID [2020-07-10 14:44:53,233 INFO L280 TraceCheckUtils]: 37: Hoare triple {619#false} assume !false; {619#false} is VALID [2020-07-10 14:44:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-10 14:44:53,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605720264] [2020-07-10 14:44:53,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499672045] [2020-07-10 14:44:53,236 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:44:53,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-10 14:44:53,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:44:53,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-10 14:44:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:53,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:45:16,641 INFO L263 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2020-07-10 14:45:16,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-10 14:45:16,641 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-10 14:45:16,642 INFO L263 TraceCheckUtils]: 3: Hoare triple {618#true} call #t~ret3 := main(); {618#true} is VALID [2020-07-10 14:45:16,642 INFO L280 TraceCheckUtils]: 4: Hoare triple {618#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {618#true} is VALID [2020-07-10 14:45:16,644 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#true} assume !(~n~0 < 1 || ~n~0 > 31); {732#(<= main_~n~0 31)} is VALID [2020-07-10 14:45:16,645 INFO L263 TraceCheckUtils]: 6: Hoare triple {732#(<= main_~n~0 31)} call #t~ret2 := hanoi(~n~0); {618#true} is VALID [2020-07-10 14:45:16,645 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-10 14:45:16,645 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-10 14:45:16,645 INFO L263 TraceCheckUtils]: 9: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:45:16,646 INFO L280 TraceCheckUtils]: 10: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-10 14:45:16,646 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-10 14:45:16,646 INFO L263 TraceCheckUtils]: 12: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:45:16,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-10 14:45:16,647 INFO L280 TraceCheckUtils]: 14: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-10 14:45:16,647 INFO L263 TraceCheckUtils]: 15: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:45:16,647 INFO L280 TraceCheckUtils]: 16: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-10 14:45:16,647 INFO L280 TraceCheckUtils]: 17: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-10 14:45:16,647 INFO L263 TraceCheckUtils]: 18: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-10 14:45:16,648 INFO L280 TraceCheckUtils]: 19: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-10 14:45:16,655 INFO L280 TraceCheckUtils]: 20: Hoare triple {618#true} assume 1 == ~n;#res := 1; {778#(<= 1 |hanoi_#res|)} is VALID [2020-07-10 14:45:16,655 INFO L280 TraceCheckUtils]: 21: Hoare triple {778#(<= 1 |hanoi_#res|)} assume true; {778#(<= 1 |hanoi_#res|)} is VALID [2020-07-10 14:45:16,656 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {778#(<= 1 |hanoi_#res|)} {618#true} #28#return; {785#(<= 1 |hanoi_#t~ret0|)} is VALID [2020-07-10 14:45:16,658 INFO L280 TraceCheckUtils]: 23: Hoare triple {785#(<= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} is VALID [2020-07-10 14:45:16,658 INFO L280 TraceCheckUtils]: 24: Hoare triple {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} assume true; {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} is VALID [2020-07-10 14:45:16,660 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} {618#true} #28#return; {796#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,663 INFO L280 TraceCheckUtils]: 26: Hoare triple {796#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,664 INFO L280 TraceCheckUtils]: 27: Hoare triple {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume true; {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,667 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} {618#true} #28#return; {807#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,670 INFO L280 TraceCheckUtils]: 29: Hoare triple {807#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,671 INFO L280 TraceCheckUtils]: 30: Hoare triple {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume true; {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,705 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} {618#true} #28#return; {818#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,710 INFO L280 TraceCheckUtils]: 32: Hoare triple {818#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,711 INFO L280 TraceCheckUtils]: 33: Hoare triple {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} assume true; {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-10 14:45:16,729 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} {732#(<= main_~n~0 31)} #34#return; {829#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} is VALID [2020-07-10 14:45:16,731 INFO L280 TraceCheckUtils]: 35: Hoare triple {829#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {833#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| main_~result~0) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} is VALID [2020-07-10 14:45:16,732 INFO L280 TraceCheckUtils]: 36: Hoare triple {833#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| main_~result~0) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} assume !(~result~0 >= ~n~0); {619#false} is VALID [2020-07-10 14:45:16,732 INFO L280 TraceCheckUtils]: 37: Hoare triple {619#false} assume !false; {619#false} is VALID [2020-07-10 14:45:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-10 14:45:16,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:45:16,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2020-07-10 14:45:16,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503561701] [2020-07-10 14:45:16,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-10 14:45:16,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:45:16,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 14:45:20,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:45:20,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 14:45:20,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:45:20,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 14:45:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=571, Unknown=10, NotChecked=0, Total=650 [2020-07-10 14:45:20,376 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2020-07-10 14:45:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:45:49,687 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 14:45:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 14:45:49,687 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-10 14:45:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:45:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:45:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2020-07-10 14:45:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:45:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2020-07-10 14:45:49,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 29 transitions. [2020-07-10 14:45:54,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 27 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-10 14:45:54,105 INFO L225 Difference]: With dead ends: 28 [2020-07-10 14:45:54,105 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:45:54,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=69, Invalid=571, Unknown=10, NotChecked=0, Total=650 [2020-07-10 14:45:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:45:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:45:54,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:45:54,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:45:54,107 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:45:54,107 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:45:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:45:54,108 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:45:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:45:54,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:45:54,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:45:54,108 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:45:54,108 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:45:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:45:54,109 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:45:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:45:54,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:45:54,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:45:54,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:45:54,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:45:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:45:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:45:54,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-10 14:45:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:45:54,110 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:45:54,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 14:45:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:45:54,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:45:54,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:45:54,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:45:54,354 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:45:54,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:45:54,354 INFO L268 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-07-10 14:45:54,354 INFO L268 CegarLoopResult]: For program point hanoiEXIT(lines 16 21) no Hoare annotation was computed. [2020-07-10 14:45:54,354 INFO L271 CegarLoopResult]: At program point hanoiENTRY(lines 16 21) the Hoare annotation is: true [2020-07-10 14:45:54,354 INFO L268 CegarLoopResult]: For program point hanoiFINAL(lines 16 21) no Hoare annotation was computed. [2020-07-10 14:45:54,355 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (= hanoi_~n |hanoi_#in~n|) [2020-07-10 14:45:54,355 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-10 14:45:54,355 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:45:54,355 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:45:54,355 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:45:54,355 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:45:54,355 INFO L268 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-07-10 14:45:54,355 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 33) no Hoare annotation was computed. [2020-07-10 14:45:54,355 INFO L268 CegarLoopResult]: For program point L30(lines 30 34) no Hoare annotation was computed. [2020-07-10 14:45:54,355 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 24 35) the Hoare annotation is: true [2020-07-10 14:45:54,356 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (<= main_~n~0 31) [2020-07-10 14:45:54,356 INFO L268 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-07-10 14:45:54,356 INFO L268 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-07-10 14:45:54,356 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 24 35) no Hoare annotation was computed. [2020-07-10 14:45:54,356 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 24 35) no Hoare annotation was computed. [2020-07-10 14:45:54,360 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:45:54,360 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:45:54,360 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: hanoiFINAL has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:45:54,361 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:45:54,362 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:45:54,362 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:45:54,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:45:54 BoogieIcfgContainer [2020-07-10 14:45:54,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:45:54,377 INFO L168 Benchmark]: Toolchain (without parser) took 69093.15 ms. Allocated memory was 137.4 MB in the beginning and 284.2 MB in the end (delta: 146.8 MB). Free memory was 101.0 MB in the beginning and 113.8 MB in the end (delta: -12.8 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:45:54,378 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 137.4 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:45:54,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.02 ms. Allocated memory is still 137.4 MB. Free memory was 100.6 MB in the beginning and 91.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:45:54,379 INFO L168 Benchmark]: Boogie Preprocessor took 33.78 ms. Allocated memory is still 137.4 MB. Free memory was 91.1 MB in the beginning and 89.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:45:54,381 INFO L168 Benchmark]: RCFGBuilder took 375.57 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 89.5 MB in the beginning and 164.4 MB in the end (delta: -75.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:45:54,383 INFO L168 Benchmark]: TraceAbstraction took 68447.98 ms. Allocated memory was 200.3 MB in the beginning and 284.2 MB in the end (delta: 83.9 MB). Free memory was 163.5 MB in the beginning and 113.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 133.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:45:54,389 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 1.48 ms. Allocated memory is still 137.4 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.02 ms. Allocated memory is still 137.4 MB. Free memory was 100.6 MB in the beginning and 91.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.78 ms. Allocated memory is still 137.4 MB. Free memory was 91.1 MB in the beginning and 89.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 375.57 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 89.5 MB in the beginning and 164.4 MB in the end (delta: -75.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68447.98 ms. Allocated memory was 200.3 MB in the beginning and 284.2 MB in the end (delta: 83.9 MB). Free memory was 163.5 MB in the beginning and 113.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 133.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: 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: 68.3s, OverallIterations: 4, TraceHistogramMax: 5, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 68 SDtfs, 19 SDslu, 365 SDs, 0 SdLazy, 298 SolverSat, 7 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 11 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 18 QuantifiedInterpolants, 27252 SizeOfPredicates, 11 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 96/140 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...