/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-267fbe0 [2020-07-18 04:57:25,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:57:25,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:57:25,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:57:25,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:57:25,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:57:25,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:57:25,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:57:25,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:57:25,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:57:25,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:57:25,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:57:25,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:57:25,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:57:25,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:57:25,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:57:25,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:57:25,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:57:25,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:57:25,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:57:25,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:57:25,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:57:25,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:57:25,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:57:25,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:57:25,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:57:25,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:57:25,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:57:25,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:57:25,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:57:25,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:57:25,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:57:25,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:57:25,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:57:25,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:57:25,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:57:25,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:57:25,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:57:25,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:57:25,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:57:25,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:57:25,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:57:25,180 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:57:25,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:57:25,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:57:25,182 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:57:25,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:57:25,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:57:25,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:57:25,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:57:25,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:57:25,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:57:25,183 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:57:25,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:57:25,183 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:57:25,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:57:25,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:57:25,184 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:57:25,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:57:25,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:57:25,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:57:25,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:57:25,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:57:25,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:57:25,185 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-18 04:57:25,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:57:25,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:57:25,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:57:25,465 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:57:25,465 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:57:25,467 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-18 04:57:25,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b2ff9f3/debc921485294c279c61102c2c9151a3/FLAGb4f04d9af [2020-07-18 04:57:26,047 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:57:26,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2020-07-18 04:57:26,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b2ff9f3/debc921485294c279c61102c2c9151a3/FLAGb4f04d9af [2020-07-18 04:57:26,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b2ff9f3/debc921485294c279c61102c2c9151a3 [2020-07-18 04:57:26,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:57:26,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:57:26,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:57:26,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:57:26,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:57:26,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f626611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26, skipping insertion in model container [2020-07-18 04:57:26,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:57:26,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:57:26,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:57:26,671 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:57:26,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:57:26,704 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:57:26,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26 WrapperNode [2020-07-18 04:57:26,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:57:26,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:57:26,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:57:26,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:57:26,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (1/1) ... [2020-07-18 04:57:26,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:57:26,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:57:26,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:57:26,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:57:26,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (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-18 04:57:26,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:57:26,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:57:26,900 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-18 04:57:26,900 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-07-18 04:57:26,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:57:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:57:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:57:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-18 04:57:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-07-18 04:57:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:57:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:57:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:57:27,166 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:57:27,166 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:57:27,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:57:27 BoogieIcfgContainer [2020-07-18 04:57:27,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:57:27,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:57:27,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:57:27,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:57:27,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:57:26" (1/3) ... [2020-07-18 04:57:27,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59aa2c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:57:27, skipping insertion in model container [2020-07-18 04:57:27,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:26" (2/3) ... [2020-07-18 04:57:27,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59aa2c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:57:27, skipping insertion in model container [2020-07-18 04:57:27,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:57:27" (3/3) ... [2020-07-18 04:57:27,183 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2020-07-18 04:57:27,197 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:57:27,205 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:57:27,222 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:57:27,246 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:57:27,247 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:57:27,247 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:57:27,247 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:57:27,247 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:57:27,247 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:57:27,247 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:57:27,247 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:57:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-18 04:57:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-18 04:57:27,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:27,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:57:27,303 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash -588914908, now seen corresponding path program 1 times [2020-07-18 04:57:27,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:27,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110337928] [2020-07-18 04:57:27,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:27,544 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-18 04:57:27,544 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-18 04:57:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:27,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:27,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:27,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:27,597 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:27,599 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-18 04:57:27,600 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2020-07-18 04:57:27,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-18 04:57:27,600 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #44#return; {37#true} is VALID [2020-07-18 04:57:27,601 INFO L263 TraceCheckUtils]: 3: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2020-07-18 04:57:27,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {37#true} ~input~0 := 5; {41#(<= 5 main_~input~0)} is VALID [2020-07-18 04:57:27,603 INFO L263 TraceCheckUtils]: 5: Hoare triple {41#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {37#true} is VALID [2020-07-18 04:57:27,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} ~x := #in~x; {47#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:27,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#(= |id_#in~x| id_~x)} assume 0 == ~x; {48#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:27,608 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#(= 0 |id_#in~x|)} #res := 0; {48#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:27,609 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#(= 0 |id_#in~x|)} assume true; {48#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:27,611 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#(= 0 |id_#in~x|)} {41#(<= 5 main_~input~0)} #48#return; {38#false} is VALID [2020-07-18 04:57:27,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {38#false} is VALID [2020-07-18 04:57:27,612 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} ~result~0 := #t~ret2; {38#false} is VALID [2020-07-18 04:57:27,613 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} havoc #t~ret2; {38#false} is VALID [2020-07-18 04:57:27,613 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} assume 5 == ~result~0; {38#false} is VALID [2020-07-18 04:57:27,615 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-18 04:57:27,617 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-18 04:57:27,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110337928] [2020-07-18 04:57:27,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:57:27,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:57:27,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449614007] [2020-07-18 04:57:27,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:57:27,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:27,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:57:27,685 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-18 04:57:27,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:57:27,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:27,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:57:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:57:27,699 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-07-18 04:57:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:27,977 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-18 04:57:27,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:57:27,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:57:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-18 04:57:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-18 04:57:27,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-18 04:57:28,081 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-18 04:57:28,096 INFO L225 Difference]: With dead ends: 46 [2020-07-18 04:57:28,096 INFO L226 Difference]: Without dead ends: 32 [2020-07-18 04:57:28,101 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-18 04:57:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-18 04:57:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-18 04:57:28,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:28,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-18 04:57:28,188 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-18 04:57:28,188 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-18 04:57:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:28,195 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-18 04:57:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 04:57:28,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:28,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:28,196 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-18 04:57:28,197 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-18 04:57:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:28,201 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-18 04:57:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 04:57:28,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:28,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:28,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:28,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 04:57:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-18 04:57:28,208 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2020-07-18 04:57:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:28,209 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-18 04:57:28,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:57:28,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-18 04:57:28,261 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-18 04:57:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 04:57:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 04:57:28,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:28,263 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-18 04:57:28,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:57:28,264 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809946, now seen corresponding path program 1 times [2020-07-18 04:57:28,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:28,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852647075] [2020-07-18 04:57:28,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:28,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-18 04:57:28,314 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-18 04:57:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:28,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:28,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,414 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-18 04:57:28,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:28,416 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-18 04:57:28,416 INFO L263 TraceCheckUtils]: 2: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-18 04:57:28,417 INFO L280 TraceCheckUtils]: 3: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:28,418 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,421 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-18 04:57:28,421 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-18 04:57:28,422 INFO L280 TraceCheckUtils]: 9: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:28,423 INFO L280 TraceCheckUtils]: 10: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:28,423 INFO L280 TraceCheckUtils]: 11: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:28,425 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-18 04:57:28,426 INFO L263 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2020-07-18 04:57:28,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#true} assume true; {273#true} is VALID [2020-07-18 04:57:28,426 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} #44#return; {273#true} is VALID [2020-07-18 04:57:28,426 INFO L263 TraceCheckUtils]: 3: Hoare triple {273#true} call #t~ret3 := main(); {273#true} is VALID [2020-07-18 04:57:28,427 INFO L280 TraceCheckUtils]: 4: Hoare triple {273#true} ~input~0 := 5; {277#(<= 5 main_~input~0)} is VALID [2020-07-18 04:57:28,428 INFO L263 TraceCheckUtils]: 5: Hoare triple {277#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {273#true} is VALID [2020-07-18 04:57:28,428 INFO L280 TraceCheckUtils]: 6: Hoare triple {273#true} ~x := #in~x; {291#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:28,429 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-18 04:57:28,429 INFO L263 TraceCheckUtils]: 8: Hoare triple {291#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {273#true} is VALID [2020-07-18 04:57:28,430 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#true} ~x := #in~x; {298#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:28,431 INFO L280 TraceCheckUtils]: 10: Hoare triple {298#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,432 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(= 0 |id2_#in~x|)} #res := 0; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,432 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(= 0 |id2_#in~x|)} assume true; {299#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:28,433 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-18 04:57:28,434 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-18 04:57:28,435 INFO L280 TraceCheckUtils]: 15: Hoare triple {297#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:28,435 INFO L280 TraceCheckUtils]: 16: Hoare triple {297#(<= |id_#in~x| 1)} havoc #t~ret0; {297#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:28,436 INFO L280 TraceCheckUtils]: 17: Hoare triple {297#(<= |id_#in~x| 1)} assume true; {297#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:28,437 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {297#(<= |id_#in~x| 1)} {277#(<= 5 main_~input~0)} #48#return; {274#false} is VALID [2020-07-18 04:57:28,438 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {274#false} is VALID [2020-07-18 04:57:28,438 INFO L280 TraceCheckUtils]: 20: Hoare triple {274#false} ~result~0 := #t~ret2; {274#false} is VALID [2020-07-18 04:57:28,438 INFO L280 TraceCheckUtils]: 21: Hoare triple {274#false} havoc #t~ret2; {274#false} is VALID [2020-07-18 04:57:28,439 INFO L280 TraceCheckUtils]: 22: Hoare triple {274#false} assume 5 == ~result~0; {274#false} is VALID [2020-07-18 04:57:28,439 INFO L280 TraceCheckUtils]: 23: Hoare triple {274#false} assume !false; {274#false} is VALID [2020-07-18 04:57:28,440 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-18 04:57:28,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1852647075] [2020-07-18 04:57:28,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:57:28,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 04:57:28,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800373487] [2020-07-18 04:57:28,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-18 04:57:28,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:28,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:57:28,471 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-18 04:57:28,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:57:28,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:28,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:57:28,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:57:28,472 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2020-07-18 04:57:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:28,759 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-18 04:57:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:57:28,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-18 04:57:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:57:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-18 04:57:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:57:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-18 04:57:28,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2020-07-18 04:57:28,833 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-18 04:57:28,837 INFO L225 Difference]: With dead ends: 45 [2020-07-18 04:57:28,837 INFO L226 Difference]: Without dead ends: 39 [2020-07-18 04:57:28,838 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-18 04:57:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-18 04:57:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-18 04:57:28,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:28,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-18 04:57:28,885 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-18 04:57:28,885 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-18 04:57:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:28,889 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-18 04:57:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-18 04:57:28,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:28,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:28,891 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-18 04:57:28,891 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-18 04:57:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:28,896 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-18 04:57:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-18 04:57:28,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:28,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:28,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:28,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-18 04:57:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-18 04:57:28,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2020-07-18 04:57:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:28,902 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-18 04:57:28,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:57:28,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2020-07-18 04:57:28,959 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-18 04:57:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-18 04:57:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 04:57:28,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:28,962 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-18 04:57:28,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:57:28,962 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:28,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:28,963 INFO L82 PathProgramCache]: Analyzing trace with hash -238705980, now seen corresponding path program 1 times [2020-07-18 04:57:28,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:28,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2046644852] [2020-07-18 04:57:28,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-18 04:57:29,017 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-18 04:57:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,137 INFO L280 TraceCheckUtils]: 2: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,140 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-18 04:57:29,142 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,152 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-18 04:57:29,153 INFO L263 TraceCheckUtils]: 2: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-18 04:57:29,155 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,158 INFO L280 TraceCheckUtils]: 4: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,158 INFO L280 TraceCheckUtils]: 5: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,159 INFO L280 TraceCheckUtils]: 6: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,161 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-18 04:57:29,161 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-18 04:57:29,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,163 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,165 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-18 04:57:29,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,167 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-18 04:57:29,167 INFO L263 TraceCheckUtils]: 2: Hoare triple {574#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {548#true} is VALID [2020-07-18 04:57:29,168 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,168 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-18 04:57:29,169 INFO L263 TraceCheckUtils]: 5: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-18 04:57:29,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,171 INFO L280 TraceCheckUtils]: 8: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,173 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-18 04:57:29,173 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-18 04:57:29,174 INFO L280 TraceCheckUtils]: 12: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,175 INFO L280 TraceCheckUtils]: 13: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,175 INFO L280 TraceCheckUtils]: 14: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,177 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-18 04:57:29,177 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-18 04:57:29,178 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:29,179 INFO L280 TraceCheckUtils]: 18: Hoare triple {588#(<= |id_#in~x| 2)} havoc #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:29,179 INFO L280 TraceCheckUtils]: 19: Hoare triple {588#(<= |id_#in~x| 2)} assume true; {588#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:29,181 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {588#(<= |id_#in~x| 2)} {552#(<= 5 main_~input~0)} #48#return; {549#false} is VALID [2020-07-18 04:57:29,182 INFO L263 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2020-07-18 04:57:29,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {548#true} assume true; {548#true} is VALID [2020-07-18 04:57:29,182 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {548#true} {548#true} #44#return; {548#true} is VALID [2020-07-18 04:57:29,183 INFO L263 TraceCheckUtils]: 3: Hoare triple {548#true} call #t~ret3 := main(); {548#true} is VALID [2020-07-18 04:57:29,184 INFO L280 TraceCheckUtils]: 4: Hoare triple {548#true} ~input~0 := 5; {552#(<= 5 main_~input~0)} is VALID [2020-07-18 04:57:29,184 INFO L263 TraceCheckUtils]: 5: Hoare triple {552#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {548#true} is VALID [2020-07-18 04:57:29,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,185 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-18 04:57:29,185 INFO L263 TraceCheckUtils]: 8: Hoare triple {574#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {548#true} is VALID [2020-07-18 04:57:29,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {548#true} ~x := #in~x; {589#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,187 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-18 04:57:29,187 INFO L263 TraceCheckUtils]: 11: Hoare triple {589#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {548#true} is VALID [2020-07-18 04:57:29,188 INFO L280 TraceCheckUtils]: 12: Hoare triple {548#true} ~x := #in~x; {574#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,188 INFO L280 TraceCheckUtils]: 13: Hoare triple {574#(= |id_#in~x| id_~x)} assume 0 == ~x; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,189 INFO L280 TraceCheckUtils]: 14: Hoare triple {596#(= 0 |id_#in~x|)} #res := 0; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {596#(= 0 |id_#in~x|)} assume true; {596#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:29,191 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-18 04:57:29,191 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-18 04:57:29,192 INFO L280 TraceCheckUtils]: 18: Hoare triple {595#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,193 INFO L280 TraceCheckUtils]: 19: Hoare triple {595#(<= |id2_#in~x| 1)} havoc #t~ret1; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,193 INFO L280 TraceCheckUtils]: 20: Hoare triple {595#(<= |id2_#in~x| 1)} assume true; {595#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:29,195 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-18 04:57:29,195 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-18 04:57:29,196 INFO L280 TraceCheckUtils]: 23: Hoare triple {588#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:29,197 INFO L280 TraceCheckUtils]: 24: Hoare triple {588#(<= |id_#in~x| 2)} havoc #t~ret0; {588#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:29,197 INFO L280 TraceCheckUtils]: 25: Hoare triple {588#(<= |id_#in~x| 2)} assume true; {588#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:29,198 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {588#(<= |id_#in~x| 2)} {552#(<= 5 main_~input~0)} #48#return; {549#false} is VALID [2020-07-18 04:57:29,199 INFO L280 TraceCheckUtils]: 27: Hoare triple {549#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {549#false} is VALID [2020-07-18 04:57:29,199 INFO L280 TraceCheckUtils]: 28: Hoare triple {549#false} ~result~0 := #t~ret2; {549#false} is VALID [2020-07-18 04:57:29,199 INFO L280 TraceCheckUtils]: 29: Hoare triple {549#false} havoc #t~ret2; {549#false} is VALID [2020-07-18 04:57:29,199 INFO L280 TraceCheckUtils]: 30: Hoare triple {549#false} assume 5 == ~result~0; {549#false} is VALID [2020-07-18 04:57:29,200 INFO L280 TraceCheckUtils]: 31: Hoare triple {549#false} assume !false; {549#false} is VALID [2020-07-18 04:57:29,202 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-18 04:57:29,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2046644852] [2020-07-18 04:57:29,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:29,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 04:57:29,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77067215] [2020-07-18 04:57:29,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-18 04:57:29,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:29,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 04:57:29,241 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-18 04:57:29,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 04:57:29,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:29,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 04:57:29,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:57:29,242 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2020-07-18 04:57:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:29,562 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-18 04:57:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 04:57:29,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-18 04:57:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:57:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-18 04:57:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:57:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-18 04:57:29,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-18 04:57:29,632 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-18 04:57:29,635 INFO L225 Difference]: With dead ends: 55 [2020-07-18 04:57:29,635 INFO L226 Difference]: Without dead ends: 49 [2020-07-18 04:57:29,636 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-18 04:57:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-18 04:57:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2020-07-18 04:57:29,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:29,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 42 states. [2020-07-18 04:57:29,688 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 42 states. [2020-07-18 04:57:29,688 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 42 states. [2020-07-18 04:57:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:29,692 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-18 04:57:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-18 04:57:29,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:29,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:29,693 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 49 states. [2020-07-18 04:57:29,694 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 49 states. [2020-07-18 04:57:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:29,697 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-18 04:57:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-18 04:57:29,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:29,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:29,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:29,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 04:57:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-18 04:57:29,701 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2020-07-18 04:57:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:29,702 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-18 04:57:29,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 04:57:29,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-18 04:57:29,754 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-18 04:57:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-18 04:57:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 04:57:29,756 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:29,756 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-18 04:57:29,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:57:29,757 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2006293766, now seen corresponding path program 1 times [2020-07-18 04:57:29,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:29,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1869543117] [2020-07-18 04:57:29,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} assume true; {897#true} is VALID [2020-07-18 04:57:29,797 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {897#true} {897#true} #44#return; {897#true} is VALID [2020-07-18 04:57:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:29,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,951 INFO L280 TraceCheckUtils]: 2: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,955 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-18 04:57:29,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,956 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-18 04:57:29,957 INFO L263 TraceCheckUtils]: 2: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-18 04:57:29,957 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,958 INFO L280 TraceCheckUtils]: 4: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,958 INFO L280 TraceCheckUtils]: 5: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,959 INFO L280 TraceCheckUtils]: 6: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,960 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-18 04:57:29,960 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-18 04:57:29,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,961 INFO L280 TraceCheckUtils]: 10: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,962 INFO L280 TraceCheckUtils]: 11: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,963 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-18 04:57:29,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,968 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-18 04:57:29,969 INFO L263 TraceCheckUtils]: 2: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-18 04:57:29,972 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,972 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-18 04:57:29,972 INFO L263 TraceCheckUtils]: 5: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-18 04:57:29,973 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,975 INFO L280 TraceCheckUtils]: 9: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,976 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-18 04:57:29,977 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-18 04:57:29,977 INFO L280 TraceCheckUtils]: 12: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,978 INFO L280 TraceCheckUtils]: 13: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,978 INFO L280 TraceCheckUtils]: 14: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,980 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-18 04:57:29,980 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-18 04:57:29,981 INFO L280 TraceCheckUtils]: 17: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:29,981 INFO L280 TraceCheckUtils]: 18: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:29,982 INFO L280 TraceCheckUtils]: 19: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:29,983 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-18 04:57:29,984 INFO L280 TraceCheckUtils]: 0: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,985 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-18 04:57:29,985 INFO L263 TraceCheckUtils]: 2: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-18 04:57:29,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,986 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-18 04:57:29,987 INFO L263 TraceCheckUtils]: 5: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-18 04:57:29,987 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:29,988 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-18 04:57:29,988 INFO L263 TraceCheckUtils]: 8: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-18 04:57:29,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:29,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:29,992 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-18 04:57:29,992 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-18 04:57:29,993 INFO L280 TraceCheckUtils]: 15: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,994 INFO L280 TraceCheckUtils]: 16: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,994 INFO L280 TraceCheckUtils]: 17: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:29,996 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-18 04:57:29,996 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-18 04:57:29,997 INFO L280 TraceCheckUtils]: 20: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:29,997 INFO L280 TraceCheckUtils]: 21: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:29,998 INFO L280 TraceCheckUtils]: 22: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:29,999 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-18 04:57:30,000 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-18 04:57:30,001 INFO L280 TraceCheckUtils]: 25: Hoare triple {953#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:57:30,001 INFO L280 TraceCheckUtils]: 26: Hoare triple {953#(<= |id_#in~x| 3)} havoc #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:57:30,002 INFO L280 TraceCheckUtils]: 27: Hoare triple {953#(<= |id_#in~x| 3)} assume true; {953#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:57:30,003 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {953#(<= |id_#in~x| 3)} {901#(<= 5 main_~input~0)} #48#return; {898#false} is VALID [2020-07-18 04:57:30,004 INFO L263 TraceCheckUtils]: 0: Hoare triple {897#true} call ULTIMATE.init(); {897#true} is VALID [2020-07-18 04:57:30,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {897#true} assume true; {897#true} is VALID [2020-07-18 04:57:30,005 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {897#true} {897#true} #44#return; {897#true} is VALID [2020-07-18 04:57:30,005 INFO L263 TraceCheckUtils]: 3: Hoare triple {897#true} call #t~ret3 := main(); {897#true} is VALID [2020-07-18 04:57:30,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {897#true} ~input~0 := 5; {901#(<= 5 main_~input~0)} is VALID [2020-07-18 04:57:30,006 INFO L263 TraceCheckUtils]: 5: Hoare triple {901#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {897#true} is VALID [2020-07-18 04:57:30,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:30,007 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-18 04:57:30,007 INFO L263 TraceCheckUtils]: 8: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-18 04:57:30,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:30,009 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-18 04:57:30,009 INFO L263 TraceCheckUtils]: 11: Hoare triple {954#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {897#true} is VALID [2020-07-18 04:57:30,009 INFO L280 TraceCheckUtils]: 12: Hoare triple {897#true} ~x := #in~x; {931#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:30,010 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-18 04:57:30,010 INFO L263 TraceCheckUtils]: 14: Hoare triple {931#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {897#true} is VALID [2020-07-18 04:57:30,011 INFO L280 TraceCheckUtils]: 15: Hoare triple {897#true} ~x := #in~x; {954#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:30,011 INFO L280 TraceCheckUtils]: 16: Hoare triple {954#(= id2_~x |id2_#in~x|)} assume 0 == ~x; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:30,012 INFO L280 TraceCheckUtils]: 17: Hoare triple {975#(= 0 |id2_#in~x|)} #res := 0; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:30,013 INFO L280 TraceCheckUtils]: 18: Hoare triple {975#(= 0 |id2_#in~x|)} assume true; {975#(= 0 |id2_#in~x|)} is VALID [2020-07-18 04:57:30,014 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-18 04:57:30,014 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-18 04:57:30,015 INFO L280 TraceCheckUtils]: 21: Hoare triple {974#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:30,015 INFO L280 TraceCheckUtils]: 22: Hoare triple {974#(<= |id_#in~x| 1)} havoc #t~ret0; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:30,016 INFO L280 TraceCheckUtils]: 23: Hoare triple {974#(<= |id_#in~x| 1)} assume true; {974#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:57:30,017 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-18 04:57:30,018 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-18 04:57:30,018 INFO L280 TraceCheckUtils]: 26: Hoare triple {968#(<= |id2_#in~x| 2)} #res := 1 + #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:30,019 INFO L280 TraceCheckUtils]: 27: Hoare triple {968#(<= |id2_#in~x| 2)} havoc #t~ret1; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:30,019 INFO L280 TraceCheckUtils]: 28: Hoare triple {968#(<= |id2_#in~x| 2)} assume true; {968#(<= |id2_#in~x| 2)} is VALID [2020-07-18 04:57:30,021 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-18 04:57:30,021 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-18 04:57:30,022 INFO L280 TraceCheckUtils]: 31: Hoare triple {953#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:57:30,022 INFO L280 TraceCheckUtils]: 32: Hoare triple {953#(<= |id_#in~x| 3)} havoc #t~ret0; {953#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:57:30,023 INFO L280 TraceCheckUtils]: 33: Hoare triple {953#(<= |id_#in~x| 3)} assume true; {953#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:57:30,024 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {953#(<= |id_#in~x| 3)} {901#(<= 5 main_~input~0)} #48#return; {898#false} is VALID [2020-07-18 04:57:30,024 INFO L280 TraceCheckUtils]: 35: Hoare triple {898#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {898#false} is VALID [2020-07-18 04:57:30,024 INFO L280 TraceCheckUtils]: 36: Hoare triple {898#false} ~result~0 := #t~ret2; {898#false} is VALID [2020-07-18 04:57:30,025 INFO L280 TraceCheckUtils]: 37: Hoare triple {898#false} havoc #t~ret2; {898#false} is VALID [2020-07-18 04:57:30,025 INFO L280 TraceCheckUtils]: 38: Hoare triple {898#false} assume 5 == ~result~0; {898#false} is VALID [2020-07-18 04:57:30,025 INFO L280 TraceCheckUtils]: 39: Hoare triple {898#false} assume !false; {898#false} is VALID [2020-07-18 04:57:30,027 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-18 04:57:30,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1869543117] [2020-07-18 04:57:30,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:30,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 04:57:30,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357063774] [2020-07-18 04:57:30,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-18 04:57:30,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:30,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 04:57:30,069 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-18 04:57:30,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 04:57:30,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:30,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 04:57:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-18 04:57:30,070 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2020-07-18 04:57:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:30,417 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-07-18 04:57:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 04:57:30,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-18 04:57:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 04:57:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-18 04:57:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 04:57:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-18 04:57:30,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2020-07-18 04:57:30,495 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-18 04:57:30,498 INFO L225 Difference]: With dead ends: 65 [2020-07-18 04:57:30,498 INFO L226 Difference]: Without dead ends: 59 [2020-07-18 04:57:30,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-18 04:57:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-18 04:57:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-18 04:57:30,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:30,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-18 04:57:30,561 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-18 04:57:30,561 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-18 04:57:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:30,565 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-18 04:57:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-18 04:57:30,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:30,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:30,567 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-18 04:57:30,567 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-18 04:57:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:30,570 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-18 04:57:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-18 04:57:30,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:30,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:30,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:30,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-18 04:57:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-07-18 04:57:30,574 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2020-07-18 04:57:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:30,574 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-07-18 04:57:30,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 04:57:30,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2020-07-18 04:57:30,644 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-18 04:57:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-18 04:57:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 04:57:30,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:30,645 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-18 04:57:30,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:57:30,646 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash 940355172, now seen corresponding path program 2 times [2020-07-18 04:57:30,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:30,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334141177] [2020-07-18 04:57:30,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:30,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} assume true; {1328#true} is VALID [2020-07-18 04:57:30,708 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1328#true} {1328#true} #44#return; {1328#true} is VALID [2020-07-18 04:57:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:30,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:30,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,953 INFO L280 TraceCheckUtils]: 3: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,956 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-18 04:57:30,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:30,958 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-18 04:57:30,958 INFO L263 TraceCheckUtils]: 2: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-18 04:57:30,959 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:30,959 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,960 INFO L280 TraceCheckUtils]: 5: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,962 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-18 04:57:30,962 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-18 04:57:30,963 INFO L280 TraceCheckUtils]: 9: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,964 INFO L280 TraceCheckUtils]: 11: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,965 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-18 04:57:30,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:30,967 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-18 04:57:30,967 INFO L263 TraceCheckUtils]: 2: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-18 04:57:30,968 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:30,968 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-18 04:57:30,969 INFO L263 TraceCheckUtils]: 5: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-18 04:57:30,969 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:30,970 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,970 INFO L280 TraceCheckUtils]: 8: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,971 INFO L280 TraceCheckUtils]: 9: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,973 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-18 04:57:30,974 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-18 04:57:30,975 INFO L280 TraceCheckUtils]: 12: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,975 INFO L280 TraceCheckUtils]: 13: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,976 INFO L280 TraceCheckUtils]: 14: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,977 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-18 04:57:30,978 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-18 04:57:30,979 INFO L280 TraceCheckUtils]: 17: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:30,979 INFO L280 TraceCheckUtils]: 18: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:30,980 INFO L280 TraceCheckUtils]: 19: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:30,981 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-18 04:57:30,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:30,983 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-18 04:57:30,983 INFO L263 TraceCheckUtils]: 2: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-18 04:57:30,984 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:30,984 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-18 04:57:30,984 INFO L263 TraceCheckUtils]: 5: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-18 04:57:30,985 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:30,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-18 04:57:30,986 INFO L263 TraceCheckUtils]: 8: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-18 04:57:30,986 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:30,987 INFO L280 TraceCheckUtils]: 10: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,988 INFO L280 TraceCheckUtils]: 11: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,988 INFO L280 TraceCheckUtils]: 12: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:30,989 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-18 04:57:30,990 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-18 04:57:30,990 INFO L280 TraceCheckUtils]: 15: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,991 INFO L280 TraceCheckUtils]: 16: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,991 INFO L280 TraceCheckUtils]: 17: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:30,993 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-18 04:57:30,993 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-18 04:57:30,994 INFO L280 TraceCheckUtils]: 20: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:30,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:30,995 INFO L280 TraceCheckUtils]: 22: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:30,996 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-18 04:57:30,997 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-18 04:57:30,998 INFO L280 TraceCheckUtils]: 25: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:30,998 INFO L280 TraceCheckUtils]: 26: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:30,999 INFO L280 TraceCheckUtils]: 27: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:31,000 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-18 04:57:31,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:31,002 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-18 04:57:31,003 INFO L263 TraceCheckUtils]: 2: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-18 04:57:31,003 INFO L280 TraceCheckUtils]: 3: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:31,004 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-18 04:57:31,004 INFO L263 TraceCheckUtils]: 5: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-18 04:57:31,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:31,010 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-18 04:57:31,010 INFO L263 TraceCheckUtils]: 8: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-18 04:57:31,011 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:31,012 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-18 04:57:31,012 INFO L263 TraceCheckUtils]: 11: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-18 04:57:31,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:31,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:31,014 INFO L280 TraceCheckUtils]: 14: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:31,015 INFO L280 TraceCheckUtils]: 15: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:31,016 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-18 04:57:31,016 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-18 04:57:31,017 INFO L280 TraceCheckUtils]: 18: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:31,017 INFO L280 TraceCheckUtils]: 19: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:31,018 INFO L280 TraceCheckUtils]: 20: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:31,019 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-18 04:57:31,020 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-18 04:57:31,020 INFO L280 TraceCheckUtils]: 23: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:31,021 INFO L280 TraceCheckUtils]: 24: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:31,023 INFO L280 TraceCheckUtils]: 25: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:31,024 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-18 04:57:31,025 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-18 04:57:31,026 INFO L280 TraceCheckUtils]: 28: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:31,026 INFO L280 TraceCheckUtils]: 29: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:31,027 INFO L280 TraceCheckUtils]: 30: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:31,028 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-18 04:57:31,028 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-18 04:57:31,029 INFO L280 TraceCheckUtils]: 33: Hoare triple {1400#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:57:31,030 INFO L280 TraceCheckUtils]: 34: Hoare triple {1400#(<= |id_#in~x| 4)} havoc #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:57:31,030 INFO L280 TraceCheckUtils]: 35: Hoare triple {1400#(<= |id_#in~x| 4)} assume true; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:57:31,031 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1400#(<= |id_#in~x| 4)} {1332#(<= 5 main_~input~0)} #48#return; {1329#false} is VALID [2020-07-18 04:57:31,034 INFO L263 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1328#true} is VALID [2020-07-18 04:57:31,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {1328#true} assume true; {1328#true} is VALID [2020-07-18 04:57:31,034 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1328#true} {1328#true} #44#return; {1328#true} is VALID [2020-07-18 04:57:31,034 INFO L263 TraceCheckUtils]: 3: Hoare triple {1328#true} call #t~ret3 := main(); {1328#true} is VALID [2020-07-18 04:57:31,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {1328#true} ~input~0 := 5; {1332#(<= 5 main_~input~0)} is VALID [2020-07-18 04:57:31,035 INFO L263 TraceCheckUtils]: 5: Hoare triple {1332#(<= 5 main_~input~0)} call #t~ret2 := id(~input~0); {1328#true} is VALID [2020-07-18 04:57:31,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:31,036 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-18 04:57:31,037 INFO L263 TraceCheckUtils]: 8: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-18 04:57:31,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:31,038 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-18 04:57:31,038 INFO L263 TraceCheckUtils]: 11: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-18 04:57:31,039 INFO L280 TraceCheckUtils]: 12: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:31,039 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-18 04:57:31,039 INFO L263 TraceCheckUtils]: 14: Hoare triple {1370#(= |id_#in~x| id_~x)} call #t~ret0 := id2(~x - 1); {1328#true} is VALID [2020-07-18 04:57:31,040 INFO L280 TraceCheckUtils]: 15: Hoare triple {1328#true} ~x := #in~x; {1401#(= id2_~x |id2_#in~x|)} is VALID [2020-07-18 04:57:31,041 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-18 04:57:31,041 INFO L263 TraceCheckUtils]: 17: Hoare triple {1401#(= id2_~x |id2_#in~x|)} call #t~ret1 := id(~x - 1); {1328#true} is VALID [2020-07-18 04:57:31,041 INFO L280 TraceCheckUtils]: 18: Hoare triple {1328#true} ~x := #in~x; {1370#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:57:31,042 INFO L280 TraceCheckUtils]: 19: Hoare triple {1370#(= |id_#in~x| id_~x)} assume 0 == ~x; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:31,042 INFO L280 TraceCheckUtils]: 20: Hoare triple {1444#(= 0 |id_#in~x|)} #res := 0; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:31,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {1444#(= 0 |id_#in~x|)} assume true; {1444#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:57:31,044 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-18 04:57:31,047 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-18 04:57:31,047 INFO L280 TraceCheckUtils]: 24: Hoare triple {1443#(<= |id2_#in~x| 1)} #res := 1 + #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:31,048 INFO L280 TraceCheckUtils]: 25: Hoare triple {1443#(<= |id2_#in~x| 1)} havoc #t~ret1; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:31,048 INFO L280 TraceCheckUtils]: 26: Hoare triple {1443#(<= |id2_#in~x| 1)} assume true; {1443#(<= |id2_#in~x| 1)} is VALID [2020-07-18 04:57:31,058 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-18 04:57:31,059 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-18 04:57:31,059 INFO L280 TraceCheckUtils]: 29: Hoare triple {1437#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:31,060 INFO L280 TraceCheckUtils]: 30: Hoare triple {1437#(<= |id_#in~x| 2)} havoc #t~ret0; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:31,060 INFO L280 TraceCheckUtils]: 31: Hoare triple {1437#(<= |id_#in~x| 2)} assume true; {1437#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:57:31,061 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-18 04:57:31,062 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-18 04:57:31,063 INFO L280 TraceCheckUtils]: 34: Hoare triple {1423#(<= |id2_#in~x| 3)} #res := 1 + #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:31,063 INFO L280 TraceCheckUtils]: 35: Hoare triple {1423#(<= |id2_#in~x| 3)} havoc #t~ret1; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:31,064 INFO L280 TraceCheckUtils]: 36: Hoare triple {1423#(<= |id2_#in~x| 3)} assume true; {1423#(<= |id2_#in~x| 3)} is VALID [2020-07-18 04:57:31,065 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-18 04:57:31,065 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-18 04:57:31,066 INFO L280 TraceCheckUtils]: 39: Hoare triple {1400#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:57:31,067 INFO L280 TraceCheckUtils]: 40: Hoare triple {1400#(<= |id_#in~x| 4)} havoc #t~ret0; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:57:31,067 INFO L280 TraceCheckUtils]: 41: Hoare triple {1400#(<= |id_#in~x| 4)} assume true; {1400#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:57:31,068 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1400#(<= |id_#in~x| 4)} {1332#(<= 5 main_~input~0)} #48#return; {1329#false} is VALID [2020-07-18 04:57:31,068 INFO L280 TraceCheckUtils]: 43: Hoare triple {1329#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1329#false} is VALID [2020-07-18 04:57:31,068 INFO L280 TraceCheckUtils]: 44: Hoare triple {1329#false} ~result~0 := #t~ret2; {1329#false} is VALID [2020-07-18 04:57:31,069 INFO L280 TraceCheckUtils]: 45: Hoare triple {1329#false} havoc #t~ret2; {1329#false} is VALID [2020-07-18 04:57:31,069 INFO L280 TraceCheckUtils]: 46: Hoare triple {1329#false} assume 5 == ~result~0; {1329#false} is VALID [2020-07-18 04:57:31,069 INFO L280 TraceCheckUtils]: 47: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2020-07-18 04:57:31,072 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-18 04:57:31,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334141177] [2020-07-18 04:57:31,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:31,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-18 04:57:31,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975077230] [2020-07-18 04:57:31,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-18 04:57:31,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:31,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 04:57:31,129 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-18 04:57:31,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 04:57:31,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:31,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 04:57:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-18 04:57:31,130 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 10 states. [2020-07-18 04:57:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:31,600 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-18 04:57:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 04:57:31,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-07-18 04:57:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 04:57:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-18 04:57:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 04:57:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-18 04:57:31,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2020-07-18 04:57:31,691 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-18 04:57:31,695 INFO L225 Difference]: With dead ends: 75 [2020-07-18 04:57:31,695 INFO L226 Difference]: Without dead ends: 69 [2020-07-18 04:57:31,696 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-18 04:57:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-18 04:57:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2020-07-18 04:57:31,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:31,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 52 states. [2020-07-18 04:57:31,799 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 52 states. [2020-07-18 04:57:31,799 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 52 states. [2020-07-18 04:57:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:31,806 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-07-18 04:57:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-18 04:57:31,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:31,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:31,807 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 69 states. [2020-07-18 04:57:31,807 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 69 states. [2020-07-18 04:57:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:31,812 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-07-18 04:57:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-07-18 04:57:31,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:31,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:31,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:31,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-18 04:57:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-18 04:57:31,816 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2020-07-18 04:57:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:31,817 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-18 04:57:31,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 04:57:31,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-18 04:57:31,898 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-18 04:57:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-18 04:57:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 04:57:31,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:31,900 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-18 04:57:31,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 04:57:31,901 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash 826985242, now seen corresponding path program 2 times [2020-07-18 04:57:31,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:31,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1846791817] [2020-07-18 04:57:31,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:57:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:57:31,960 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 04:57:31,960 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 04:57:31,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: id2ENTRY has no Hoare annotation [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 04:57:32,001 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-18 04:57:32,002 WARN L170 areAnnotationChecker]: id2FINAL has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: id2EXIT has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-18 04:57:32,003 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-18 04:57:32,004 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-18 04:57:32,004 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-18 04:57:32,004 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-18 04:57:32,004 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 04:57:32,004 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-18 04:57:32,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:57:32 BoogieIcfgContainer [2020-07-18 04:57:32,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:57:32,009 INFO L168 Benchmark]: Toolchain (without parser) took 5538.98 ms. Allocated memory was 144.7 MB in the beginning and 284.7 MB in the end (delta: 140.0 MB). Free memory was 103.0 MB in the beginning and 220.6 MB in the end (delta: -117.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:32,009 INFO L168 Benchmark]: CDTParser took 2.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 04:57:32,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.15 ms. Allocated memory is still 144.7 MB. Free memory was 102.6 MB in the beginning and 93.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:32,011 INFO L168 Benchmark]: Boogie Preprocessor took 126.57 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 93.0 MB in the beginning and 180.5 MB in the end (delta: -87.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:32,011 INFO L168 Benchmark]: RCFGBuilder took 340.37 ms. Allocated memory is still 201.3 MB. Free memory was 180.5 MB in the beginning and 162.1 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:32,012 INFO L168 Benchmark]: TraceAbstraction took 4831.16 ms. Allocated memory was 201.3 MB in the beginning and 284.7 MB in the end (delta: 83.4 MB). Free memory was 162.1 MB in the beginning and 220.6 MB in the end (delta: -58.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:32,015 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 2.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 233.15 ms. Allocated memory is still 144.7 MB. Free memory was 102.6 MB in the beginning and 93.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.57 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 93.0 MB in the beginning and 180.5 MB in the end (delta: -87.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 340.37 ms. Allocated memory is still 201.3 MB. Free memory was 180.5 MB in the beginning and 162.1 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4831.16 ms. Allocated memory was 201.3 MB in the beginning and 284.7 MB in the end (delta: 83.4 MB). Free memory was 162.1 MB in the beginning and 220.6 MB in the end (delta: -58.5 MB). Peak memory consumption was 24.9 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.7s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 2.1s, 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.2s 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...