/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:06:56,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:06:56,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:06:56,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:06:56,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:06:56,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:06:56,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:06:56,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:06:56,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:06:56,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:06:56,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:06:56,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:06:56,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:06:56,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:06:56,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:06:56,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:06:56,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:06:56,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:06:56,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:06:56,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:06:56,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:06:56,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:06:56,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:06:56,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:06:56,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:06:56,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:06:56,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:06:56,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:06:56,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:06:56,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:06:56,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:06:56,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:06:56,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:06:56,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:06:56,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:06:56,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:06:56,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:06:56,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:06:56,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:06:56,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:06:56,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:06:56,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:06:56,733 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:06:56,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:06:56,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:06:56,738 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:06:56,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:06:56,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:06:56,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:06:56,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:06:56,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:06:56,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:06:56,740 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:06:56,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:06:56,740 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:06:56,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:06:56,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:06:56,741 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:06:56,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:06:56,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:06:56,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:06:56,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:06:56,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:06:56,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:06:56,746 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:06:57,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:06:57,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:06:57,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:06:57,119 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:06:57,120 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:06:57,120 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-08 22:06:57,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd8d2592/69d6d2e8ad1845ab8beefafa504b7ec7/FLAGbc18575b5 [2020-07-08 22:06:57,686 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:06:57,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-08 22:06:57,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd8d2592/69d6d2e8ad1845ab8beefafa504b7ec7/FLAGbc18575b5 [2020-07-08 22:06:58,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd8d2592/69d6d2e8ad1845ab8beefafa504b7ec7 [2020-07-08 22:06:58,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:06:58,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:06:58,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:06:58,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:06:58,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:06:58,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14598266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58, skipping insertion in model container [2020-07-08 22:06:58,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:06:58,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:06:58,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:06:58,361 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:06:58,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:06:58,402 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:06:58,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58 WrapperNode [2020-07-08 22:06:58,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:06:58,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:06:58,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:06:58,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:06:58,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (1/1) ... [2020-07-08 22:06:58,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:06:58,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:06:58,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:06:58,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:06:58,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:06:58,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:06:58,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:06:58,586 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-08 22:06:58,586 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-08 22:06:58,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:06:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:06:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:06:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-08 22:06:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-08 22:06:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:06:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:06:58,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:06:58,992 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:06:58,992 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:06:58,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:06:58 BoogieIcfgContainer [2020-07-08 22:06:58,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:06:58,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:06:58,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:06:59,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:06:59,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:06:58" (1/3) ... [2020-07-08 22:06:59,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecea165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:06:59, skipping insertion in model container [2020-07-08 22:06:59,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:06:58" (2/3) ... [2020-07-08 22:06:59,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecea165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:06:59, skipping insertion in model container [2020-07-08 22:06:59,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:06:58" (3/3) ... [2020-07-08 22:06:59,005 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2020-07-08 22:06:59,016 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:06:59,024 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:06:59,036 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:06:59,056 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:06:59,056 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:06:59,057 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:06:59,057 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:06:59,057 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:06:59,057 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:06:59,058 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:06:59,058 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:06:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-08 22:06:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 22:06:59,082 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:06:59,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:06:59,085 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:06:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:06:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -588914908, now seen corresponding path program 1 times [2020-07-08 22:06:59,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:06:59,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [926257946] [2020-07-08 22:06:59,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:06:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:06:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:06:59,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 22:06:59,284 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-08 22:06:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:06:59,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:06:59,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:06:59,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:06:59,344 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:06:59,346 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-08 22:06:59,347 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2020-07-08 22:06:59,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 22:06:59,348 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-08 22:06:59,348 INFO L263 TraceCheckUtils]: 3: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2020-07-08 22:06:59,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#true} ~input~0 := 5; {41#(<= 5 main_~input~0)} is VALID [2020-07-08 22:06:59,350 INFO L263 TraceCheckUtils]: 5: Hoare triple {41#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {37#true} is VALID [2020-07-08 22:06:59,351 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:06:59,352 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:06:59,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:06:59,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:06:59,357 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-08 22:06:59,357 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {38#false} is VALID [2020-07-08 22:06:59,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} ~result~0 := #t~ret2; {38#false} is VALID [2020-07-08 22:06:59,358 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} havoc #t~ret2; {38#false} is VALID [2020-07-08 22:06:59,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} assume 5 == ~result~0; {38#false} is VALID [2020-07-08 22:06:59,359 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-08 22:06:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:06:59,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [926257946] [2020-07-08 22:06:59,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:06:59,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:06:59,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792245250] [2020-07-08 22:06:59,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 22:06:59,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:06:59,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:06:59,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:06:59,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:06:59,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:06:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:06:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:06:59,427 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-07-08 22:06:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:06:59,722 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-08 22:06:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:06:59,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 22:06:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:06:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:06:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-08 22:06:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:06:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-08 22:06:59,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-08 22:06:59,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:06:59,847 INFO L225 Difference]: With dead ends: 46 [2020-07-08 22:06:59,848 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 22:06:59,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:06:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 22:06:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-08 22:06:59,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:06:59,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-08 22:06:59,971 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 22:06:59,971 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 22:06:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:06:59,982 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-08 22:06:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 22:06:59,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:06:59,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:06:59,984 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 22:06:59,984 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 22:06:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:06:59,990 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-08 22:06:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 22:06:59,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:06:59,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:06:59,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:06:59,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:06:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 22:06:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-08 22:07:00,001 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2020-07-08 22:07:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:00,001 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-08 22:07:00,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:07:00,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-08 22:07:00,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 22:07:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 22:07:00,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:00,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:07:00,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:07:00,059 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:00,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809946, now seen corresponding path program 1 times [2020-07-08 22:07:00,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:00,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1280548774] [2020-07-08 22:07:00,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-08 22:07:00,116 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-08 22:07:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:00,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,202 INFO L280 TraceCheckUtils]: 3: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,203 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,206 INFO L263 TraceCheckUtils]: 2: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-08 22:07:00,206 INFO L280 TraceCheckUtils]: 3: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:00,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,210 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,211 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,212 INFO L280 TraceCheckUtils]: 9: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,213 INFO L280 TraceCheckUtils]: 10: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,213 INFO L280 TraceCheckUtils]: 11: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,215 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-08 22:07:00,216 INFO L263 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2020-07-08 22:07:00,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-08 22:07:00,217 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-08 22:07:00,217 INFO L263 TraceCheckUtils]: 3: Hoare triple {273#true} call #t~ret3 := main(); {273#true} is VALID [2020-07-08 22:07:00,218 INFO L280 TraceCheckUtils]: 4: Hoare triple {273#true} ~input~0 := 5; {277#(<= 5 main_~input~0)} is VALID [2020-07-08 22:07:00,218 INFO L263 TraceCheckUtils]: 5: Hoare triple {277#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {273#true} is VALID [2020-07-08 22:07:00,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {291#(= |id_#in~x| id_~x)} assume !(0 == ~x); {291#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,220 INFO L263 TraceCheckUtils]: 8: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-08 22:07:00,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:00,222 INFO L280 TraceCheckUtils]: 10: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,223 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,224 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:00,225 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {299#(= 0 |id2_#in~x|)} {291#(= |id_#in~x| id_~x)} #50#return; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {297#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,227 INFO L280 TraceCheckUtils]: 16: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,228 INFO L280 TraceCheckUtils]: 17: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:00,230 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-08 22:07:00,230 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {274#false} is VALID [2020-07-08 22:07:00,231 INFO L280 TraceCheckUtils]: 20: Hoare triple {274#false} ~result~0 := #t~ret2; {274#false} is VALID [2020-07-08 22:07:00,231 INFO L280 TraceCheckUtils]: 21: Hoare triple {274#false} havoc #t~ret2; {274#false} is VALID [2020-07-08 22:07:00,231 INFO L280 TraceCheckUtils]: 22: Hoare triple {274#false} assume 5 == ~result~0; {274#false} is VALID [2020-07-08 22:07:00,231 INFO L280 TraceCheckUtils]: 23: Hoare triple {274#false} assume !false; {274#false} is VALID [2020-07-08 22:07:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:07:00,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1280548774] [2020-07-08 22:07:00,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:07:00,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 22:07:00,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702726521] [2020-07-08 22:07:00,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 22:07:00,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:00,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:07:00,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:00,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:07:00,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:00,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:07:00,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:07:00,271 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2020-07-08 22:07:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:00,578 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-08 22:07:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 22:07:00,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 22:07:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:07:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-08 22:07:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:07:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-08 22:07:00,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2020-07-08 22:07:00,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:00,654 INFO L225 Difference]: With dead ends: 45 [2020-07-08 22:07:00,655 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 22:07:00,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-08 22:07:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 22:07:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-08 22:07:00,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:00,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-08 22:07:00,714 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-08 22:07:00,714 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-08 22:07:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:00,719 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 22:07:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 22:07:00,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:00,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:00,721 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-08 22:07:00,722 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-08 22:07:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:00,726 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 22:07:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 22:07:00,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:00,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:00,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:00,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 22:07:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-08 22:07:00,733 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2020-07-08 22:07:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:00,733 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-08 22:07:00,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:07:00,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2020-07-08 22:07:00,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-08 22:07:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 22:07:00,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:00,793 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:07:00,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:07:00,793 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash -238705980, now seen corresponding path program 1 times [2020-07-08 22:07:00,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:00,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1815439983] [2020-07-08 22:07:00,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,855 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-08 22:07:00,856 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-08 22:07:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:00,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,971 INFO L280 TraceCheckUtils]: 3: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,973 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:00,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:00,975 INFO L263 TraceCheckUtils]: 2: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-08 22:07:00,976 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,978 INFO L280 TraceCheckUtils]: 6: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,980 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,980 INFO L280 TraceCheckUtils]: 8: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,985 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:00,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {574#(= |id_#in~x| id_~x)} assume !(0 == ~x); {574#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,987 INFO L263 TraceCheckUtils]: 2: Hoare triple {574#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {548#true} is VALID [2020-07-08 22:07:00,988 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:00,988 INFO L280 TraceCheckUtils]: 4: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:00,989 INFO L263 TraceCheckUtils]: 5: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-08 22:07:00,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:00,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,991 INFO L280 TraceCheckUtils]: 8: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:00,993 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,994 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,995 INFO L280 TraceCheckUtils]: 12: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,995 INFO L280 TraceCheckUtils]: 13: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,996 INFO L280 TraceCheckUtils]: 14: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:00,998 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:00,999 INFO L280 TraceCheckUtils]: 16: Hoare triple {588#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:00,999 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:01,000 INFO L280 TraceCheckUtils]: 18: Hoare triple {588#(<= |id_#in~x| 2)} havoc #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:01,001 INFO L280 TraceCheckUtils]: 19: Hoare triple {588#(<= |id_#in~x| 2)} assume true; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:01,002 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {588#(<= |id_#in~x| 2)} {552#(<= 5 main_~input~0)} #48#return; {549#false} is VALID [2020-07-08 22:07:01,003 INFO L263 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2020-07-08 22:07:01,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-08 22:07:01,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-08 22:07:01,004 INFO L263 TraceCheckUtils]: 3: Hoare triple {548#true} call #t~ret3 := main(); {548#true} is VALID [2020-07-08 22:07:01,005 INFO L280 TraceCheckUtils]: 4: Hoare triple {548#true} ~input~0 := 5; {552#(<= 5 main_~input~0)} is VALID [2020-07-08 22:07:01,005 INFO L263 TraceCheckUtils]: 5: Hoare triple {552#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {548#true} is VALID [2020-07-08 22:07:01,006 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {574#(= |id_#in~x| id_~x)} assume !(0 == ~x); {574#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,007 INFO L263 TraceCheckUtils]: 8: Hoare triple {574#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {548#true} is VALID [2020-07-08 22:07:01,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {589#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,009 INFO L263 TraceCheckUtils]: 11: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-08 22:07:01,010 INFO L280 TraceCheckUtils]: 12: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,011 INFO L280 TraceCheckUtils]: 13: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:01,012 INFO L280 TraceCheckUtils]: 14: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:01,013 INFO L280 TraceCheckUtils]: 15: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:01,014 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {596#(= 0 |id_#in~x|)} {589#(= id2_~x |id2_#in~x|)} #42#return; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:01,016 INFO L280 TraceCheckUtils]: 17: Hoare triple {595#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:01,018 INFO L280 TraceCheckUtils]: 18: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:01,019 INFO L280 TraceCheckUtils]: 19: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:01,019 INFO L280 TraceCheckUtils]: 20: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:01,021 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {595#(<= |id2_#in~x| 1)} {574#(= |id_#in~x| id_~x)} #50#return; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:01,022 INFO L280 TraceCheckUtils]: 22: Hoare triple {588#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:01,022 INFO L280 TraceCheckUtils]: 23: Hoare triple {588#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:01,023 INFO L280 TraceCheckUtils]: 24: Hoare triple {588#(<= |id_#in~x| 2)} havoc #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:01,024 INFO L280 TraceCheckUtils]: 25: Hoare triple {588#(<= |id_#in~x| 2)} assume true; {588#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:01,025 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {588#(<= |id_#in~x| 2)} {552#(<= 5 main_~input~0)} #48#return; {549#false} is VALID [2020-07-08 22:07:01,025 INFO L280 TraceCheckUtils]: 27: Hoare triple {549#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {549#false} is VALID [2020-07-08 22:07:01,025 INFO L280 TraceCheckUtils]: 28: Hoare triple {549#false} ~result~0 := #t~ret2; {549#false} is VALID [2020-07-08 22:07:01,026 INFO L280 TraceCheckUtils]: 29: Hoare triple {549#false} havoc #t~ret2; {549#false} is VALID [2020-07-08 22:07:01,026 INFO L280 TraceCheckUtils]: 30: Hoare triple {549#false} assume 5 == ~result~0; {549#false} is VALID [2020-07-08 22:07:01,026 INFO L280 TraceCheckUtils]: 31: Hoare triple {549#false} assume !false; {549#false} is VALID [2020-07-08 22:07:01,028 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-08 22:07:01,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1815439983] [2020-07-08 22:07:01,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:07:01,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 22:07:01,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401040380] [2020-07-08 22:07:01,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-08 22:07:01,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:01,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 22:07:01,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:01,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 22:07:01,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 22:07:01,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:07:01,069 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2020-07-08 22:07:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:01,419 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-08 22:07:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 22:07:01,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-08 22:07:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 22:07:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-08 22:07:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 22:07:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-08 22:07:01,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-08 22:07:01,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:01,526 INFO L225 Difference]: With dead ends: 55 [2020-07-08 22:07:01,526 INFO L226 Difference]: Without dead ends: 49 [2020-07-08 22:07:01,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-08 22:07:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-08 22:07:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2020-07-08 22:07:01,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:01,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 42 states. [2020-07-08 22:07:01,590 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 42 states. [2020-07-08 22:07:01,590 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 42 states. [2020-07-08 22:07:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:01,594 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-08 22:07:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-08 22:07:01,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:01,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:01,595 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 49 states. [2020-07-08 22:07:01,595 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 49 states. [2020-07-08 22:07:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:01,599 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-08 22:07:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-08 22:07:01,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:01,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:01,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:01,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 22:07:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-08 22:07:01,603 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2020-07-08 22:07:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:01,604 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-08 22:07:01,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 22:07:01,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-08 22:07:01,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-08 22:07:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 22:07:01,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:01,673 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:07:01,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:07:01,673 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2006293766, now seen corresponding path program 1 times [2020-07-08 22:07:01,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:01,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [714001171] [2020-07-08 22:07:01,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:01,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} assume true; {897#true} is VALID [2020-07-08 22:07:01,760 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {897#true} {897#true} #44#return; {897#true} is VALID [2020-07-08 22:07:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:01,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,914 INFO L280 TraceCheckUtils]: 2: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,915 INFO L280 TraceCheckUtils]: 3: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,916 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,917 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,918 INFO L263 TraceCheckUtils]: 2: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,918 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,919 INFO L280 TraceCheckUtils]: 4: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,920 INFO L280 TraceCheckUtils]: 6: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,920 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,925 INFO L280 TraceCheckUtils]: 11: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,927 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,931 INFO L263 TraceCheckUtils]: 2: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,933 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,933 INFO L280 TraceCheckUtils]: 4: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,934 INFO L263 TraceCheckUtils]: 5: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,935 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,935 INFO L280 TraceCheckUtils]: 8: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,936 INFO L280 TraceCheckUtils]: 9: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,937 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,938 INFO L280 TraceCheckUtils]: 11: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,938 INFO L280 TraceCheckUtils]: 12: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,939 INFO L280 TraceCheckUtils]: 13: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,940 INFO L280 TraceCheckUtils]: 14: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,941 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,942 INFO L280 TraceCheckUtils]: 16: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,942 INFO L280 TraceCheckUtils]: 17: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,943 INFO L280 TraceCheckUtils]: 18: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,944 INFO L280 TraceCheckUtils]: 19: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,945 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,948 INFO L263 TraceCheckUtils]: 2: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,948 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,949 INFO L263 TraceCheckUtils]: 5: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,951 INFO L263 TraceCheckUtils]: 8: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,951 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,953 INFO L280 TraceCheckUtils]: 12: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,955 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,955 INFO L280 TraceCheckUtils]: 14: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,956 INFO L280 TraceCheckUtils]: 15: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,957 INFO L280 TraceCheckUtils]: 16: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,957 INFO L280 TraceCheckUtils]: 17: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,959 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,959 INFO L280 TraceCheckUtils]: 19: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,960 INFO L280 TraceCheckUtils]: 20: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,960 INFO L280 TraceCheckUtils]: 21: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,961 INFO L280 TraceCheckUtils]: 22: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,962 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,963 INFO L280 TraceCheckUtils]: 24: Hoare triple {953#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,964 INFO L280 TraceCheckUtils]: 25: Hoare triple {953#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,964 INFO L280 TraceCheckUtils]: 26: Hoare triple {953#(<= |id_#in~x| 3)} havoc #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,965 INFO L280 TraceCheckUtils]: 27: Hoare triple {953#(<= |id_#in~x| 3)} assume true; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,966 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {953#(<= |id_#in~x| 3)} {901#(<= 5 main_~input~0)} #48#return; {898#false} is VALID [2020-07-08 22:07:01,968 INFO L263 TraceCheckUtils]: 0: Hoare triple {897#true} call ULTIMATE.init(); {897#true} is VALID [2020-07-08 22:07:01,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {897#true} assume true; {897#true} is VALID [2020-07-08 22:07:01,968 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {897#true} {897#true} #44#return; {897#true} is VALID [2020-07-08 22:07:01,969 INFO L263 TraceCheckUtils]: 3: Hoare triple {897#true} call #t~ret3 := main(); {897#true} is VALID [2020-07-08 22:07:01,969 INFO L280 TraceCheckUtils]: 4: Hoare triple {897#true} ~input~0 := 5; {901#(<= 5 main_~input~0)} is VALID [2020-07-08 22:07:01,970 INFO L263 TraceCheckUtils]: 5: Hoare triple {901#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {897#true} is VALID [2020-07-08 22:07:01,970 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,971 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,971 INFO L263 TraceCheckUtils]: 8: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,972 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,972 INFO L280 TraceCheckUtils]: 10: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,973 INFO L263 TraceCheckUtils]: 11: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,973 INFO L280 TraceCheckUtils]: 12: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,974 INFO L280 TraceCheckUtils]: 13: Hoare triple {931#(= |id_#in~x| id_~x)} assume !(0 == ~x); {931#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:01,974 INFO L263 TraceCheckUtils]: 14: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-08 22:07:01,975 INFO L280 TraceCheckUtils]: 15: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:01,975 INFO L280 TraceCheckUtils]: 16: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,976 INFO L280 TraceCheckUtils]: 17: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,977 INFO L280 TraceCheckUtils]: 18: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-08 22:07:01,978 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {975#(= 0 |id2_#in~x|)} {931#(= |id_#in~x| id_~x)} #50#return; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,978 INFO L280 TraceCheckUtils]: 20: Hoare triple {974#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,979 INFO L280 TraceCheckUtils]: 21: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,980 INFO L280 TraceCheckUtils]: 22: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,980 INFO L280 TraceCheckUtils]: 23: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-08 22:07:01,982 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {974#(<= |id_#in~x| 1)} {954#(= id2_~x |id2_#in~x|)} #42#return; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,982 INFO L280 TraceCheckUtils]: 25: Hoare triple {968#(<= |id2_#in~x| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,983 INFO L280 TraceCheckUtils]: 26: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,984 INFO L280 TraceCheckUtils]: 27: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,984 INFO L280 TraceCheckUtils]: 28: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-08 22:07:01,985 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {968#(<= |id2_#in~x| 2)} {931#(= |id_#in~x| id_~x)} #50#return; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,986 INFO L280 TraceCheckUtils]: 30: Hoare triple {953#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,987 INFO L280 TraceCheckUtils]: 31: Hoare triple {953#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,987 INFO L280 TraceCheckUtils]: 32: Hoare triple {953#(<= |id_#in~x| 3)} havoc #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,988 INFO L280 TraceCheckUtils]: 33: Hoare triple {953#(<= |id_#in~x| 3)} assume true; {953#(<= |id_#in~x| 3)} is VALID [2020-07-08 22:07:01,989 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {953#(<= |id_#in~x| 3)} {901#(<= 5 main_~input~0)} #48#return; {898#false} is VALID [2020-07-08 22:07:01,990 INFO L280 TraceCheckUtils]: 35: Hoare triple {898#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {898#false} is VALID [2020-07-08 22:07:01,990 INFO L280 TraceCheckUtils]: 36: Hoare triple {898#false} ~result~0 := #t~ret2; {898#false} is VALID [2020-07-08 22:07:01,990 INFO L280 TraceCheckUtils]: 37: Hoare triple {898#false} havoc #t~ret2; {898#false} is VALID [2020-07-08 22:07:01,990 INFO L280 TraceCheckUtils]: 38: Hoare triple {898#false} assume 5 == ~result~0; {898#false} is VALID [2020-07-08 22:07:01,991 INFO L280 TraceCheckUtils]: 39: Hoare triple {898#false} assume !false; {898#false} is VALID [2020-07-08 22:07:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-08 22:07:01,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [714001171] [2020-07-08 22:07:01,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:07:01,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 22:07:01,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996846492] [2020-07-08 22:07:01,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-08 22:07:01,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:01,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 22:07:02,045 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-08 22:07:02,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 22:07:02,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:02,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 22:07:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-08 22:07:02,046 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2020-07-08 22:07:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:02,419 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-07-08 22:07:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 22:07:02,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-08 22:07:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:07:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-08 22:07:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:07:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-08 22:07:02,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2020-07-08 22:07:02,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:02,517 INFO L225 Difference]: With dead ends: 65 [2020-07-08 22:07:02,517 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 22:07:02,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-08 22:07:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 22:07:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-08 22:07:02,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:02,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-08 22:07:02,580 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-08 22:07:02,580 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-08 22:07:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:02,584 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-08 22:07:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-08 22:07:02,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:02,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:02,585 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-08 22:07:02,585 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-08 22:07:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:02,589 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-08 22:07:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-08 22:07:02,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:02,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:02,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:02,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 22:07:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-07-08 22:07:02,593 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2020-07-08 22:07:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:02,593 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-07-08 22:07:02,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 22:07:02,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2020-07-08 22:07:02,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-08 22:07:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 22:07:02,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:02,667 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:07:02,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:07:02,667 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash 940355172, now seen corresponding path program 2 times [2020-07-08 22:07:02,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:02,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84479855] [2020-07-08 22:07:02,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:02,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} assume true; {1328#true} is VALID [2020-07-08 22:07:02,710 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1328#true} {1328#true} #44#return; {1328#true} is VALID [2020-07-08 22:07:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:02,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:02,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,946 INFO L280 TraceCheckUtils]: 3: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,947 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:02,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:02,949 INFO L263 TraceCheckUtils]: 2: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-08 22:07:02,949 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:02,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,951 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,953 INFO L280 TraceCheckUtils]: 10: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,960 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,961 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:02,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:02,962 INFO L263 TraceCheckUtils]: 2: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-08 22:07:02,962 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:02,962 INFO L280 TraceCheckUtils]: 4: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:02,963 INFO L263 TraceCheckUtils]: 5: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-08 22:07:02,963 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:02,964 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,964 INFO L280 TraceCheckUtils]: 8: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,964 INFO L280 TraceCheckUtils]: 9: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,966 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,967 INFO L280 TraceCheckUtils]: 11: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,967 INFO L280 TraceCheckUtils]: 12: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,968 INFO L280 TraceCheckUtils]: 13: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,968 INFO L280 TraceCheckUtils]: 14: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,972 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,972 INFO L280 TraceCheckUtils]: 16: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,973 INFO L280 TraceCheckUtils]: 17: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,973 INFO L280 TraceCheckUtils]: 18: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,974 INFO L280 TraceCheckUtils]: 19: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,975 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:02,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:02,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:02,980 INFO L263 TraceCheckUtils]: 2: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-08 22:07:02,982 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:02,983 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:02,983 INFO L263 TraceCheckUtils]: 5: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-08 22:07:02,984 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:02,985 INFO L280 TraceCheckUtils]: 7: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:02,985 INFO L263 TraceCheckUtils]: 8: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-08 22:07:02,985 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:02,986 INFO L280 TraceCheckUtils]: 10: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,988 INFO L280 TraceCheckUtils]: 11: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,989 INFO L280 TraceCheckUtils]: 12: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:02,990 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,992 INFO L280 TraceCheckUtils]: 16: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:02,994 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,995 INFO L280 TraceCheckUtils]: 19: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,996 INFO L280 TraceCheckUtils]: 20: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,996 INFO L280 TraceCheckUtils]: 21: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,997 INFO L280 TraceCheckUtils]: 22: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:02,998 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:02,999 INFO L280 TraceCheckUtils]: 24: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:02,999 INFO L280 TraceCheckUtils]: 25: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,000 INFO L280 TraceCheckUtils]: 26: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,001 INFO L280 TraceCheckUtils]: 27: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,002 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,005 INFO L263 TraceCheckUtils]: 2: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-08 22:07:03,005 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:03,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:03,006 INFO L263 TraceCheckUtils]: 5: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-08 22:07:03,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,008 INFO L263 TraceCheckUtils]: 8: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-08 22:07:03,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:03,009 INFO L280 TraceCheckUtils]: 10: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:03,009 INFO L263 TraceCheckUtils]: 11: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-08 22:07:03,010 INFO L280 TraceCheckUtils]: 12: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,011 INFO L280 TraceCheckUtils]: 13: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:03,011 INFO L280 TraceCheckUtils]: 14: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:03,012 INFO L280 TraceCheckUtils]: 15: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:03,013 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,014 INFO L280 TraceCheckUtils]: 17: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,014 INFO L280 TraceCheckUtils]: 18: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,015 INFO L280 TraceCheckUtils]: 19: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,016 INFO L280 TraceCheckUtils]: 20: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,017 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,018 INFO L280 TraceCheckUtils]: 22: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,018 INFO L280 TraceCheckUtils]: 23: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,019 INFO L280 TraceCheckUtils]: 24: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,020 INFO L280 TraceCheckUtils]: 25: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,021 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,021 INFO L280 TraceCheckUtils]: 27: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,022 INFO L280 TraceCheckUtils]: 28: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,023 INFO L280 TraceCheckUtils]: 29: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,023 INFO L280 TraceCheckUtils]: 30: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,024 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,025 INFO L280 TraceCheckUtils]: 32: Hoare triple {1400#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,025 INFO L280 TraceCheckUtils]: 33: Hoare triple {1400#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,026 INFO L280 TraceCheckUtils]: 34: Hoare triple {1400#(<= |id_#in~x| 4)} havoc #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,026 INFO L280 TraceCheckUtils]: 35: Hoare triple {1400#(<= |id_#in~x| 4)} assume true; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,027 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1400#(<= |id_#in~x| 4)} {1332#(<= 5 main_~input~0)} #48#return; {1329#false} is VALID [2020-07-08 22:07:03,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1328#true} is VALID [2020-07-08 22:07:03,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {1328#true} assume true; {1328#true} is VALID [2020-07-08 22:07:03,028 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1328#true} {1328#true} #44#return; {1328#true} is VALID [2020-07-08 22:07:03,028 INFO L263 TraceCheckUtils]: 3: Hoare triple {1328#true} call #t~ret3 := main(); {1328#true} is VALID [2020-07-08 22:07:03,029 INFO L280 TraceCheckUtils]: 4: Hoare triple {1328#true} ~input~0 := 5; {1332#(<= 5 main_~input~0)} is VALID [2020-07-08 22:07:03,029 INFO L263 TraceCheckUtils]: 5: Hoare triple {1332#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {1328#true} is VALID [2020-07-08 22:07:03,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,030 INFO L263 TraceCheckUtils]: 8: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-08 22:07:03,030 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:03,031 INFO L280 TraceCheckUtils]: 10: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:03,031 INFO L263 TraceCheckUtils]: 11: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-08 22:07:03,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,032 INFO L280 TraceCheckUtils]: 13: Hoare triple {1370#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,032 INFO L263 TraceCheckUtils]: 14: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-08 22:07:03,032 INFO L280 TraceCheckUtils]: 15: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:03,033 INFO L280 TraceCheckUtils]: 16: Hoare triple {1401#(= id2_~x |id2_#in~x|)} assume !(0 == ~x); {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-08 22:07:03,033 INFO L263 TraceCheckUtils]: 17: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-08 22:07:03,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-08 22:07:03,038 INFO L280 TraceCheckUtils]: 19: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:03,039 INFO L280 TraceCheckUtils]: 20: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:03,040 INFO L280 TraceCheckUtils]: 21: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-08 22:07:03,041 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1444#(= 0 |id_#in~x|)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,042 INFO L280 TraceCheckUtils]: 23: Hoare triple {1443#(<= |id2_#in~x| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,043 INFO L280 TraceCheckUtils]: 24: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,044 INFO L280 TraceCheckUtils]: 25: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,047 INFO L280 TraceCheckUtils]: 26: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-08 22:07:03,054 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1443#(<= |id2_#in~x| 1)} {1370#(= |id_#in~x| id_~x)} #50#return; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,054 INFO L280 TraceCheckUtils]: 28: Hoare triple {1437#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,055 INFO L280 TraceCheckUtils]: 29: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,055 INFO L280 TraceCheckUtils]: 30: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,056 INFO L280 TraceCheckUtils]: 31: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-08 22:07:03,056 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1437#(<= |id_#in~x| 2)} {1401#(= id2_~x |id2_#in~x|)} #42#return; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,057 INFO L280 TraceCheckUtils]: 33: Hoare triple {1423#(<= |id2_#in~x| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,057 INFO L280 TraceCheckUtils]: 34: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,058 INFO L280 TraceCheckUtils]: 35: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,058 INFO L280 TraceCheckUtils]: 36: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-08 22:07:03,060 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1423#(<= |id2_#in~x| 3)} {1370#(= |id_#in~x| id_~x)} #50#return; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,060 INFO L280 TraceCheckUtils]: 38: Hoare triple {1400#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,061 INFO L280 TraceCheckUtils]: 39: Hoare triple {1400#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,061 INFO L280 TraceCheckUtils]: 40: Hoare triple {1400#(<= |id_#in~x| 4)} havoc #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,061 INFO L280 TraceCheckUtils]: 41: Hoare triple {1400#(<= |id_#in~x| 4)} assume true; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-08 22:07:03,062 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1400#(<= |id_#in~x| 4)} {1332#(<= 5 main_~input~0)} #48#return; {1329#false} is VALID [2020-07-08 22:07:03,062 INFO L280 TraceCheckUtils]: 43: Hoare triple {1329#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1329#false} is VALID [2020-07-08 22:07:03,062 INFO L280 TraceCheckUtils]: 44: Hoare triple {1329#false} ~result~0 := #t~ret2; {1329#false} is VALID [2020-07-08 22:07:03,063 INFO L280 TraceCheckUtils]: 45: Hoare triple {1329#false} havoc #t~ret2; {1329#false} is VALID [2020-07-08 22:07:03,063 INFO L280 TraceCheckUtils]: 46: Hoare triple {1329#false} assume 5 == ~result~0; {1329#false} is VALID [2020-07-08 22:07:03,063 INFO L280 TraceCheckUtils]: 47: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2020-07-08 22:07:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-08 22:07:03,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [84479855] [2020-07-08 22:07:03,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:07:03,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 22:07:03,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714230522] [2020-07-08 22:07:03,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-08 22:07:03,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:03,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 22:07:03,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:03,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 22:07:03,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:03,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 22:07:03,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-08 22:07:03,120 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 10 states. [2020-07-08 22:07:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:03,602 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-08 22:07:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 22:07:03,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-08 22:07:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 22:07:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-08 22:07:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 22:07:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-08 22:07:03,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2020-07-08 22:07:03,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:03,682 INFO L225 Difference]: With dead ends: 75 [2020-07-08 22:07:03,682 INFO L226 Difference]: Without dead ends: 69 [2020-07-08 22:07:03,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-07-08 22:07:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-08 22:07:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2020-07-08 22:07:03,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:03,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 52 states. [2020-07-08 22:07:03,754 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 52 states. [2020-07-08 22:07:03,754 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 52 states. [2020-07-08 22:07:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:03,757 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-07-08 22:07:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-08 22:07:03,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:03,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:03,758 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 69 states. [2020-07-08 22:07:03,758 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 69 states. [2020-07-08 22:07:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:03,762 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-07-08 22:07:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-08 22:07:03,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:03,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:03,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:03,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 22:07:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-08 22:07:03,766 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2020-07-08 22:07:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:03,766 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-08 22:07:03,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 22:07:03,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-08 22:07:03,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-08 22:07:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-08 22:07:03,852 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:03,852 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:07:03,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 22:07:03,853 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:03,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:03,853 INFO L82 PathProgramCache]: Analyzing trace with hash 826985242, now seen corresponding path program 2 times [2020-07-08 22:07:03,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:03,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959988780] [2020-07-08 22:07:03,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:07:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:07:03,900 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 22:07:03,900 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 22:07:03,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 22:07:03,931 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 22:07:03,932 WARN L170 areAnnotationChecker]: id2ENTRY has no Hoare annotation [2020-07-08 22:07:03,932 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:07:03,932 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:07:03,932 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 22:07:03,932 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-08 22:07:03,932 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 22:07:03,932 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 22:07:03,932 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 22:07:03,933 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: id2FINAL has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-08 22:07:03,934 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: id2EXIT has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 22:07:03,935 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 22:07:03,936 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-08 22:07:03,936 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 22:07:03,936 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 22:07:03,936 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 22:07:03,936 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 22:07:03,936 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:07:03,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:07:03 BoogieIcfgContainer [2020-07-08 22:07:03,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:07:03,943 INFO L168 Benchmark]: Toolchain (without parser) took 5873.07 ms. Allocated memory was 146.8 MB in the beginning and 273.7 MB in the end (delta: 126.9 MB). Free memory was 105.0 MB in the beginning and 154.9 MB in the end (delta: -49.9 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:03,943 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 146.8 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:07:03,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.37 ms. Allocated memory is still 146.8 MB. Free memory was 104.8 MB in the beginning and 95.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:03,945 INFO L168 Benchmark]: Boogie Preprocessor took 122.36 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 95.0 MB in the beginning and 182.7 MB in the end (delta: -87.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:03,945 INFO L168 Benchmark]: RCFGBuilder took 469.45 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 164.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:03,946 INFO L168 Benchmark]: TraceAbstraction took 4942.40 ms. Allocated memory was 203.4 MB in the beginning and 273.7 MB in the end (delta: 70.3 MB). Free memory was 164.3 MB in the beginning and 154.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:03,949 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97 ms. Allocated memory is still 146.8 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.37 ms. Allocated memory is still 146.8 MB. Free memory was 104.8 MB in the beginning and 95.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.36 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 95.0 MB in the beginning and 182.7 MB in the end (delta: -87.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.45 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 164.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4942.40 ms. Allocated memory was 203.4 MB in the beginning and 273.7 MB in the end (delta: 70.3 MB). Free memory was 164.3 MB in the beginning and 154.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 21]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int input = 5; VAL [input=5] [L19] CALL, EXPR id(input) VAL [\old(x)=5] [L8] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=4] [L13] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L14] CALL, EXPR id(x-1) VAL [\old(x)=3] [L8] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=2] [L13] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L14] CALL, EXPR id(x-1) VAL [\old(x)=1] [L8] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=0] [L13] COND TRUE x==0 VAL [\old(x)=0, x=0] [L13] return 0; VAL [\old(x)=0, \result=0, x=0] [L9] RET, EXPR id2(x-1) VAL [\old(x)=1, id2(x-1)=0, x=1] [L9] return id2(x-1) + 1; VAL [\old(x)=1, \result=1, id2(x-1)=0, x=1] [L14] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L14] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L9] RET, EXPR id2(x-1) VAL [\old(x)=3, id2(x-1)=2, x=3] [L9] return id2(x-1) + 1; VAL [\old(x)=3, \result=3, id2(x-1)=2, x=3] [L14] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L14] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L9] RET, EXPR id2(x-1) VAL [\old(x)=5, id2(x-1)=4, x=5] [L9] return id2(x-1) + 1; VAL [\old(x)=5, \result=5, id2(x-1)=4, x=5] [L19] RET, EXPR id(input) VAL [id(input)=5, input=5] [L19] int result = id(input); VAL [id(input)=5, input=5, result=5] [L20] COND TRUE result == 5 VAL [input=5, result=5] [L21] __VERIFIER_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 132 SDtfs, 137 SDslu, 538 SDs, 0 SdLazy, 211 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 12455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 17/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...