/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-267fbe0 [2020-07-18 04:58:34,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:58:34,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:58:34,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:58:34,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:58:34,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:58:34,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:58:34,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:58:34,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:58:34,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:58:34,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:58:34,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:58:34,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:58:34,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:58:34,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:58:34,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:58:34,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:58:34,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:58:34,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:58:34,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:58:34,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:58:34,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:58:34,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:58:34,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:58:34,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:58:34,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:58:34,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:58:34,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:58:34,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:58:34,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:58:34,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:58:34,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:58:34,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:58:34,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:58:34,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:58:34,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:58:34,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:58:34,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:58:34,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:58:34,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:58:34,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:58:34,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:58:34,383 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:58:34,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:58:34,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:58:34,385 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:58:34,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:58:34,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:58:34,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:58:34,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:58:34,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:58:34,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:58:34,386 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:58:34,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:58:34,386 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:58:34,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:58:34,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:58:34,387 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:58:34,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:58:34,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:58:34,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:58:34,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:58:34,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:58:34,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:58:34,388 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 04:58:34,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:58:34,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:58:34,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:58:34,681 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:58:34,681 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:58:34,682 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-18 04:58:34,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30ecb4a5/263b43f5c6094bf988eb171119582fc0/FLAGe86c952a6 [2020-07-18 04:58:35,246 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:58:35,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-1.c [2020-07-18 04:58:35,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30ecb4a5/263b43f5c6094bf988eb171119582fc0/FLAGe86c952a6 [2020-07-18 04:58:35,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30ecb4a5/263b43f5c6094bf988eb171119582fc0 [2020-07-18 04:58:35,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:58:35,621 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:58:35,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:58:35,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:58:35,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:58:35,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a23cb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35, skipping insertion in model container [2020-07-18 04:58:35,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:58:35,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:58:35,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:58:35,852 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:58:35,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:58:35,884 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:58:35,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35 WrapperNode [2020-07-18 04:58:35,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:58:35,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:58:35,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:58:35,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:58:35,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (1/1) ... [2020-07-18 04:58:35,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:58:35,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:58:35,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:58:35,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:58:35,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:58:36,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:58:36,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:58:36,061 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-18 04:58:36,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:58:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:58:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:58:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-18 04:58:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:58:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:58:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:58:36,278 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:58:36,278 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:58:36,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:58:36 BoogieIcfgContainer [2020-07-18 04:58:36,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:58:36,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:58:36,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:58:36,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:58:36,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:58:35" (1/3) ... [2020-07-18 04:58:36,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533db7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:58:36, skipping insertion in model container [2020-07-18 04:58:36,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:58:35" (2/3) ... [2020-07-18 04:58:36,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533db7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:58:36, skipping insertion in model container [2020-07-18 04:58:36,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:58:36" (3/3) ... [2020-07-18 04:58:36,291 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i5_o5-1.c [2020-07-18 04:58:36,302 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:58:36,310 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:58:36,325 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:58:36,381 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:58:36,381 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:58:36,381 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:58:36,381 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:58:36,382 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:58:36,382 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:58:36,385 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:58:36,386 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:58:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-18 04:58:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-18 04:58:36,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:36,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:58:36,448 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-07-18 04:58:36,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:36,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1767837331] [2020-07-18 04:58:36,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:36,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-18 04:58:36,642 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-18 04:58:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:36,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:36,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:36,696 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:36,697 INFO L280 TraceCheckUtils]: 3: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:36,699 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-18 04:58:36,700 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2020-07-18 04:58:36,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-18 04:58:36,701 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #31#return; {28#true} is VALID [2020-07-18 04:58:36,701 INFO L263 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2020-07-18 04:58:36,702 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#true} ~input~0 := 5; {32#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:36,703 INFO L263 TraceCheckUtils]: 5: Hoare triple {32#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {28#true} is VALID [2020-07-18 04:58:36,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} ~x := #in~x; {38#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:36,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= |id_#in~x| id_~x)} assume 0 == ~x; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:36,705 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 0 |id_#in~x|)} #res := 0; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:36,706 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(= 0 |id_#in~x|)} assume true; {39#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:36,709 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {39#(= 0 |id_#in~x|)} {32#(<= 5 main_~input~0)} #35#return; {29#false} is VALID [2020-07-18 04:58:36,710 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {29#false} is VALID [2020-07-18 04:58:36,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} ~result~0 := #t~ret1; {29#false} is VALID [2020-07-18 04:58:36,711 INFO L280 TraceCheckUtils]: 13: Hoare triple {29#false} havoc #t~ret1; {29#false} is VALID [2020-07-18 04:58:36,711 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume 5 == ~result~0; {29#false} is VALID [2020-07-18 04:58:36,712 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-18 04:58:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 04:58:36,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1767837331] [2020-07-18 04:58:36,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:58:36,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:58:36,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704752351] [2020-07-18 04:58:36,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:58:36,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:36,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:58:36,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:36,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:58:36,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:36,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:58:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:58:36,805 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-07-18 04:58:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:37,058 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-18 04:58:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:58:37,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:58:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:58:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 04:58:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:58:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 04:58:37,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-18 04:58:37,141 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-18 04:58:37,154 INFO L225 Difference]: With dead ends: 37 [2020-07-18 04:58:37,154 INFO L226 Difference]: Without dead ends: 23 [2020-07-18 04:58:37,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:58:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-18 04:58:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-18 04:58:37,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:37,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:37,231 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:37,231 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:37,236 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-18 04:58:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 04:58:37,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:37,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:37,238 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:37,239 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-18 04:58:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:37,243 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-18 04:58:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 04:58:37,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:37,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:37,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:37,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 04:58:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-18 04:58:37,251 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-07-18 04:58:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:37,251 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-18 04:58:37,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:58:37,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2020-07-18 04:58:37,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 04:58:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 04:58:37,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:37,291 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-18 04:58:37,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:58:37,292 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-07-18 04:58:37,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:37,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1581077924] [2020-07-18 04:58:37,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-18 04:58:37,357 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-18 04:58:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:37,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,459 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-18 04:58:37,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:37,461 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-18 04:58:37,462 INFO L263 TraceCheckUtils]: 2: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-18 04:58:37,463 INFO L280 TraceCheckUtils]: 3: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:37,464 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,464 INFO L280 TraceCheckUtils]: 5: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,465 INFO L280 TraceCheckUtils]: 6: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,467 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-18 04:58:37,468 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-18 04:58:37,469 INFO L280 TraceCheckUtils]: 9: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:37,469 INFO L280 TraceCheckUtils]: 10: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:37,470 INFO L280 TraceCheckUtils]: 11: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:37,472 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-18 04:58:37,473 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-18 04:58:37,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-18 04:58:37,474 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #31#return; {210#true} is VALID [2020-07-18 04:58:37,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2020-07-18 04:58:37,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} ~input~0 := 5; {214#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:37,475 INFO L263 TraceCheckUtils]: 5: Hoare triple {214#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {210#true} is VALID [2020-07-18 04:58:37,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:37,477 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-18 04:58:37,477 INFO L263 TraceCheckUtils]: 8: Hoare triple {228#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {210#true} is VALID [2020-07-18 04:58:37,478 INFO L280 TraceCheckUtils]: 9: Hoare triple {210#true} ~x := #in~x; {228#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:37,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {228#(= |id_#in~x| id_~x)} assume 0 == ~x; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,480 INFO L280 TraceCheckUtils]: 11: Hoare triple {235#(= 0 |id_#in~x|)} #res := 0; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,481 INFO L280 TraceCheckUtils]: 12: Hoare triple {235#(= 0 |id_#in~x|)} assume true; {235#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:37,482 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-18 04:58:37,483 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-18 04:58:37,484 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:37,485 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#(<= |id_#in~x| 1)} havoc #t~ret0; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:37,485 INFO L280 TraceCheckUtils]: 17: Hoare triple {234#(<= |id_#in~x| 1)} assume true; {234#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:37,487 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {234#(<= |id_#in~x| 1)} {214#(<= 5 main_~input~0)} #35#return; {211#false} is VALID [2020-07-18 04:58:37,488 INFO L280 TraceCheckUtils]: 19: Hoare triple {211#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {211#false} is VALID [2020-07-18 04:58:37,488 INFO L280 TraceCheckUtils]: 20: Hoare triple {211#false} ~result~0 := #t~ret1; {211#false} is VALID [2020-07-18 04:58:37,488 INFO L280 TraceCheckUtils]: 21: Hoare triple {211#false} havoc #t~ret1; {211#false} is VALID [2020-07-18 04:58:37,488 INFO L280 TraceCheckUtils]: 22: Hoare triple {211#false} assume 5 == ~result~0; {211#false} is VALID [2020-07-18 04:58:37,489 INFO L280 TraceCheckUtils]: 23: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-18 04:58:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 04:58:37,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1581077924] [2020-07-18 04:58:37,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:37,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 04:58:37,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428695460] [2020-07-18 04:58:37,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-18 04:58:37,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:37,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:58:37,525 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-18 04:58:37,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:58:37,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:37,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:58:37,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:58:37,527 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-07-18 04:58:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:37,716 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-18 04:58:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:58:37,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-18 04:58:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:58:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-18 04:58:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:58:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-18 04:58:37,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-18 04:58:37,771 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-18 04:58:37,773 INFO L225 Difference]: With dead ends: 34 [2020-07-18 04:58:37,773 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 04:58:37,775 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-18 04:58:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 04:58:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 04:58:37,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:37,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:37,812 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:37,812 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:37,816 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-18 04:58:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 04:58:37,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:37,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:37,817 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:37,817 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:58:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:37,821 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-18 04:58:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 04:58:37,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:37,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:37,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:37,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 04:58:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-18 04:58:37,826 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-07-18 04:58:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:37,827 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-18 04:58:37,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:58:37,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-18 04:58:37,868 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-18 04:58:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 04:58:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 04:58:37,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:37,870 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-18 04:58:37,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:58:37,871 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:37,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-07-18 04:58:37,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:37,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910093710] [2020-07-18 04:58:37,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-18 04:58:37,935 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-18 04:58:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,045 INFO L280 TraceCheckUtils]: 3: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,047 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-18 04:58:38,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,048 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-18 04:58:38,049 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:38,050 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,051 INFO L280 TraceCheckUtils]: 5: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,054 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-18 04:58:38,055 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-18 04:58:38,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,057 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,058 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-18 04:58:38,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,061 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-18 04:58:38,061 INFO L263 TraceCheckUtils]: 2: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:38,062 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,062 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-18 04:58:38,063 INFO L263 TraceCheckUtils]: 5: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:38,063 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,064 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,065 INFO L280 TraceCheckUtils]: 8: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,065 INFO L280 TraceCheckUtils]: 9: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,067 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-18 04:58:38,068 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-18 04:58:38,068 INFO L280 TraceCheckUtils]: 12: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,069 INFO L280 TraceCheckUtils]: 13: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,070 INFO L280 TraceCheckUtils]: 14: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,071 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-18 04:58:38,072 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-18 04:58:38,073 INFO L280 TraceCheckUtils]: 17: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,074 INFO L280 TraceCheckUtils]: 18: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,074 INFO L280 TraceCheckUtils]: 19: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,076 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-18 04:58:38,077 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-18 04:58:38,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-18 04:58:38,078 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #31#return; {422#true} is VALID [2020-07-18 04:58:38,078 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret2 := main(); {422#true} is VALID [2020-07-18 04:58:38,079 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} ~input~0 := 5; {426#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:38,079 INFO L263 TraceCheckUtils]: 5: Hoare triple {426#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {422#true} is VALID [2020-07-18 04:58:38,080 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,081 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-18 04:58:38,081 INFO L263 TraceCheckUtils]: 8: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:38,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,082 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-18 04:58:38,083 INFO L263 TraceCheckUtils]: 11: Hoare triple {448#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {422#true} is VALID [2020-07-18 04:58:38,084 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} ~x := #in~x; {448#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,084 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#(= |id_#in~x| id_~x)} assume 0 == ~x; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,085 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#(= 0 |id_#in~x|)} #res := 0; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,086 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#(= 0 |id_#in~x|)} assume true; {469#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,087 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-18 04:58:38,088 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-18 04:58:38,088 INFO L280 TraceCheckUtils]: 18: Hoare triple {468#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,089 INFO L280 TraceCheckUtils]: 19: Hoare triple {468#(<= |id_#in~x| 1)} havoc #t~ret0; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,090 INFO L280 TraceCheckUtils]: 20: Hoare triple {468#(<= |id_#in~x| 1)} assume true; {468#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,091 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-18 04:58:38,092 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-18 04:58:38,093 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,093 INFO L280 TraceCheckUtils]: 24: Hoare triple {462#(<= |id_#in~x| 2)} havoc #t~ret0; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,094 INFO L280 TraceCheckUtils]: 25: Hoare triple {462#(<= |id_#in~x| 2)} assume true; {462#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,096 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {462#(<= |id_#in~x| 2)} {426#(<= 5 main_~input~0)} #35#return; {423#false} is VALID [2020-07-18 04:58:38,096 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {423#false} is VALID [2020-07-18 04:58:38,097 INFO L280 TraceCheckUtils]: 28: Hoare triple {423#false} ~result~0 := #t~ret1; {423#false} is VALID [2020-07-18 04:58:38,097 INFO L280 TraceCheckUtils]: 29: Hoare triple {423#false} havoc #t~ret1; {423#false} is VALID [2020-07-18 04:58:38,097 INFO L280 TraceCheckUtils]: 30: Hoare triple {423#false} assume 5 == ~result~0; {423#false} is VALID [2020-07-18 04:58:38,098 INFO L280 TraceCheckUtils]: 31: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-18 04:58:38,100 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-18 04:58:38,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910093710] [2020-07-18 04:58:38,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:38,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:58:38,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052845889] [2020-07-18 04:58:38,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-18 04:58:38,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:38,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:58:38,144 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-18 04:58:38,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:58:38,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:58:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:58:38,145 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-18 04:58:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,395 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-18 04:58:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:58:38,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-18 04:58:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:58:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-18 04:58:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:58:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2020-07-18 04:58:38,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2020-07-18 04:58:38,451 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-18 04:58:38,453 INFO L225 Difference]: With dead ends: 39 [2020-07-18 04:58:38,454 INFO L226 Difference]: Without dead ends: 33 [2020-07-18 04:58:38,454 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-18 04:58:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-18 04:58:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-18 04:58:38,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:38,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:38,493 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:38,493 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,497 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-18 04:58:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-18 04:58:38,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:38,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:38,498 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:38,498 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-18 04:58:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:38,501 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-18 04:58:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-18 04:58:38,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:38,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:38,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:38,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-18 04:58:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-18 04:58:38,506 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-07-18 04:58:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:38,506 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-18 04:58:38,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:58:38,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2020-07-18 04:58:38,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-18 04:58:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 04:58:38,551 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:38,551 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-18 04:58:38,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:58:38,552 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-07-18 04:58:38,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:38,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1496650108] [2020-07-18 04:58:38,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-18 04:58:38,601 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-18 04:58:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:38,765 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,769 INFO L280 TraceCheckUtils]: 3: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,770 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-18 04:58:38,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,775 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-18 04:58:38,776 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,776 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,781 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-18 04:58:38,781 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-18 04:58:38,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,786 INFO L280 TraceCheckUtils]: 11: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,787 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-18 04:58:38,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,789 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-18 04:58:38,789 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,790 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,791 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-18 04:58:38,791 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,791 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,792 INFO L280 TraceCheckUtils]: 7: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,794 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-18 04:58:38,795 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-18 04:58:38,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,796 INFO L280 TraceCheckUtils]: 13: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,797 INFO L280 TraceCheckUtils]: 14: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,798 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-18 04:58:38,799 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-18 04:58:38,799 INFO L280 TraceCheckUtils]: 17: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,800 INFO L280 TraceCheckUtils]: 18: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,801 INFO L280 TraceCheckUtils]: 19: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,802 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-18 04:58:38,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,806 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-18 04:58:38,807 INFO L263 TraceCheckUtils]: 2: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,807 INFO L280 TraceCheckUtils]: 3: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,808 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-18 04:58:38,808 INFO L263 TraceCheckUtils]: 5: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,809 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,810 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-18 04:58:38,810 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,815 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-18 04:58:38,817 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-18 04:58:38,818 INFO L280 TraceCheckUtils]: 15: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,818 INFO L280 TraceCheckUtils]: 16: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,819 INFO L280 TraceCheckUtils]: 17: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,820 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-18 04:58:38,820 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-18 04:58:38,821 INFO L280 TraceCheckUtils]: 20: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,821 INFO L280 TraceCheckUtils]: 21: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,821 INFO L280 TraceCheckUtils]: 22: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,822 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-18 04:58:38,824 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-18 04:58:38,825 INFO L280 TraceCheckUtils]: 25: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:38,826 INFO L280 TraceCheckUtils]: 26: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:38,827 INFO L280 TraceCheckUtils]: 27: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:38,828 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-18 04:58:38,829 INFO L263 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2020-07-18 04:58:38,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-18 04:58:38,830 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {688#true} {688#true} #31#return; {688#true} is VALID [2020-07-18 04:58:38,830 INFO L263 TraceCheckUtils]: 3: Hoare triple {688#true} call #t~ret2 := main(); {688#true} is VALID [2020-07-18 04:58:38,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {688#true} ~input~0 := 5; {692#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:38,833 INFO L263 TraceCheckUtils]: 5: Hoare triple {692#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {688#true} is VALID [2020-07-18 04:58:38,842 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,842 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-18 04:58:38,843 INFO L263 TraceCheckUtils]: 8: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,843 INFO L280 TraceCheckUtils]: 9: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,844 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-18 04:58:38,844 INFO L263 TraceCheckUtils]: 11: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,845 INFO L280 TraceCheckUtils]: 12: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,845 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-18 04:58:38,846 INFO L263 TraceCheckUtils]: 14: Hoare triple {722#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {688#true} is VALID [2020-07-18 04:58:38,849 INFO L280 TraceCheckUtils]: 15: Hoare triple {688#true} ~x := #in~x; {722#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:38,850 INFO L280 TraceCheckUtils]: 16: Hoare triple {722#(= |id_#in~x| id_~x)} assume 0 == ~x; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,850 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(= 0 |id_#in~x|)} #res := 0; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,851 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(= 0 |id_#in~x|)} assume true; {765#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:38,853 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-18 04:58:38,853 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-18 04:58:38,854 INFO L280 TraceCheckUtils]: 21: Hoare triple {764#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,855 INFO L280 TraceCheckUtils]: 22: Hoare triple {764#(<= |id_#in~x| 1)} havoc #t~ret0; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,856 INFO L280 TraceCheckUtils]: 23: Hoare triple {764#(<= |id_#in~x| 1)} assume true; {764#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:38,857 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-18 04:58:38,858 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-18 04:58:38,858 INFO L280 TraceCheckUtils]: 26: Hoare triple {758#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,859 INFO L280 TraceCheckUtils]: 27: Hoare triple {758#(<= |id_#in~x| 2)} havoc #t~ret0; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,860 INFO L280 TraceCheckUtils]: 28: Hoare triple {758#(<= |id_#in~x| 2)} assume true; {758#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:38,862 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-18 04:58:38,863 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-18 04:58:38,863 INFO L280 TraceCheckUtils]: 31: Hoare triple {744#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:38,864 INFO L280 TraceCheckUtils]: 32: Hoare triple {744#(<= |id_#in~x| 3)} havoc #t~ret0; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:38,864 INFO L280 TraceCheckUtils]: 33: Hoare triple {744#(<= |id_#in~x| 3)} assume true; {744#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:38,865 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {744#(<= |id_#in~x| 3)} {692#(<= 5 main_~input~0)} #35#return; {689#false} is VALID [2020-07-18 04:58:38,865 INFO L280 TraceCheckUtils]: 35: Hoare triple {689#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {689#false} is VALID [2020-07-18 04:58:38,865 INFO L280 TraceCheckUtils]: 36: Hoare triple {689#false} ~result~0 := #t~ret1; {689#false} is VALID [2020-07-18 04:58:38,866 INFO L280 TraceCheckUtils]: 37: Hoare triple {689#false} havoc #t~ret1; {689#false} is VALID [2020-07-18 04:58:38,866 INFO L280 TraceCheckUtils]: 38: Hoare triple {689#false} assume 5 == ~result~0; {689#false} is VALID [2020-07-18 04:58:38,866 INFO L280 TraceCheckUtils]: 39: Hoare triple {689#false} assume !false; {689#false} is VALID [2020-07-18 04:58:38,867 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-18 04:58:38,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1496650108] [2020-07-18 04:58:38,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:38,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 04:58:38,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899786863] [2020-07-18 04:58:38,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-18 04:58:38,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:38,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 04:58:38,920 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-18 04:58:38,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 04:58:38,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:38,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 04:58:38,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:58:38,921 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-07-18 04:58:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:39,191 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-18 04:58:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 04:58:39,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-18 04:58:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:58:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-18 04:58:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:58:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-18 04:58:39,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2020-07-18 04:58:39,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:39,284 INFO L225 Difference]: With dead ends: 44 [2020-07-18 04:58:39,284 INFO L226 Difference]: Without dead ends: 38 [2020-07-18 04:58:39,285 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-18 04:58:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-18 04:58:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-18 04:58:39,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:39,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:39,350 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:39,350 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:39,353 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-18 04:58:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-18 04:58:39,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:39,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:39,355 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:39,355 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-18 04:58:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:39,362 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-18 04:58:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-18 04:58:39,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:39,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:39,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:39,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-18 04:58:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-18 04:58:39,372 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-07-18 04:58:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:39,373 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-18 04:58:39,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 04:58:39,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2020-07-18 04:58:39,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-18 04:58:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 04:58:39,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:39,423 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-18 04:58:39,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:58:39,424 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:39,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:39,424 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-07-18 04:58:39,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:39,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810855990] [2020-07-18 04:58:39,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-18 04:58:39,500 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-18 04:58:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:58:39,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,668 INFO L280 TraceCheckUtils]: 3: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,669 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-18 04:58:39,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,671 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-18 04:58:39,671 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,672 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,673 INFO L280 TraceCheckUtils]: 5: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,675 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-18 04:58:39,675 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-18 04:58:39,676 INFO L280 TraceCheckUtils]: 9: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,676 INFO L280 TraceCheckUtils]: 10: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,677 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,678 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-18 04:58:39,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,680 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-18 04:58:39,680 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,681 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-18 04:58:39,681 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,683 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,683 INFO L280 TraceCheckUtils]: 8: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,684 INFO L280 TraceCheckUtils]: 9: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,685 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-18 04:58:39,685 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-18 04:58:39,686 INFO L280 TraceCheckUtils]: 12: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,687 INFO L280 TraceCheckUtils]: 13: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,687 INFO L280 TraceCheckUtils]: 14: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,688 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-18 04:58:39,689 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-18 04:58:39,690 INFO L280 TraceCheckUtils]: 17: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,690 INFO L280 TraceCheckUtils]: 18: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,691 INFO L280 TraceCheckUtils]: 19: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,692 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-18 04:58:39,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,694 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-18 04:58:39,694 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,695 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,695 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-18 04:58:39,696 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,696 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,697 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-18 04:58:39,697 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,698 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,698 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,699 INFO L280 TraceCheckUtils]: 11: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,700 INFO L280 TraceCheckUtils]: 12: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,701 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-18 04:58:39,701 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-18 04:58:39,702 INFO L280 TraceCheckUtils]: 15: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,705 INFO L280 TraceCheckUtils]: 16: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,706 INFO L280 TraceCheckUtils]: 17: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,710 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-18 04:58:39,713 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-18 04:58:39,713 INFO L280 TraceCheckUtils]: 20: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,714 INFO L280 TraceCheckUtils]: 21: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,714 INFO L280 TraceCheckUtils]: 22: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,716 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-18 04:58:39,716 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-18 04:58:39,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,718 INFO L280 TraceCheckUtils]: 26: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,718 INFO L280 TraceCheckUtils]: 27: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,720 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-18 04:58:39,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,722 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-18 04:58:39,722 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,723 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,723 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-18 04:58:39,724 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,725 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-18 04:58:39,725 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,726 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,726 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-18 04:58:39,726 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,727 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,728 INFO L280 TraceCheckUtils]: 13: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,728 INFO L280 TraceCheckUtils]: 14: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,730 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-18 04:58:39,731 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-18 04:58:39,731 INFO L280 TraceCheckUtils]: 18: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,732 INFO L280 TraceCheckUtils]: 19: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,732 INFO L280 TraceCheckUtils]: 20: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,734 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-18 04:58:39,734 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-18 04:58:39,735 INFO L280 TraceCheckUtils]: 23: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,735 INFO L280 TraceCheckUtils]: 24: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,736 INFO L280 TraceCheckUtils]: 25: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,737 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-18 04:58:39,738 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-18 04:58:39,739 INFO L280 TraceCheckUtils]: 28: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,739 INFO L280 TraceCheckUtils]: 29: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,740 INFO L280 TraceCheckUtils]: 30: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,741 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-18 04:58:39,742 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-18 04:58:39,742 INFO L280 TraceCheckUtils]: 33: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:39,743 INFO L280 TraceCheckUtils]: 34: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:39,743 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:39,744 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-18 04:58:39,746 INFO L263 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2020-07-18 04:58:39,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-18 04:58:39,747 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1016#true} {1016#true} #31#return; {1016#true} is VALID [2020-07-18 04:58:39,747 INFO L263 TraceCheckUtils]: 3: Hoare triple {1016#true} call #t~ret2 := main(); {1016#true} is VALID [2020-07-18 04:58:39,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#true} ~input~0 := 5; {1020#(<= 5 main_~input~0)} is VALID [2020-07-18 04:58:39,748 INFO L263 TraceCheckUtils]: 5: Hoare triple {1020#(<= 5 main_~input~0)} call #t~ret1 := id(~input~0); {1016#true} is VALID [2020-07-18 04:58:39,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,749 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-18 04:58:39,749 INFO L263 TraceCheckUtils]: 8: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,750 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-18 04:58:39,751 INFO L263 TraceCheckUtils]: 11: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,751 INFO L280 TraceCheckUtils]: 12: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,752 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-18 04:58:39,752 INFO L263 TraceCheckUtils]: 14: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,752 INFO L280 TraceCheckUtils]: 15: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,753 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-18 04:58:39,753 INFO L263 TraceCheckUtils]: 17: Hoare triple {1058#(= |id_#in~x| id_~x)} call #t~ret0 := id(~x - 1); {1016#true} is VALID [2020-07-18 04:58:39,754 INFO L280 TraceCheckUtils]: 18: Hoare triple {1016#true} ~x := #in~x; {1058#(= |id_#in~x| id_~x)} is VALID [2020-07-18 04:58:39,754 INFO L280 TraceCheckUtils]: 19: Hoare triple {1058#(= |id_#in~x| id_~x)} assume 0 == ~x; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,755 INFO L280 TraceCheckUtils]: 20: Hoare triple {1131#(= 0 |id_#in~x|)} #res := 0; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,756 INFO L280 TraceCheckUtils]: 21: Hoare triple {1131#(= 0 |id_#in~x|)} assume true; {1131#(= 0 |id_#in~x|)} is VALID [2020-07-18 04:58:39,757 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-18 04:58:39,757 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-18 04:58:39,758 INFO L280 TraceCheckUtils]: 24: Hoare triple {1130#(<= |id_#in~x| 1)} #res := 1 + #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,758 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#(<= |id_#in~x| 1)} havoc #t~ret0; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,759 INFO L280 TraceCheckUtils]: 26: Hoare triple {1130#(<= |id_#in~x| 1)} assume true; {1130#(<= |id_#in~x| 1)} is VALID [2020-07-18 04:58:39,760 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-18 04:58:39,761 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-18 04:58:39,762 INFO L280 TraceCheckUtils]: 29: Hoare triple {1124#(<= |id_#in~x| 2)} #res := 1 + #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,762 INFO L280 TraceCheckUtils]: 30: Hoare triple {1124#(<= |id_#in~x| 2)} havoc #t~ret0; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,763 INFO L280 TraceCheckUtils]: 31: Hoare triple {1124#(<= |id_#in~x| 2)} assume true; {1124#(<= |id_#in~x| 2)} is VALID [2020-07-18 04:58:39,764 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-18 04:58:39,765 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-18 04:58:39,766 INFO L280 TraceCheckUtils]: 34: Hoare triple {1110#(<= |id_#in~x| 3)} #res := 1 + #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,766 INFO L280 TraceCheckUtils]: 35: Hoare triple {1110#(<= |id_#in~x| 3)} havoc #t~ret0; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,767 INFO L280 TraceCheckUtils]: 36: Hoare triple {1110#(<= |id_#in~x| 3)} assume true; {1110#(<= |id_#in~x| 3)} is VALID [2020-07-18 04:58:39,768 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-18 04:58:39,769 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-18 04:58:39,769 INFO L280 TraceCheckUtils]: 39: Hoare triple {1088#(<= |id_#in~x| 4)} #res := 1 + #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:39,770 INFO L280 TraceCheckUtils]: 40: Hoare triple {1088#(<= |id_#in~x| 4)} havoc #t~ret0; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:39,770 INFO L280 TraceCheckUtils]: 41: Hoare triple {1088#(<= |id_#in~x| 4)} assume true; {1088#(<= |id_#in~x| 4)} is VALID [2020-07-18 04:58:39,771 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1088#(<= |id_#in~x| 4)} {1020#(<= 5 main_~input~0)} #35#return; {1017#false} is VALID [2020-07-18 04:58:39,772 INFO L280 TraceCheckUtils]: 43: Hoare triple {1017#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1017#false} is VALID [2020-07-18 04:58:39,772 INFO L280 TraceCheckUtils]: 44: Hoare triple {1017#false} ~result~0 := #t~ret1; {1017#false} is VALID [2020-07-18 04:58:39,772 INFO L280 TraceCheckUtils]: 45: Hoare triple {1017#false} havoc #t~ret1; {1017#false} is VALID [2020-07-18 04:58:39,772 INFO L280 TraceCheckUtils]: 46: Hoare triple {1017#false} assume 5 == ~result~0; {1017#false} is VALID [2020-07-18 04:58:39,772 INFO L280 TraceCheckUtils]: 47: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2020-07-18 04:58:39,775 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-18 04:58:39,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810855990] [2020-07-18 04:58:39,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:58:39,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 04:58:39,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104138504] [2020-07-18 04:58:39,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-18 04:58:39,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:58:39,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 04:58:39,817 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-18 04:58:39,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 04:58:39,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:58:39,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 04:58:39,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-18 04:58:39,818 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-07-18 04:58:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:40,069 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-07-18 04:58:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 04:58:40,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-18 04:58:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:58:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 04:58:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-18 04:58:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 04:58:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2020-07-18 04:58:40,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2020-07-18 04:58:40,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:40,156 INFO L225 Difference]: With dead ends: 49 [2020-07-18 04:58:40,156 INFO L226 Difference]: Without dead ends: 43 [2020-07-18 04:58:40,157 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-18 04:58:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-18 04:58:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-18 04:58:40,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:58:40,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:40,207 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:40,207 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:40,210 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-18 04:58:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-18 04:58:40,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:40,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:40,211 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:40,211 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-18 04:58:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:58:40,214 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-18 04:58:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-18 04:58:40,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:58:40,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:58:40,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:58:40,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:58:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-18 04:58:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-18 04:58:40,217 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-07-18 04:58:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:58:40,218 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-18 04:58:40,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 04:58:40,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2020-07-18 04:58:40,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:58:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-18 04:58:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 04:58:40,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:58:40,273 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-18 04:58:40,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 04:58:40,273 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:58:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:58:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-07-18 04:58:40,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:58:40,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [481408941] [2020-07-18 04:58:40,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:58:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:58:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:58:40,321 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 04:58:40,321 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 04:58:40,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 04:58:40,350 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 04:58:40,350 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:58:40,350 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: idENTRY has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 04:58:40,351 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-18 04:58:40,352 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-18 04:58:40,353 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-18 04:58:40,353 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-18 04:58:40,353 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-18 04:58:40,353 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-18 04:58:40,353 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-18 04:58:40,353 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 04:58:40,353 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 04:58:40,353 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-18 04:58:40,354 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 04:58:40,354 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 04:58:40,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:58:40 BoogieIcfgContainer [2020-07-18 04:58:40,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:58:40,360 INFO L168 Benchmark]: Toolchain (without parser) took 4740.69 ms. Allocated memory was 137.4 MB in the beginning and 281.0 MB in the end (delta: 143.7 MB). Free memory was 102.8 MB in the beginning and 213.0 MB in the end (delta: -110.3 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:40,361 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 04:58:40,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.77 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 93.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:40,362 INFO L168 Benchmark]: Boogie Preprocessor took 25.63 ms. Allocated memory is still 137.4 MB. Free memory was 93.1 MB in the beginning and 91.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:40,363 INFO L168 Benchmark]: RCFGBuilder took 371.64 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.7 MB in the beginning and 165.8 MB in the end (delta: -74.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:40,364 INFO L168 Benchmark]: TraceAbstraction took 4072.63 ms. Allocated memory was 201.3 MB in the beginning and 281.0 MB in the end (delta: 79.7 MB). Free memory was 165.8 MB in the beginning and 213.0 MB in the end (delta: -47.2 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2020-07-18 04:58:40,367 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.25 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.77 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 93.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.63 ms. Allocated memory is still 137.4 MB. Free memory was 93.1 MB in the beginning and 91.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 371.64 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.7 MB in the beginning and 165.8 MB in the end (delta: -74.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4072.63 ms. Allocated memory was 201.3 MB in the beginning and 281.0 MB in the end (delta: 79.7 MB). Free memory was 165.8 MB in the beginning and 213.0 MB in the end (delta: -47.2 MB). Peak memory consumption was 32.5 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.9s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 1.6s, 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.1s 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...