/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/id_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:52:43,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:52:43,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:52:43,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:52:43,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:52:43,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:52:43,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:52:43,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:52:43,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:52:43,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:52:43,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:52:43,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:52:43,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:52:43,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:52:43,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:52:43,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:52:43,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:52:43,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:52:43,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:52:43,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:52:43,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:52:43,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:52:43,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:52:43,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:52:43,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:52:43,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:52:43,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:52:43,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:52:43,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:52:43,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:52:43,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:52:43,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:52:43,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:52:43,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:52:43,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:52:43,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:52:43,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:52:43,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:52:43,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:52:43,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:52:43,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:52:43,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:52:43,168 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:52:43,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:52:43,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:52:43,170 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:52:43,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:52:43,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:52:43,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:52:43,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:52:43,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:52:43,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:52:43,171 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:52:43,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:52:43,171 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:52:43,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:52:43,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:52:43,172 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:52:43,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:52:43,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:52:43,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:52:43,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:52:43,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:52:43,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:52:43,173 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:52:43,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:52:43,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:52:43,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:52:43,461 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:52:43,462 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:52:43,462 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c [2020-07-11 00:52:43,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd4ef977/9e9d906ae15a4c459bda71467a4971e5/FLAG69c640d17 [2020-07-11 00:52:43,990 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:52:43,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c [2020-07-11 00:52:43,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd4ef977/9e9d906ae15a4c459bda71467a4971e5/FLAG69c640d17 [2020-07-11 00:52:44,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd4ef977/9e9d906ae15a4c459bda71467a4971e5 [2020-07-11 00:52:44,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:52:44,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:52:44,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:52:44,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:52:44,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:52:44,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c053451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44, skipping insertion in model container [2020-07-11 00:52:44,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:52:44,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:52:44,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:52:44,660 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:52:44,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:52:44,694 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:52:44,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44 WrapperNode [2020-07-11 00:52:44,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:52:44,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:52:44,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:52:44,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:52:44,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (1/1) ... [2020-07-11 00:52:44,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:52:44,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:52:44,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:52:44,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:52:44,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:52:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:52:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:52:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-11 00:52:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:52:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:52:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:52:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-11 00:52:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:52:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:52:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:52:45,198 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:52:45,199 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:52:45,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:52:45 BoogieIcfgContainer [2020-07-11 00:52:45,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:52:45,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:52:45,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:52:45,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:52:45,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:52:44" (1/3) ... [2020-07-11 00:52:45,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aedf529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:52:45, skipping insertion in model container [2020-07-11 00:52:45,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:52:44" (2/3) ... [2020-07-11 00:52:45,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aedf529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:52:45, skipping insertion in model container [2020-07-11 00:52:45,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:52:45" (3/3) ... [2020-07-11 00:52:45,211 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-1.c [2020-07-11 00:52:45,222 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:52:45,229 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:52:45,244 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:52:45,264 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:52:45,264 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:52:45,265 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:52:45,265 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:52:45,265 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:52:45,265 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:52:45,265 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:52:45,265 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:52:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-11 00:52:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 00:52:45,289 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:45,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:52:45,290 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-07-11 00:52:45,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:45,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522497303] [2020-07-11 00:52:45,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:45,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-11 00:52:45,486 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-11 00:52:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:45,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:45,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:45,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:45,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:45,556 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-11 00:52:45,557 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2020-07-11 00:52:45,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-11 00:52:45,558 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-11 00:52:45,558 INFO L263 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2020-07-11 00:52:45,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#true} ~input~0 := 5; {32#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:45,560 INFO L263 TraceCheckUtils]: 5: Hoare triple {32#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {28#true} is VALID [2020-07-11 00:52:45,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:45,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:45,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:45,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:45,571 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-11 00:52:45,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {29#false} is VALID [2020-07-11 00:52:45,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} ~result~0 := #t~ret1; {29#false} is VALID [2020-07-11 00:52:45,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {29#false} havoc #t~ret1; {29#false} is VALID [2020-07-11 00:52:45,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume 5 == ~result~0; {29#false} is VALID [2020-07-11 00:52:45,574 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-11 00:52:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:52:45,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522497303] [2020-07-11 00:52:45,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:52:45,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:52:45,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052879777] [2020-07-11 00:52:45,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:52:45,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:45,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:52:45,659 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-11 00:52:45,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:52:45,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:45,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:52:45,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:52:45,677 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-07-11 00:52:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:45,920 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-11 00:52:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:52:45,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:52:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:52:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-11 00:52:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:52:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-11 00:52:45,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-11 00:52:46,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:46,018 INFO L225 Difference]: With dead ends: 37 [2020-07-11 00:52:46,019 INFO L226 Difference]: Without dead ends: 23 [2020-07-11 00:52:46,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:52:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-11 00:52:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-11 00:52:46,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:46,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:46,105 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:46,105 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:46,111 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-11 00:52:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 00:52:46,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:46,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:46,113 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:46,113 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-11 00:52:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:46,118 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-11 00:52:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 00:52:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:46,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:46,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:46,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-11 00:52:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-11 00:52:46,126 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-07-11 00:52:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:46,126 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-11 00:52:46,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:52:46,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2020-07-11 00:52:46,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 00:52:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 00:52:46,172 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:46,172 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] [2020-07-11 00:52:46,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:52:46,173 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-07-11 00:52:46,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:46,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260006344] [2020-07-11 00:52:46,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-11 00:52:46,231 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-11 00:52:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,335 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= |id_#in~x| id_~x)} assume !(0 == ~x); {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,337 INFO L263 TraceCheckUtils]: 2: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-11 00:52:46,338 INFO L280 TraceCheckUtils]: 3: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,339 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,343 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,344 INFO L280 TraceCheckUtils]: 8: Hoare triple {234#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,345 INFO L280 TraceCheckUtils]: 9: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,346 INFO L280 TraceCheckUtils]: 10: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,348 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-11 00:52:46,349 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-11 00:52:46,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-11 00:52:46,350 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-11 00:52:46,350 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2020-07-11 00:52:46,352 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} ~input~0 := 5; {214#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:46,352 INFO L263 TraceCheckUtils]: 5: Hoare triple {214#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {210#true} is VALID [2020-07-11 00:52:46,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {228#(= |id_#in~x| id_~x)} assume !(0 == ~x); {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,354 INFO L263 TraceCheckUtils]: 8: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-11 00:52:46,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,357 INFO L280 TraceCheckUtils]: 11: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,360 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {235#(= 0 |id_#in~x|)} {228#(= |id_#in~x| id_~x)} #37#return; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,361 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,362 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,362 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,363 INFO L280 TraceCheckUtils]: 17: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,365 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-11 00:52:46,365 INFO L280 TraceCheckUtils]: 19: Hoare triple {211#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {211#false} is VALID [2020-07-11 00:52:46,366 INFO L280 TraceCheckUtils]: 20: Hoare triple {211#false} ~result~0 := #t~ret1; {211#false} is VALID [2020-07-11 00:52:46,366 INFO L280 TraceCheckUtils]: 21: Hoare triple {211#false} havoc #t~ret1; {211#false} is VALID [2020-07-11 00:52:46,366 INFO L280 TraceCheckUtils]: 22: Hoare triple {211#false} assume 5 == ~result~0; {211#false} is VALID [2020-07-11 00:52:46,367 INFO L280 TraceCheckUtils]: 23: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-11 00:52:46,368 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-11 00:52:46,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260006344] [2020-07-11 00:52:46,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:46,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:52:46,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158634093] [2020-07-11 00:52:46,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-11 00:52:46,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:46,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:52:46,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:46,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:52:46,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:46,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:52:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:52:46,404 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-07-11 00:52:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:46,583 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-11 00:52:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:52:46,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-11 00:52:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:52:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-11 00:52:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:52:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-11 00:52:46,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-11 00:52:46,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:46,646 INFO L225 Difference]: With dead ends: 34 [2020-07-11 00:52:46,647 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 00:52:46,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:52:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 00:52:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 00:52:46,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:46,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:46,689 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:46,689 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:46,693 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-11 00:52:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 00:52:46,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:46,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:46,694 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:46,694 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:52:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:46,697 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-11 00:52:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 00:52:46,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:46,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:46,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:46,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 00:52:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-11 00:52:46,702 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-07-11 00:52:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:46,703 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-11 00:52:46,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:52:46,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-11 00:52:46,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 00:52:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-11 00:52:46,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:46,745 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:52:46,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:52:46,746 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-07-11 00:52:46,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:46,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193166409] [2020-07-11 00:52:46,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-11 00:52:46,794 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-11 00:52:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:46,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,893 INFO L280 TraceCheckUtils]: 2: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,895 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,897 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:46,898 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,899 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,901 INFO L280 TraceCheckUtils]: 6: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,902 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,905 INFO L280 TraceCheckUtils]: 10: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,905 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,907 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,910 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:46,910 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,911 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,911 INFO L263 TraceCheckUtils]: 5: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:46,912 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,913 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,914 INFO L280 TraceCheckUtils]: 8: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,916 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,917 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,917 INFO L280 TraceCheckUtils]: 12: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,918 INFO L280 TraceCheckUtils]: 13: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,919 INFO L280 TraceCheckUtils]: 14: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,920 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,921 INFO L280 TraceCheckUtils]: 16: Hoare triple {462#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,922 INFO L280 TraceCheckUtils]: 17: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,923 INFO L280 TraceCheckUtils]: 18: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,923 INFO L280 TraceCheckUtils]: 19: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,925 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-11 00:52:46,926 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-11 00:52:46,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-11 00:52:46,927 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-11 00:52:46,927 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret2 := main(); {422#true} is VALID [2020-07-11 00:52:46,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} ~input~0 := 5; {426#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:46,929 INFO L263 TraceCheckUtils]: 5: Hoare triple {426#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {422#true} is VALID [2020-07-11 00:52:46,929 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,930 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,931 INFO L263 TraceCheckUtils]: 8: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:46,931 INFO L280 TraceCheckUtils]: 9: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {448#(= |id_#in~x| id_~x)} assume !(0 == ~x); {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,933 INFO L263 TraceCheckUtils]: 11: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-11 00:52:46,933 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:46,934 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,935 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,936 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:46,937 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {469#(= 0 |id_#in~x|)} {448#(= |id_#in~x| id_~x)} #37#return; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,938 INFO L280 TraceCheckUtils]: 17: Hoare triple {468#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,946 INFO L280 TraceCheckUtils]: 18: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,947 INFO L280 TraceCheckUtils]: 19: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,948 INFO L280 TraceCheckUtils]: 20: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:46,950 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {468#(<= |id_#in~x| 1)} {448#(= |id_#in~x| id_~x)} #37#return; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,951 INFO L280 TraceCheckUtils]: 22: Hoare triple {462#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,952 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,952 INFO L280 TraceCheckUtils]: 24: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,953 INFO L280 TraceCheckUtils]: 25: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:46,954 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-11 00:52:46,955 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {423#false} is VALID [2020-07-11 00:52:46,955 INFO L280 TraceCheckUtils]: 28: Hoare triple {423#false} ~result~0 := #t~ret1; {423#false} is VALID [2020-07-11 00:52:46,955 INFO L280 TraceCheckUtils]: 29: Hoare triple {423#false} havoc #t~ret1; {423#false} is VALID [2020-07-11 00:52:46,956 INFO L280 TraceCheckUtils]: 30: Hoare triple {423#false} assume 5 == ~result~0; {423#false} is VALID [2020-07-11 00:52:46,956 INFO L280 TraceCheckUtils]: 31: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-11 00:52:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-11 00:52:46,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193166409] [2020-07-11 00:52:46,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:46,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:52:46,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202792216] [2020-07-11 00:52:46,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-11 00:52:46,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:46,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:52:47,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:47,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:52:47,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:47,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:52:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:52:47,003 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-11 00:52:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:47,279 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-11 00:52:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:52:47,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-11 00:52:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:52:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-11 00:52:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:52:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-11 00:52:47,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2020-07-11 00:52:47,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:47,341 INFO L225 Difference]: With dead ends: 39 [2020-07-11 00:52:47,341 INFO L226 Difference]: Without dead ends: 33 [2020-07-11 00:52:47,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:52:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-11 00:52:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-11 00:52:47,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:47,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:47,381 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:47,381 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:47,384 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-11 00:52:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 00:52:47,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:47,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:47,385 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:47,386 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-11 00:52:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:47,388 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-11 00:52:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 00:52:47,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:47,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:47,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:47,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-11 00:52:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-11 00:52:47,392 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-07-11 00:52:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:47,393 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-11 00:52:47,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:52:47,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2020-07-11 00:52:47,442 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-11 00:52:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-11 00:52:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 00:52:47,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:47,444 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:52:47,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:52:47,445 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-07-11 00:52:47,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:47,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1242514515] [2020-07-11 00:52:47,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:47,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-11 00:52:47,485 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-11 00:52:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:47,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,606 INFO L280 TraceCheckUtils]: 3: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,607 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,609 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,610 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,610 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,611 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,612 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,613 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,615 INFO L280 TraceCheckUtils]: 10: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,616 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,617 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,619 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,621 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,622 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,622 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,623 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,625 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,628 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,629 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,630 INFO L280 TraceCheckUtils]: 16: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,630 INFO L280 TraceCheckUtils]: 17: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,633 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,636 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,637 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,637 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,638 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,638 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,639 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,639 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,640 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,641 INFO L280 TraceCheckUtils]: 10: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,642 INFO L280 TraceCheckUtils]: 12: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,643 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,644 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,644 INFO L280 TraceCheckUtils]: 15: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,645 INFO L280 TraceCheckUtils]: 16: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,646 INFO L280 TraceCheckUtils]: 17: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,647 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,648 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,649 INFO L280 TraceCheckUtils]: 20: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,650 INFO L280 TraceCheckUtils]: 21: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,650 INFO L280 TraceCheckUtils]: 22: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,652 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,653 INFO L280 TraceCheckUtils]: 24: Hoare triple {744#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,653 INFO L280 TraceCheckUtils]: 25: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,654 INFO L280 TraceCheckUtils]: 26: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,655 INFO L280 TraceCheckUtils]: 27: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,656 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-11 00:52:47,657 INFO L263 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2020-07-11 00:52:47,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-11 00:52:47,658 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-11 00:52:47,658 INFO L263 TraceCheckUtils]: 3: Hoare triple {688#true} call #t~ret2 := main(); {688#true} is VALID [2020-07-11 00:52:47,659 INFO L280 TraceCheckUtils]: 4: Hoare triple {688#true} ~input~0 := 5; {692#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:47,659 INFO L263 TraceCheckUtils]: 5: Hoare triple {692#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {688#true} is VALID [2020-07-11 00:52:47,660 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,661 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,661 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,662 INFO L280 TraceCheckUtils]: 10: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,663 INFO L263 TraceCheckUtils]: 11: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,663 INFO L280 TraceCheckUtils]: 12: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,664 INFO L280 TraceCheckUtils]: 13: Hoare triple {722#(= |id_#in~x| id_~x)} assume !(0 == ~x); {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,664 INFO L263 TraceCheckUtils]: 14: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-11 00:52:47,665 INFO L280 TraceCheckUtils]: 15: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:47,666 INFO L280 TraceCheckUtils]: 16: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,666 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,667 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:47,668 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {765#(= 0 |id_#in~x|)} {722#(= |id_#in~x| id_~x)} #37#return; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,669 INFO L280 TraceCheckUtils]: 20: Hoare triple {764#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,670 INFO L280 TraceCheckUtils]: 21: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,671 INFO L280 TraceCheckUtils]: 22: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,671 INFO L280 TraceCheckUtils]: 23: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:47,673 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {764#(<= |id_#in~x| 1)} {722#(= |id_#in~x| id_~x)} #37#return; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,674 INFO L280 TraceCheckUtils]: 25: Hoare triple {758#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,674 INFO L280 TraceCheckUtils]: 26: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,675 INFO L280 TraceCheckUtils]: 27: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,675 INFO L280 TraceCheckUtils]: 28: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:47,677 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {758#(<= |id_#in~x| 2)} {722#(= |id_#in~x| id_~x)} #37#return; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,678 INFO L280 TraceCheckUtils]: 30: Hoare triple {744#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,678 INFO L280 TraceCheckUtils]: 31: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,679 INFO L280 TraceCheckUtils]: 32: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,680 INFO L280 TraceCheckUtils]: 33: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:47,681 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-11 00:52:47,681 INFO L280 TraceCheckUtils]: 35: Hoare triple {689#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {689#false} is VALID [2020-07-11 00:52:47,682 INFO L280 TraceCheckUtils]: 36: Hoare triple {689#false} ~result~0 := #t~ret1; {689#false} is VALID [2020-07-11 00:52:47,682 INFO L280 TraceCheckUtils]: 37: Hoare triple {689#false} havoc #t~ret1; {689#false} is VALID [2020-07-11 00:52:47,682 INFO L280 TraceCheckUtils]: 38: Hoare triple {689#false} assume 5 == ~result~0; {689#false} is VALID [2020-07-11 00:52:47,682 INFO L280 TraceCheckUtils]: 39: Hoare triple {689#false} assume !false; {689#false} is VALID [2020-07-11 00:52:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-11 00:52:47,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1242514515] [2020-07-11 00:52:47,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:47,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:52:47,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702817036] [2020-07-11 00:52:47,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-11 00:52:47,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:47,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:52:47,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:47,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:52:47,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:52:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:52:47,728 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-07-11 00:52:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:47,949 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-11 00:52:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:52:47,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-11 00:52:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:52:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-11 00:52:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:52:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-11 00:52:47,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2020-07-11 00:52:48,023 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-11 00:52:48,024 INFO L225 Difference]: With dead ends: 44 [2020-07-11 00:52:48,025 INFO L226 Difference]: Without dead ends: 38 [2020-07-11 00:52:48,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-11 00:52:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-11 00:52:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-11 00:52:48,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:48,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:48,068 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:48,068 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:48,070 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-11 00:52:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 00:52:48,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:48,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:48,071 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:48,072 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-11 00:52:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:48,074 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-11 00:52:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 00:52:48,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:48,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:48,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:48,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-11 00:52:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-11 00:52:48,077 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-07-11 00:52:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:48,078 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-11 00:52:48,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:52:48,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2020-07-11 00:52:48,123 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-11 00:52:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 00:52:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 00:52:48,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:48,125 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:52:48,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:52:48,125 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-07-11 00:52:48,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:48,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [559356303] [2020-07-11 00:52:48,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:48,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-11 00:52:48,175 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-11 00:52:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:52:48,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,331 INFO L280 TraceCheckUtils]: 3: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,332 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,334 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,334 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,335 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,336 INFO L280 TraceCheckUtils]: 5: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,338 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,338 INFO L280 TraceCheckUtils]: 8: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,339 INFO L280 TraceCheckUtils]: 9: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,339 INFO L280 TraceCheckUtils]: 10: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,340 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,341 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,342 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,343 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,344 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,345 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,351 INFO L280 TraceCheckUtils]: 9: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,352 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,354 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,355 INFO L280 TraceCheckUtils]: 12: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,357 INFO L280 TraceCheckUtils]: 13: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,358 INFO L280 TraceCheckUtils]: 14: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,359 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,361 INFO L280 TraceCheckUtils]: 17: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,361 INFO L280 TraceCheckUtils]: 18: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,362 INFO L280 TraceCheckUtils]: 19: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,363 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,365 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,366 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,367 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,367 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,368 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,369 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,370 INFO L280 TraceCheckUtils]: 11: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,370 INFO L280 TraceCheckUtils]: 12: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,372 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,372 INFO L280 TraceCheckUtils]: 14: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,373 INFO L280 TraceCheckUtils]: 15: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,373 INFO L280 TraceCheckUtils]: 16: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,374 INFO L280 TraceCheckUtils]: 17: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,375 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,376 INFO L280 TraceCheckUtils]: 19: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,377 INFO L280 TraceCheckUtils]: 20: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,377 INFO L280 TraceCheckUtils]: 21: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,378 INFO L280 TraceCheckUtils]: 22: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,379 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,380 INFO L280 TraceCheckUtils]: 24: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,380 INFO L280 TraceCheckUtils]: 25: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,381 INFO L280 TraceCheckUtils]: 26: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,382 INFO L280 TraceCheckUtils]: 27: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,383 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,385 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,386 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,386 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,387 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,387 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,388 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,388 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,389 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,389 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,390 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,390 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,391 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,391 INFO L280 TraceCheckUtils]: 13: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,392 INFO L280 TraceCheckUtils]: 14: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,393 INFO L280 TraceCheckUtils]: 15: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,394 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,394 INFO L280 TraceCheckUtils]: 17: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,395 INFO L280 TraceCheckUtils]: 18: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,396 INFO L280 TraceCheckUtils]: 19: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,396 INFO L280 TraceCheckUtils]: 20: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,398 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,399 INFO L280 TraceCheckUtils]: 22: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,400 INFO L280 TraceCheckUtils]: 23: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,401 INFO L280 TraceCheckUtils]: 24: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,402 INFO L280 TraceCheckUtils]: 25: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,403 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,404 INFO L280 TraceCheckUtils]: 27: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,404 INFO L280 TraceCheckUtils]: 28: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,405 INFO L280 TraceCheckUtils]: 29: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,405 INFO L280 TraceCheckUtils]: 30: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,407 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,410 INFO L280 TraceCheckUtils]: 32: Hoare triple {1088#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,410 INFO L280 TraceCheckUtils]: 33: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,411 INFO L280 TraceCheckUtils]: 34: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,411 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,412 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-11 00:52:48,414 INFO L263 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2020-07-11 00:52:48,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-11 00:52:48,415 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-11 00:52:48,415 INFO L263 TraceCheckUtils]: 3: Hoare triple {1016#true} call #t~ret2 := main(); {1016#true} is VALID [2020-07-11 00:52:48,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#true} ~input~0 := 5; {1020#(<= 5 main_~input~0)} is VALID [2020-07-11 00:52:48,416 INFO L263 TraceCheckUtils]: 5: Hoare triple {1020#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {1016#true} is VALID [2020-07-11 00:52:48,416 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,417 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,418 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,419 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,420 INFO L280 TraceCheckUtils]: 13: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,420 INFO L263 TraceCheckUtils]: 14: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,421 INFO L280 TraceCheckUtils]: 15: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,421 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,422 INFO L263 TraceCheckUtils]: 17: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-11 00:52:48,422 INFO L280 TraceCheckUtils]: 18: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-11 00:52:48,423 INFO L280 TraceCheckUtils]: 19: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,423 INFO L280 TraceCheckUtils]: 20: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,424 INFO L280 TraceCheckUtils]: 21: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-11 00:52:48,425 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1131#(= 0 |id_#in~x|)} {1058#(= |id_#in~x| id_~x)} #37#return; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,426 INFO L280 TraceCheckUtils]: 23: Hoare triple {1130#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,426 INFO L280 TraceCheckUtils]: 24: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,427 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,428 INFO L280 TraceCheckUtils]: 26: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-11 00:52:48,429 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1130#(<= |id_#in~x| 1)} {1058#(= |id_#in~x| id_~x)} #37#return; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,429 INFO L280 TraceCheckUtils]: 28: Hoare triple {1124#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,430 INFO L280 TraceCheckUtils]: 29: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,431 INFO L280 TraceCheckUtils]: 30: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,431 INFO L280 TraceCheckUtils]: 31: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-11 00:52:48,432 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1124#(<= |id_#in~x| 2)} {1058#(= |id_#in~x| id_~x)} #37#return; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,433 INFO L280 TraceCheckUtils]: 33: Hoare triple {1110#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,434 INFO L280 TraceCheckUtils]: 34: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,434 INFO L280 TraceCheckUtils]: 35: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,435 INFO L280 TraceCheckUtils]: 36: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-11 00:52:48,436 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1110#(<= |id_#in~x| 3)} {1058#(= |id_#in~x| id_~x)} #37#return; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,437 INFO L280 TraceCheckUtils]: 38: Hoare triple {1088#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,437 INFO L280 TraceCheckUtils]: 39: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,438 INFO L280 TraceCheckUtils]: 40: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,439 INFO L280 TraceCheckUtils]: 41: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-11 00:52:48,440 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-11 00:52:48,440 INFO L280 TraceCheckUtils]: 43: Hoare triple {1017#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1017#false} is VALID [2020-07-11 00:52:48,440 INFO L280 TraceCheckUtils]: 44: Hoare triple {1017#false} ~result~0 := #t~ret1; {1017#false} is VALID [2020-07-11 00:52:48,440 INFO L280 TraceCheckUtils]: 45: Hoare triple {1017#false} havoc #t~ret1; {1017#false} is VALID [2020-07-11 00:52:48,441 INFO L280 TraceCheckUtils]: 46: Hoare triple {1017#false} assume 5 == ~result~0; {1017#false} is VALID [2020-07-11 00:52:48,441 INFO L280 TraceCheckUtils]: 47: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2020-07-11 00:52:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-11 00:52:48,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [559356303] [2020-07-11 00:52:48,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:52:48,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 00:52:48,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726096854] [2020-07-11 00:52:48,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-11 00:52:48,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:52:48,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 00:52:48,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:52:48,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 00:52:48,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:52:48,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 00:52:48,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:52:48,502 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-07-11 00:52:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:48,741 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-11 00:52:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:52:48,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-11 00:52:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:52:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:52:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-11 00:52:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:52:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-11 00:52:48,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-11 00:52:48,824 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-11 00:52:48,827 INFO L225 Difference]: With dead ends: 49 [2020-07-11 00:52:48,827 INFO L226 Difference]: Without dead ends: 43 [2020-07-11 00:52:48,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-11 00:52:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-11 00:52:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-11 00:52:48,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:52:48,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:48,895 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:48,895 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:48,899 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-11 00:52:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-11 00:52:48,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:48,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:48,899 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:48,899 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 00:52:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:52:48,902 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-11 00:52:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-11 00:52:48,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:52:48,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:52:48,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:52:48,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:52:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-11 00:52:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-11 00:52:48,905 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-07-11 00:52:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:52:48,906 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-11 00:52:48,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 00:52:48,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2020-07-11 00:52:48,974 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-11 00:52:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-11 00:52:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 00:52:48,975 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:52:48,976 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:52:48,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:52:48,976 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:52:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:52:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-07-11 00:52:48,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:52:48,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [418458878] [2020-07-11 00:52:48,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:52:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:52:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:52:49,068 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 00:52:49,068 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 00:52:49,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:52:49,096 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 00:52:49,096 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:52:49,096 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:52:49,096 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:52:49,096 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-11 00:52:49,097 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 00:52:49,097 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:52:49,097 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:52:49,097 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 00:52:49,097 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 00:52:49,097 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 00:52:49,097 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 00:52:49,097 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-11 00:52:49,098 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-11 00:52:49,099 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-11 00:52:49,099 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-11 00:52:49,099 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-11 00:52:49,099 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-11 00:52:49,099 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 00:52:49,099 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 00:52:49,099 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-11 00:52:49,099 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 00:52:49,100 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:52:49,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:52:49 BoogieIcfgContainer [2020-07-11 00:52:49,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:52:49,106 INFO L168 Benchmark]: Toolchain (without parser) took 4670.39 ms. Allocated memory was 143.7 MB in the beginning and 286.3 MB in the end (delta: 142.6 MB). Free memory was 102.1 MB in the beginning and 222.4 MB in the end (delta: -120.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:52:49,107 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:52:49,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.77 ms. Allocated memory is still 143.7 MB. Free memory was 101.9 MB in the beginning and 92.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:52:49,108 INFO L168 Benchmark]: Boogie Preprocessor took 28.49 ms. Allocated memory is still 143.7 MB. Free memory was 92.1 MB in the beginning and 90.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:52:49,109 INFO L168 Benchmark]: RCFGBuilder took 478.81 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.6 MB in the beginning and 165.3 MB in the end (delta: -74.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:52:49,110 INFO L168 Benchmark]: TraceAbstraction took 3899.04 ms. Allocated memory was 200.8 MB in the beginning and 286.3 MB in the end (delta: 85.5 MB). Free memory was 164.6 MB in the beginning and 222.4 MB in the end (delta: -57.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:52:49,113 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.77 ms. Allocated memory is still 143.7 MB. Free memory was 101.9 MB in the beginning and 92.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.49 ms. Allocated memory is still 143.7 MB. Free memory was 92.1 MB in the beginning and 90.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 478.81 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 90.6 MB in the beginning and 165.3 MB in the end (delta: -74.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3899.04 ms. Allocated memory was 200.8 MB in the beginning and 286.3 MB in the end (delta: 85.5 MB). Free memory was 164.6 MB in the beginning and 222.4 MB in the end (delta: -57.8 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 5; VAL [input=5] [L11] CALL, EXPR id(input) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 VAL [\old(x)=0, x=0] [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L11] RET, EXPR id(input) VAL [id(input)=5, input=5] [L11] int result = id(input); VAL [id(input)=5, input=5, result=5] [L12] COND TRUE result == 5 VAL [input=5, result=5] [L13] __VERIFIER_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 94 SDtfs, 110 SDslu, 245 SDs, 0 SdLazy, 105 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 12455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 50/120 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...