java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:37:29,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:37:29,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:37:29,275 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:37:29,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:37:29,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:37:29,278 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:37:29,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:37:29,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:37:29,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:37:29,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:37:29,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:37:29,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:37:29,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:37:29,287 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:37:29,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:37:29,289 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:37:29,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:37:29,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:37:29,294 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:37:29,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:37:29,296 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:37:29,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:37:29,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:37:29,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:37:29,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:37:29,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:37:29,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:37:29,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:37:29,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:37:29,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:37:29,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:37:29,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:37:29,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:37:29,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:37:29,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:37:29,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:37:29,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:37:29,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:37:29,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:37:29,345 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:37:29,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:37:29,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:37:29,345 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:37:29,346 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:37:29,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:37:29,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:37:29,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:37:29,417 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:37:29,418 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:37:29,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-07-23 13:37:29,419 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-07-23 13:37:29,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:37:29,479 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:37:29,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:37:29,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:37:29,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:37:29,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/1) ... [2018-07-23 13:37:29,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/1) ... [2018-07-23 13:37:29,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/1) ... [2018-07-23 13:37:29,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/1) ... [2018-07-23 13:37:29,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/1) ... [2018-07-23 13:37:29,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/1) ... [2018-07-23 13:37:29,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/1) ... [2018-07-23 13:37:29,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:37:29,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:37:29,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:37:29,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:37:29,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/1) ... [2018-07-23 13:37:29,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-23 13:37:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:37:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:37:29,777 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:37:29,778 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:37:29 BoogieIcfgContainer [2018-07-23 13:37:29,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:37:29,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:37:29,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:37:29,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:37:29,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:29" (1/2) ... [2018-07-23 13:37:29,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb390b2 and model type count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:37:29, skipping insertion in model container [2018-07-23 13:37:29,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:37:29" (2/2) ... [2018-07-23 13:37:29,789 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-07-23 13:37:29,799 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:37:29,808 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:37:29,860 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:37:29,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:37:29,862 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:37:29,862 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:37:29,862 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:37:29,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:37:29,863 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:37:29,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:37:29,863 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:37:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 13:37:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:37:29,887 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:29,888 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:37:29,889 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:29,895 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-07-23 13:37:29,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,995 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:29,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:37:29,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,998 INFO L185 omatonBuilderFactory]: Interpolants [8#true, 9#false, 10#(< ULTIMATE.start_main_~i~5 (+ (* 1000000 ULTIMATE.start_main_~k~5) 1))] [2018-07-23 13:37:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,000 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:37:30,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:37:30,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:37:30,016 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 13:37:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,043 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-23 13:37:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:37:30,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:37:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,055 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:37:30,055 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 13:37:30,059 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:37:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 13:37:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 13:37:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 13:37:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 13:37:30,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 13:37:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,096 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 13:37:30,096 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:37:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 13:37:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:37:30,097 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,097 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:37:30,097 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-07-23 13:37:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,124 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,124 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:37:30,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,125 INFO L185 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(<= ULTIMATE.start_main_~i~5 0), 40#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,128 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:37:30,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:37:30,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:37:30,129 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-23 13:37:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,147 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 13:37:30,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:37:30,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:37:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,148 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:37:30,148 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:37:30,150 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:37:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:37:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:37:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:37:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:37:30,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 13:37:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,154 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:37:30,154 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:37:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:37:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:37:30,154 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,155 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:37:30,155 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-07-23 13:37:30,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:37:30,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,192 INFO L185 omatonBuilderFactory]: Interpolants [69#true, 70#false, 71#(<= ULTIMATE.start_main_~i~5 0), 72#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 73#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,192 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:37:30,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:37:30,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:37:30,199 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-23 13:37:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,258 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:37:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:37:30,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 13:37:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,259 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:37:30,261 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:37:30,262 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:37:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:37:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:37:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:37:30,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 13:37:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,267 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:37:30,268 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:37:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:37:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:30,268 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,270 INFO L357 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 13:37:30,270 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-07-23 13:37:30,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,369 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:37:30,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,370 INFO L185 omatonBuilderFactory]: Interpolants [112#(<= ULTIMATE.start_main_~i~5 0), 113#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 114#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 115#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 110#true, 111#false] [2018-07-23 13:37:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,370 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:37:30,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:37:30,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:37:30,371 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 13:37:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,429 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 13:37:30,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:37:30,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:37:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,430 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:37:30,430 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:37:30,431 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:37:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:37:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:37:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:37:30,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 13:37:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,435 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:37:30,435 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:37:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:37:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:30,436 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,436 INFO L357 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 13:37:30,436 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-07-23 13:37:30,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,521 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:30,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,522 INFO L185 omatonBuilderFactory]: Interpolants [160#(<= ULTIMATE.start_main_~i~5 0), 161#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 162#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 163#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 164#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 158#true, 159#false] [2018-07-23 13:37:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,523 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:30,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:30,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:30,527 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-23 13:37:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,633 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:37:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:37:30,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:37:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,638 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:37:30,638 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:37:30,639 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:37:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:37:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:37:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:37:30,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 13:37:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,647 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:37:30,647 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:37:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:30,647 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,647 INFO L357 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 13:37:30,648 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-07-23 13:37:30,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,730 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:30,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,731 INFO L185 omatonBuilderFactory]: Interpolants [213#true, 214#false, 215#(<= ULTIMATE.start_main_~i~5 0), 216#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 217#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 218#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 219#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 220#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,732 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:30,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:30,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:30,733 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-23 13:37:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,804 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:37:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:37:30,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:37:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,809 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:37:30,809 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:37:30,812 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:37:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:37:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:37:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:37:30,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 13:37:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,820 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:37:30,820 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:37:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:37:30,823 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,823 INFO L357 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 13:37:30,823 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:30,824 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-07-23 13:37:30,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,917 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:30,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,918 INFO L185 omatonBuilderFactory]: Interpolants [275#true, 276#false, 277#(<= ULTIMATE.start_main_~i~5 0), 278#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 279#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 280#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 281#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 282#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 283#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,919 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:30,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:30,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:30,920 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-23 13:37:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,993 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:37:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:37:30,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:37:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,995 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:37:30,995 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:37:30,996 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:37:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:37:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:37:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:37:31,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 13:37:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:31,001 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:37:31,001 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:37:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:37:31,002 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:31,002 INFO L357 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 13:37:31,002 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-07-23 13:37:31,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:31,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:31,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,050 INFO L185 omatonBuilderFactory]: Interpolants [352#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 353#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 344#true, 345#false, 346#(<= ULTIMATE.start_main_~i~5 0), 347#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 348#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 349#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 350#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 351#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,051 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:31,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:31,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:31,052 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-23 13:37:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,155 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:37:31,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:31,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-23 13:37:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,156 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:37:31,156 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:37:31,157 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:37:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:37:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:37:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:37:31,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 13:37:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:31,162 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:37:31,162 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:37:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:31,163 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:31,163 INFO L357 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 13:37:31,164 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:31,164 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-07-23 13:37:31,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:31,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:37:31,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,217 INFO L185 omatonBuilderFactory]: Interpolants [420#true, 421#false, 422#(<= ULTIMATE.start_main_~i~5 0), 423#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 424#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 425#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 426#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 427#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 428#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 429#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 430#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,218 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:31,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:31,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:31,219 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-23 13:37:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,340 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:37:31,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:31,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-23 13:37:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,341 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:37:31,342 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:37:31,342 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:37:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:37:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:37:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:37:31,346 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 13:37:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:31,347 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:37:31,347 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:37:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:31,348 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:31,348 INFO L357 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 13:37:31,349 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-07-23 13:37:31,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,400 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:31,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:31,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,401 INFO L185 omatonBuilderFactory]: Interpolants [512#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 513#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 514#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 503#true, 504#false, 505#(<= ULTIMATE.start_main_~i~5 0), 506#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 507#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 508#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 509#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 510#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 511#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,402 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:31,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:31,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:31,403 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-23 13:37:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,510 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:37:31,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:31,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-23 13:37:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,512 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:37:31,513 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:37:31,513 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:37:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:37:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:37:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:37:31,518 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 13:37:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:31,518 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:37:31,518 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:37:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:31,519 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:31,520 INFO L357 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 13:37:31,520 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-07-23 13:37:31,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,588 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:31,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:37:31,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,590 INFO L185 omatonBuilderFactory]: Interpolants [593#true, 594#false, 595#(<= ULTIMATE.start_main_~i~5 0), 596#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 597#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 598#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 599#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 600#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 601#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 602#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 603#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 604#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 605#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,591 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:37:31,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:37:31,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:31,592 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-23 13:37:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,743 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:37:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:31,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-23 13:37:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,745 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:37:31,745 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:37:31,746 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:37:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:37:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:37:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:37:31,753 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 13:37:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:31,753 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:37:31,753 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:37:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:37:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:31,754 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:31,755 INFO L357 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 13:37:31,755 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:31,755 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-07-23 13:37:31,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,833 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:31,833 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:37:31,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,835 INFO L185 omatonBuilderFactory]: Interpolants [690#true, 691#false, 692#(<= ULTIMATE.start_main_~i~5 0), 693#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 694#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 695#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 696#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 697#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 698#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 699#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 700#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 701#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 702#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 703#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,835 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:37:31,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:37:31,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:31,836 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-23 13:37:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,998 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:37:31,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:31,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-23 13:37:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,999 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:37:32,000 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:37:32,001 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:37:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:37:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:37:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 13:37:32,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-23 13:37:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,007 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 13:37:32,007 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:37:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 13:37:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:32,008 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,008 INFO L357 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-23 13:37:32,012 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-07-23 13:37:32,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:32,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:37:32,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,101 INFO L185 omatonBuilderFactory]: Interpolants [800#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 801#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 802#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 803#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 804#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 805#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 806#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 807#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 808#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 794#true, 795#false, 796#(<= ULTIMATE.start_main_~i~5 0), 797#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 798#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 799#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,102 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:37:32,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:37:32,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:32,103 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-23 13:37:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:32,287 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:37:32,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:32,287 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-23 13:37:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:32,288 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:37:32,288 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:37:32,289 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:37:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:37:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:37:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:37:32,297 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-23 13:37:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,297 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:37:32,297 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:37:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:37:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:32,298 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,298 INFO L357 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-23 13:37:32,298 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-07-23 13:37:32,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:32,387 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:37:32,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,391 INFO L185 omatonBuilderFactory]: Interpolants [905#true, 906#false, 907#(<= ULTIMATE.start_main_~i~5 0), 908#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 909#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 910#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 911#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 912#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 913#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 914#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 915#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 916#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 917#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 918#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 919#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 920#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,392 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:37:32,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:37:32,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:32,393 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-23 13:37:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:32,616 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 13:37:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:32,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-23 13:37:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:32,617 INFO L225 Difference]: With dead ends: 20 [2018-07-23 13:37:32,617 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:37:32,618 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:37:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:37:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 13:37:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:37:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-23 13:37:32,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-23 13:37:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,625 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-23 13:37:32,625 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:37:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-23 13:37:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:32,626 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,626 INFO L357 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-23 13:37:32,626 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:32,627 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-07-23 13:37:32,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:32,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:37:32,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,726 INFO L185 omatonBuilderFactory]: Interpolants [1024#false, 1025#(<= ULTIMATE.start_main_~i~5 0), 1026#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1027#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1028#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1029#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1030#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1031#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1032#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1033#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1034#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1035#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1036#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1037#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1038#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1039#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 1023#true] [2018-07-23 13:37:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,727 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:37:32,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:37:32,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:32,728 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-23 13:37:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:32,965 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:37:32,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:32,965 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-23 13:37:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:32,966 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:37:32,966 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:37:32,969 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:37:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:37:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:37:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:37:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:37:32,978 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-23 13:37:32,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,979 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:37:32,979 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:37:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:37:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:32,980 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,980 INFO L357 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-23 13:37:32,980 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-07-23 13:37:32,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,089 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:33,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:37:33,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,093 INFO L185 omatonBuilderFactory]: Interpolants [1152#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1153#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1154#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1155#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1156#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1157#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1158#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1159#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1160#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1161#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1162#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1163#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1164#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 1165#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 1148#true, 1149#false, 1150#(<= ULTIMATE.start_main_~i~5 0), 1151#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5)] [2018-07-23 13:37:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,094 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:37:33,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:37:33,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:33,095 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-23 13:37:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:33,374 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 13:37:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:33,374 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-23 13:37:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:33,380 INFO L225 Difference]: With dead ends: 22 [2018-07-23 13:37:33,381 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:37:33,382 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:37:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:37:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:37:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:37:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 13:37:33,391 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-23 13:37:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:33,392 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 13:37:33,392 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:37:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 13:37:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:37:33,393 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:33,393 INFO L357 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-23 13:37:33,394 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-07-23 13:37:33,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:33,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:37:33,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,558 INFO L185 omatonBuilderFactory]: Interpolants [1280#true, 1281#false, 1282#(<= ULTIMATE.start_main_~i~5 0), 1283#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1284#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1285#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1286#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1287#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1288#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1289#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1290#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1291#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1292#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1293#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1294#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1295#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1296#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 1297#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 1298#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,559 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:37:33,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:37:33,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:33,560 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-23 13:37:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:33,821 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:37:33,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:33,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-23 13:37:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:33,822 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:37:33,822 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:37:33,823 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:37:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:37:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:37:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:37:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 13:37:33,827 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-23 13:37:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:33,828 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 13:37:33,828 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:37:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 13:37:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:37:33,829 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:33,829 INFO L357 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-23 13:37:33,829 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-07-23 13:37:33,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,931 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:33,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:37:33,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,935 INFO L185 omatonBuilderFactory]: Interpolants [1419#true, 1420#false, 1421#(<= ULTIMATE.start_main_~i~5 0), 1422#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1423#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1424#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1425#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1426#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1427#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1428#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1429#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1430#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1431#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1432#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1433#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1434#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1435#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 1436#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 1437#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 1438#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,936 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:37:33,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:37:33,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:33,937 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-23 13:37:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:34,275 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-23 13:37:34,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:37:34,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-23 13:37:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:34,276 INFO L225 Difference]: With dead ends: 24 [2018-07-23 13:37:34,276 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 13:37:34,278 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:37:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 13:37:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-23 13:37:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:37:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-23 13:37:34,284 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-23 13:37:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:34,285 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-23 13:37:34,285 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:37:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-23 13:37:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:37:34,288 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:34,288 INFO L357 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-23 13:37:34,288 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-07-23 13:37:34,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:34,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:37:34,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,406 INFO L185 omatonBuilderFactory]: Interpolants [1568#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1569#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1570#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1571#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1572#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1573#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1574#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1575#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1576#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1577#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1578#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1579#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1580#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1581#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 1582#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 1583#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 1584#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 1585#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 1565#true, 1566#false, 1567#(<= ULTIMATE.start_main_~i~5 0)] [2018-07-23 13:37:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,406 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:37:34,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:37:34,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:34,407 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-23 13:37:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:34,727 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 13:37:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:34,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-23 13:37:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:34,728 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:37:34,728 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:37:34,732 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:37:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:37:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:37:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:37:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 13:37:34,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-23 13:37:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:34,742 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 13:37:34,743 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:37:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 13:37:34,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:37:34,744 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:34,744 INFO L357 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-23 13:37:34,744 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:34,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-07-23 13:37:34,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:34,879 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:37:34,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,888 INFO L185 omatonBuilderFactory]: Interpolants [1728#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1729#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1730#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1731#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1732#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1733#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1734#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 1735#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 1736#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 1737#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 1738#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 1739#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 1718#true, 1719#false, 1720#(<= ULTIMATE.start_main_~i~5 0), 1721#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1722#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1723#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1724#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1725#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1726#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1727#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,889 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:37:34,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:37:34,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:37:34,890 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-23 13:37:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:35,230 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-23 13:37:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:35,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-23 13:37:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:35,231 INFO L225 Difference]: With dead ends: 26 [2018-07-23 13:37:35,231 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 13:37:35,232 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:37:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 13:37:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-23 13:37:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 13:37:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-23 13:37:35,238 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-23 13:37:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:35,238 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-23 13:37:35,238 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:37:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-23 13:37:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:37:35,239 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:35,239 INFO L357 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-23 13:37:35,240 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-07-23 13:37:35,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:35,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:37:35,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,375 INFO L185 omatonBuilderFactory]: Interpolants [1888#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1889#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1890#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1891#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1892#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1893#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1894#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 1895#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 1896#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 1897#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 1898#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 1899#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 1900#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 1878#true, 1879#false, 1880#(<= ULTIMATE.start_main_~i~5 0), 1881#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1882#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1883#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1884#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1885#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1886#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1887#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:37:35,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:37:35,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:35,379 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-23 13:37:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:35,799 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 13:37:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:35,799 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-23 13:37:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:35,800 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:37:35,800 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:37:35,803 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:37:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:37:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:37:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:37:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 13:37:35,810 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-23 13:37:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:35,810 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 13:37:35,810 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:37:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 13:37:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:37:35,811 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:35,811 INFO L357 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-23 13:37:35,812 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-07-23 13:37:35,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,983 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:35,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:37:35,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,984 INFO L185 omatonBuilderFactory]: Interpolants [2048#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2049#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2050#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2051#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2052#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2053#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2054#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2055#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2056#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2057#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2058#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2059#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2060#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2061#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 2062#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2063#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2064#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 2065#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 2066#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 2067#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 2068#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 2045#true, 2046#false, 2047#(<= ULTIMATE.start_main_~i~5 0)] [2018-07-23 13:37:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,984 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:37:35,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:37:35,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:35,988 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-23 13:37:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:36,562 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-23 13:37:36,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:36,565 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-23 13:37:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:36,566 INFO L225 Difference]: With dead ends: 28 [2018-07-23 13:37:36,566 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 13:37:36,567 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:37:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 13:37:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-23 13:37:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 13:37:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-23 13:37:36,576 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-23 13:37:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:36,576 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-23 13:37:36,576 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:37:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-23 13:37:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:37:36,577 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:36,577 INFO L357 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-23 13:37:36,577 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-07-23 13:37:36,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:36,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:37:36,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,722 INFO L185 omatonBuilderFactory]: Interpolants [2240#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 2241#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 2242#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 2243#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 2219#true, 2220#false, 2221#(<= ULTIMATE.start_main_~i~5 0), 2222#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2223#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2224#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2225#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2226#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2227#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2228#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2229#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2230#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2231#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2232#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2233#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2234#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2235#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 2236#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2237#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2238#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 2239#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,722 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:37:36,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:37:36,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:36,723 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-23 13:37:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:37,210 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:37:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:37:37,210 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-23 13:37:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:37,211 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:37:37,211 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:37:37,212 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:37:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:37:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:37:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:37:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 13:37:37,218 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-23 13:37:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:37,218 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 13:37:37,219 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:37:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 13:37:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:37:37,221 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:37,221 INFO L357 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-23 13:37:37,221 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-07-23 13:37:37,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,379 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:37,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:37:37,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,380 INFO L185 omatonBuilderFactory]: Interpolants [2400#true, 2401#false, 2402#(<= ULTIMATE.start_main_~i~5 0), 2403#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2404#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2405#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2406#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2407#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2408#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2409#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2410#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2411#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2412#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2413#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2414#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2415#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2416#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 2417#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2418#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2419#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 2420#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 2421#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 2422#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 2423#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 2424#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 2425#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:37:37,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:37:37,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:37,382 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-23 13:37:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:37,935 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-23 13:37:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:37:37,935 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-23 13:37:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:37,936 INFO L225 Difference]: With dead ends: 30 [2018-07-23 13:37:37,936 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 13:37:37,938 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:37:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 13:37:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-23 13:37:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 13:37:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-23 13:37:37,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-23 13:37:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:37,943 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-23 13:37:37,943 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:37:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-23 13:37:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 13:37:37,944 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:37,944 INFO L357 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-23 13:37:37,944 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-07-23 13:37:37,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:38,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:37:38,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,116 INFO L185 omatonBuilderFactory]: Interpolants [2588#true, 2589#false, 2590#(<= ULTIMATE.start_main_~i~5 0), 2591#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2592#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2593#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2594#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2595#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2596#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2597#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2598#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2599#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2600#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2601#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2602#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2603#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2604#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 2605#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2606#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2607#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 2608#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 2609#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 2610#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 2611#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 2612#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 2613#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 2614#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,117 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:37:38,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:37:38,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:38,118 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-23 13:37:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:38,734 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:37:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:37:38,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-23 13:37:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:38,735 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:37:38,735 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:37:38,737 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:37:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:37:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:37:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:37:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 13:37:38,744 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-23 13:37:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:38,744 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 13:37:38,744 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:37:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 13:37:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:37:38,745 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:38,745 INFO L357 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-23 13:37:38,745 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:38,745 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-07-23 13:37:38,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:38,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:37:38,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,908 INFO L185 omatonBuilderFactory]: Interpolants [2783#true, 2784#false, 2785#(<= ULTIMATE.start_main_~i~5 0), 2786#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2787#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2788#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2789#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2790#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2791#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2792#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2793#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2794#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2795#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2796#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2797#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2798#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2799#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 2800#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2801#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2802#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 2803#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 2804#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 2805#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 2806#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 2807#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 2808#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 2809#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 2810#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,909 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:37:38,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:37:38,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:37:38,910 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-23 13:37:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:39,432 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-23 13:37:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:37:39,432 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-23 13:37:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:39,433 INFO L225 Difference]: With dead ends: 32 [2018-07-23 13:37:39,433 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:37:39,435 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:37:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:37:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-23 13:37:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:37:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-23 13:37:39,440 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-23 13:37:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:39,440 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-23 13:37:39,440 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:37:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-23 13:37:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:37:39,441 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:39,441 INFO L357 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-23 13:37:39,442 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:39,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-07-23 13:37:39,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:39,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:39,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:37:39,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:39,629 INFO L185 omatonBuilderFactory]: Interpolants [3008#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 3009#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 3010#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 3011#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 3012#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 3013#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 2985#true, 2986#false, 2987#(<= ULTIMATE.start_main_~i~5 0), 2988#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2989#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2990#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2991#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2992#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2993#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2994#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2995#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2996#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2997#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2998#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2999#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 3000#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3001#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3002#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 3003#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 3004#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3005#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3006#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3007#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:39,629 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:37:39,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:37:39,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:37:39,632 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-23 13:37:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:40,261 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 13:37:40,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:37:40,263 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-23 13:37:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:40,264 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:37:40,264 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:37:40,266 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:37:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:37:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:37:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:37:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 13:37:40,273 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-23 13:37:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:40,273 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 13:37:40,274 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:37:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 13:37:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:37:40,274 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:40,275 INFO L357 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-23 13:37:40,276 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:40,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-07-23 13:37:40,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,470 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:40,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:37:40,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,471 INFO L185 omatonBuilderFactory]: Interpolants [3200#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 3201#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 3202#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 3203#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 3204#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 3205#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 3206#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 3207#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 3208#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 3209#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3210#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3211#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 3212#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 3213#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3214#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3215#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3216#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 3217#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 3218#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 3219#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 3220#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 3221#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 3222#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 3223#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 3194#true, 3195#false, 3196#(<= ULTIMATE.start_main_~i~5 0), 3197#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 3198#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 3199#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,472 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:37:40,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:37:40,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:37:40,473 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-23 13:37:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:41,157 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-23 13:37:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:37:41,158 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-23 13:37:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:41,158 INFO L225 Difference]: With dead ends: 34 [2018-07-23 13:37:41,158 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 13:37:41,160 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:37:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 13:37:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 13:37:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 13:37:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-23 13:37:41,166 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-23 13:37:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:41,167 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-23 13:37:41,167 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:37:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-23 13:37:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 13:37:41,168 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:41,168 INFO L357 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-23 13:37:41,168 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:41,168 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-07-23 13:37:41,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:41,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:37:41,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,403 INFO L185 omatonBuilderFactory]: Interpolants [3410#true, 3411#false, 3412#(<= ULTIMATE.start_main_~i~5 0), 3413#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 3414#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 3415#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 3416#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 3417#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 3418#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 3419#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 3420#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 3421#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 3422#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 3423#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 3424#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 3425#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3426#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3427#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 3428#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 3429#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3430#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3431#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3432#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 3433#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 3434#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 3435#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 3436#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 3437#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 3438#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 3439#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 3440#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,403 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:37:41,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:37:41,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:37:41,405 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-23 13:37:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:42,166 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 13:37:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:37:42,166 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-23 13:37:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:42,167 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:37:42,167 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:37:42,169 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:37:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:37:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 13:37:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 13:37:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 13:37:42,174 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-23 13:37:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:42,175 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 13:37:42,175 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:37:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 13:37:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:37:42,175 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:42,175 INFO L357 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-23 13:37:42,176 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:42,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-07-23 13:37:42,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:42,387 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:37:42,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,387 INFO L185 omatonBuilderFactory]: Interpolants [3648#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3649#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3650#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 3651#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 3652#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3653#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3654#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3655#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 3656#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 3657#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 3658#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 3659#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 3660#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 3661#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 3662#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 3663#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 3664#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 3633#true, 3634#false, 3635#(<= ULTIMATE.start_main_~i~5 0), 3636#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 3637#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 3638#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 3639#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 3640#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 3641#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 3642#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 3643#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 3644#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 3645#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 3646#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 3647#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,388 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:37:42,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:37:42,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:37:42,389 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-23 13:37:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:43,160 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-23 13:37:43,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:37:43,161 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-23 13:37:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:43,161 INFO L225 Difference]: With dead ends: 36 [2018-07-23 13:37:43,161 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 13:37:43,163 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:37:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 13:37:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-23 13:37:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 13:37:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-23 13:37:43,168 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-23 13:37:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:43,168 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-23 13:37:43,168 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:37:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-23 13:37:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 13:37:43,169 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:43,169 INFO L357 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-23 13:37:43,169 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-07-23 13:37:43,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:43,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:37:43,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,381 INFO L185 omatonBuilderFactory]: Interpolants [3863#true, 3864#false, 3865#(<= ULTIMATE.start_main_~i~5 0), 3866#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 3867#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 3868#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 3869#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 3870#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 3871#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 3872#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 3873#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 3874#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 3875#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 3876#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 3877#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 3878#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3879#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3880#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 3881#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 3882#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3883#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3884#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3885#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 3886#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 3887#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 3888#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 3889#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 3890#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 3891#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 3892#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 3893#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 3894#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 3895#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:37:43,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:37:43,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:37:43,383 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-23 13:37:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:44,197 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 13:37:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:37:44,197 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-23 13:37:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:44,198 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:37:44,198 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:37:44,200 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:37:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:37:44,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:37:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:37:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 13:37:44,207 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-23 13:37:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:44,207 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 13:37:44,207 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:37:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 13:37:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:37:44,208 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:44,208 INFO L357 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-23 13:37:44,208 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-07-23 13:37:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:44,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:37:44,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,411 INFO L185 omatonBuilderFactory]: Interpolants [4100#true, 4101#false, 4102#(<= ULTIMATE.start_main_~i~5 0), 4103#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 4104#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 4105#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 4106#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 4107#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 4108#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 4109#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 4110#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 4111#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 4112#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 4113#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 4114#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 4115#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 4116#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 4117#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 4118#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 4119#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 4120#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 4121#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 4122#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 4123#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 4124#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 4125#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 4126#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 4127#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 4128#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 4129#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 4130#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 4131#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 4132#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 4133#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,412 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:37:44,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:37:44,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:37:44,413 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-23 13:37:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:45,183 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-23 13:37:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:37:45,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-23 13:37:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:45,184 INFO L225 Difference]: With dead ends: 38 [2018-07-23 13:37:45,184 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:37:45,187 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:37:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:37:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 13:37:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:37:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-23 13:37:45,201 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-23 13:37:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:45,201 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-23 13:37:45,201 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:37:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-23 13:37:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:37:45,202 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:45,202 INFO L357 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-23 13:37:45,202 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-07-23 13:37:45,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:45,423 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:37:45,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,423 INFO L185 omatonBuilderFactory]: Interpolants [4352#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 4353#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 4354#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 4355#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 4356#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 4357#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 4358#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 4359#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 4360#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 4361#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 4362#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 4363#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 4364#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 4365#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 4366#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 4367#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 4368#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 4369#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 4370#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 4371#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 4372#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 4373#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 4374#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 4375#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 4376#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 4377#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 4378#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 4344#true, 4345#false, 4346#(<= ULTIMATE.start_main_~i~5 0), 4347#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 4348#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 4349#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 4350#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 4351#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,424 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:37:45,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:37:45,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:37:45,425 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-23 13:37:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:46,264 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 13:37:46,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:37:46,264 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-23 13:37:46,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:46,265 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:37:46,265 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 13:37:46,268 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:37:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 13:37:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 13:37:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:37:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 13:37:46,273 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-23 13:37:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:46,274 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 13:37:46,274 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:37:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 13:37:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:37:46,275 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:46,275 INFO L357 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-23 13:37:46,275 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:46,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-07-23 13:37:46,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:46,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:37:46,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,560 INFO L185 omatonBuilderFactory]: Interpolants [4608#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 4609#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 4610#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 4611#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 4612#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 4613#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 4614#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 4615#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 4616#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 4617#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 4618#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 4619#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 4620#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 4621#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 4622#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 4623#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 4624#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 4625#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 4626#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 4627#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 4628#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 4629#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 4630#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 4595#true, 4596#false, 4597#(<= ULTIMATE.start_main_~i~5 0), 4598#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 4599#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 4600#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 4601#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 4602#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 4603#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 4604#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 4605#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 4606#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 4607#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,561 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:37:46,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:37:46,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:37:46,562 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-23 13:37:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:47,463 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-23 13:37:47,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:37:47,464 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-23 13:37:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:47,464 INFO L225 Difference]: With dead ends: 40 [2018-07-23 13:37:47,464 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:37:47,466 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:37:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:37:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 13:37:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:37:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-23 13:37:47,472 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-23 13:37:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:47,472 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-23 13:37:47,472 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:37:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-23 13:37:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 13:37:47,473 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:47,473 INFO L357 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-23 13:37:47,473 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-07-23 13:37:47,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,710 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:47,710 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:37:47,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,711 INFO L185 omatonBuilderFactory]: Interpolants [4864#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 4865#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 4866#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 4867#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 4868#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 4869#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 4870#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 4871#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 4872#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 4873#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 4874#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 4875#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 4876#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 4877#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 4878#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 4879#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 4880#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 4881#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 4882#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 4883#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 4884#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 4885#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 4886#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 4887#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 4888#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 4889#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 4853#true, 4854#false, 4855#(<= ULTIMATE.start_main_~i~5 0), 4856#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 4857#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 4858#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 4859#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 4860#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 4861#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 4862#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 4863#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,712 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:37:47,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:37:47,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:37:47,713 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-23 13:37:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:48,605 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 13:37:48,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:37:48,605 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-23 13:37:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:48,605 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:37:48,606 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:37:48,607 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:37:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:37:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 13:37:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 13:37:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 13:37:48,617 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-23 13:37:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:48,617 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 13:37:48,617 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:37:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 13:37:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:37:48,618 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:48,618 INFO L357 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-23 13:37:48,621 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-07-23 13:37:48,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,841 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:48,841 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:37:48,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,842 INFO L185 omatonBuilderFactory]: Interpolants [5120#(<= ULTIMATE.start_main_~i~5 0), 5121#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 5122#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 5123#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 5124#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 5125#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 5126#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 5127#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 5128#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 5129#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 5130#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 5131#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 5132#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 5133#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 5134#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 5135#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 5136#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 5137#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 5138#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 5139#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 5140#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 5141#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 5142#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 5143#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 5144#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 5145#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 5146#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 5147#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 5148#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 5149#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 5150#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 5151#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 5152#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 5153#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 5154#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 5155#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 5118#true, 5119#false] [2018-07-23 13:37:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,845 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:37:48,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:37:48,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:37:48,846 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-23 13:37:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:49,816 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-23 13:37:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:37:49,817 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-23 13:37:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:49,817 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:37:49,817 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 13:37:49,819 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:37:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 13:37:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-23 13:37:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:37:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-23 13:37:49,823 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-23 13:37:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:49,824 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-23 13:37:49,824 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:37:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-23 13:37:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 13:37:49,824 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:49,824 INFO L357 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-23 13:37:49,825 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-07-23 13:37:49,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,072 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:50,072 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:37:50,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,073 INFO L185 omatonBuilderFactory]: Interpolants [5390#true, 5391#false, 5392#(<= ULTIMATE.start_main_~i~5 0), 5393#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 5394#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 5395#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 5396#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 5397#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 5398#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 5399#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 5400#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 5401#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 5402#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 5403#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 5404#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 5405#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 5406#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 5407#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 5408#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 5409#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 5410#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 5411#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 5412#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 5413#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 5414#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 5415#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 5416#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 5417#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 5418#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 5419#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 5420#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 5421#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 5422#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 5423#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 5424#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 5425#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 5426#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 5427#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 5428#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,073 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:37:50,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:37:50,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:37:50,074 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-23 13:37:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:51,067 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 13:37:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:37:51,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-23 13:37:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:51,067 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:37:51,068 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:37:51,068 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:37:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:37:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 13:37:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 13:37:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 13:37:51,072 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-23 13:37:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:51,073 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 13:37:51,073 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:37:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 13:37:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:37:51,073 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:51,073 INFO L357 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-23 13:37:51,073 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-07-23 13:37:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:51,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:51,314 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:37:51,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:51,314 INFO L185 omatonBuilderFactory]: Interpolants [5696#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 5697#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 5698#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 5699#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 5700#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 5701#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 5702#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 5703#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 5704#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 5705#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 5706#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 5707#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 5708#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 5669#true, 5670#false, 5671#(<= ULTIMATE.start_main_~i~5 0), 5672#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 5673#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 5674#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 5675#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 5676#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 5677#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 5678#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 5679#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 5680#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 5681#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 5682#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 5683#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 5684#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 5685#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 5686#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 5687#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 5688#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 5689#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 5690#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 5691#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 5692#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 5693#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 5694#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 5695#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:51,315 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:37:51,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:37:51,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:37:51,316 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-23 13:37:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:52,513 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-23 13:37:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:37:52,513 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-23 13:37:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:52,514 INFO L225 Difference]: With dead ends: 44 [2018-07-23 13:37:52,514 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 13:37:52,515 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:37:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 13:37:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-23 13:37:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-23 13:37:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-23 13:37:52,521 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-23 13:37:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:52,521 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-23 13:37:52,522 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:37:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-23 13:37:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 13:37:52,522 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:52,522 INFO L357 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-23 13:37:52,522 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:52,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-07-23 13:37:52,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:52,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:37:52,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,776 INFO L185 omatonBuilderFactory]: Interpolants [5955#true, 5956#false, 5957#(<= ULTIMATE.start_main_~i~5 0), 5958#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 5959#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 5960#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 5961#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 5962#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 5963#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 5964#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 5965#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 5966#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 5967#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 5968#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 5969#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 5970#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 5971#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 5972#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 5973#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 5974#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 5975#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 5976#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 5977#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 5978#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 5979#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 5980#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 5981#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 5982#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 5983#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 5984#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 5985#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 5986#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 5987#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 5988#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 5989#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 5990#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 5991#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 5992#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 5993#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 5994#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 5995#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,777 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:37:52,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:37:52,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:37:52,777 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-23 13:37:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:53,899 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 13:37:53,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:37:53,899 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-23 13:37:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:53,900 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:37:53,900 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:37:53,901 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:37:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:37:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 13:37:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:37:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 13:37:53,906 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-23 13:37:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:53,906 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 13:37:53,906 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:37:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 13:37:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:37:53,907 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:53,907 INFO L357 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-23 13:37:53,907 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-07-23 13:37:53,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,178 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:54,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:37:54,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,179 INFO L185 omatonBuilderFactory]: Interpolants [6272#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 6273#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 6274#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 6275#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 6276#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 6277#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 6278#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 6279#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 6280#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 6281#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 6282#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 6283#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 6284#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 6285#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 6286#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 6287#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 6288#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 6289#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 6248#true, 6249#false, 6250#(<= ULTIMATE.start_main_~i~5 0), 6251#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 6252#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 6253#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 6254#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 6255#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 6256#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 6257#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 6258#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 6259#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 6260#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 6261#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 6262#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 6263#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 6264#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 6265#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 6266#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 6267#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 6268#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 6269#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 6270#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 6271#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,179 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:37:54,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:37:54,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:37:54,180 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-23 13:37:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:55,260 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-23 13:37:55,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:37:55,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-23 13:37:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:55,261 INFO L225 Difference]: With dead ends: 46 [2018-07-23 13:37:55,261 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 13:37:55,262 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:37:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 13:37:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-23 13:37:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 13:37:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-23 13:37:55,266 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-23 13:37:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:55,266 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-23 13:37:55,266 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:37:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-23 13:37:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 13:37:55,267 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:55,267 INFO L357 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-23 13:37:55,267 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-07-23 13:37:55,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:55,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:37:55,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,491 INFO L185 omatonBuilderFactory]: Interpolants [6548#true, 6549#false, 6550#(<= ULTIMATE.start_main_~i~5 0), 6551#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 6552#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 6553#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 6554#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 6555#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 6556#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 6557#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 6558#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 6559#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 6560#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 6561#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 6562#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 6563#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 6564#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 6565#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 6566#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 6567#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 6568#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 6569#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 6570#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 6571#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 6572#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 6573#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 6574#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 6575#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 6576#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 6577#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 6578#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 6579#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 6580#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 6581#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 6582#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 6583#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 6584#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 6585#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 6586#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 6587#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 6588#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 6589#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 6590#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,491 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:37:55,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:37:55,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:37:55,492 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-23 13:37:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:56,335 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 13:37:56,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:37:56,335 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-23 13:37:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:56,336 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:37:56,336 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 13:37:56,337 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:37:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 13:37:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 13:37:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 13:37:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 13:37:56,341 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-23 13:37:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:56,342 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 13:37:56,342 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:37:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 13:37:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:37:56,342 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:56,342 INFO L357 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-23 13:37:56,342 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-07-23 13:37:56,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:56,607 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:56,607 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:37:56,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:56,608 INFO L185 omatonBuilderFactory]: Interpolants [6855#true, 6856#false, 6857#(<= ULTIMATE.start_main_~i~5 0), 6858#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 6859#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 6860#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 6861#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 6862#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 6863#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 6864#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 6865#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 6866#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 6867#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 6868#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 6869#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 6870#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 6871#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 6872#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 6873#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 6874#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 6875#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 6876#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 6877#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 6878#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 6879#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 6880#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 6881#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 6882#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 6883#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 6884#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 6885#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 6886#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 6887#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 6888#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 6889#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 6890#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 6891#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 6892#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 6893#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 6894#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 6895#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 6896#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 6897#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 6898#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:56,609 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:37:56,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:37:56,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:37:56,610 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-23 13:37:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:57,626 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-23 13:37:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:37:57,626 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-23 13:37:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:57,627 INFO L225 Difference]: With dead ends: 48 [2018-07-23 13:37:57,627 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 13:37:57,628 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:37:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 13:37:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-23 13:37:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 13:37:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-23 13:37:57,632 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-23 13:37:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:57,633 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-23 13:37:57,633 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:37:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-23 13:37:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 13:37:57,633 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:57,634 INFO L357 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-23 13:37:57,634 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:57,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-07-23 13:37:57,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:57,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:37:57,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,852 INFO L185 omatonBuilderFactory]: Interpolants [7169#true, 7170#false, 7171#(<= ULTIMATE.start_main_~i~5 0), 7172#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 7173#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 7174#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 7175#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 7176#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 7177#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 7178#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 7179#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 7180#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 7181#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 7182#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 7183#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 7184#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 7185#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 7186#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 7187#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 7188#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 7189#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 7190#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 7191#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 7192#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 7193#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 7194#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 7195#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 7196#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 7197#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 7198#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 7199#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 7200#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 7201#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 7202#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 7203#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 7204#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 7205#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 7206#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 7207#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 7208#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 7209#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 7210#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 7211#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 7212#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 7213#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,853 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:37:57,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:37:57,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:37:57,854 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-23 13:37:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:58,922 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 13:37:58,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:37:58,922 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-23 13:37:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:58,922 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:37:58,922 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:37:58,923 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:37:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:37:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 13:37:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:37:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 13:37:58,928 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-23 13:37:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:58,928 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 13:37:58,928 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:37:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 13:37:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:37:58,929 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:58,929 INFO L357 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-23 13:37:58,929 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:37:58,929 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-07-23 13:37:58,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:59,140 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:59,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:37:59,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:59,141 INFO L185 omatonBuilderFactory]: Interpolants [7490#true, 7491#false, 7492#(<= ULTIMATE.start_main_~i~5 0), 7493#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 7494#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 7495#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 7496#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 7497#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 7498#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 7499#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 7500#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 7501#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 7502#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 7503#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 7504#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 7505#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 7506#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 7507#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 7508#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 7509#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 7510#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 7511#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 7512#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 7513#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 7514#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 7515#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 7516#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 7517#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 7518#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 7519#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 7520#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 7521#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 7522#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 7523#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 7524#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 7525#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 7526#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 7527#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 7528#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 7529#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 7530#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 7531#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 7532#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 7533#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 7534#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 7535#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:37:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:59,142 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:37:59,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:37:59,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:37:59,143 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-23 13:38:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:00,275 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-23 13:38:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:38:00,275 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-23 13:38:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:00,276 INFO L225 Difference]: With dead ends: 50 [2018-07-23 13:38:00,276 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 13:38:00,277 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:38:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 13:38:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-23 13:38:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 13:38:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-23 13:38:00,281 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-23 13:38:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:00,282 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-23 13:38:00,282 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:38:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-23 13:38:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 13:38:00,282 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:00,282 INFO L357 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-23 13:38:00,283 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-07-23 13:38:00,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,521 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:00,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:38:00,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,521 INFO L185 omatonBuilderFactory]: Interpolants [7818#true, 7819#false, 7820#(<= ULTIMATE.start_main_~i~5 0), 7821#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 7822#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 7823#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 7824#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 7825#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 7826#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 7827#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 7828#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 7829#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 7830#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 7831#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 7832#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 7833#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 7834#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 7835#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 7836#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 7837#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 7838#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 7839#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 7840#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 7841#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 7842#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 7843#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 7844#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 7845#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 7846#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 7847#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 7848#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 7849#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 7850#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 7851#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 7852#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 7853#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 7854#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 7855#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 7856#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 7857#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 7858#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 7859#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 7860#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 7861#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 7862#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 7863#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 7864#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,522 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:38:00,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:38:00,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:38:00,523 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-23 13:38:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:01,717 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 13:38:01,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:38:01,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-23 13:38:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:01,718 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:38:01,718 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 13:38:01,719 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:38:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 13:38:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 13:38:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:38:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 13:38:01,725 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-23 13:38:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:01,725 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 13:38:01,725 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:38:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 13:38:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:38:01,726 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:01,726 INFO L357 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-23 13:38:01,726 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:01,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-07-23 13:38:01,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:01,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:38:01,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,981 INFO L185 omatonBuilderFactory]: Interpolants [8192#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 8193#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 8194#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 8195#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 8196#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 8197#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 8198#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 8199#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 8200#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 8153#true, 8154#false, 8155#(<= ULTIMATE.start_main_~i~5 0), 8156#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 8157#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 8158#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 8159#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 8160#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 8161#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 8162#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 8163#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 8164#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 8165#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 8166#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 8167#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 8168#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 8169#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 8170#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 8171#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 8172#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 8173#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 8174#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 8175#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 8176#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 8177#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 8178#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 8179#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 8180#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 8181#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 8182#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 8183#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 8184#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 8185#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 8186#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 8187#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 8188#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 8189#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 8190#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 8191#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,981 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:38:01,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:38:01,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:38:01,982 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-23 13:38:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:03,151 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-23 13:38:03,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:38:03,152 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-23 13:38:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:03,152 INFO L225 Difference]: With dead ends: 52 [2018-07-23 13:38:03,152 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 13:38:03,153 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:38:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 13:38:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-23 13:38:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 13:38:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-23 13:38:03,157 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-23 13:38:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:03,157 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-23 13:38:03,157 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:38:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-23 13:38:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 13:38:03,158 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:03,158 INFO L357 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-23 13:38:03,158 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-07-23 13:38:03,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:03,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:38:03,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,402 INFO L185 omatonBuilderFactory]: Interpolants [8495#true, 8496#false, 8497#(<= ULTIMATE.start_main_~i~5 0), 8498#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 8499#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 8500#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 8501#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 8502#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 8503#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 8504#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 8505#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 8506#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 8507#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 8508#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 8509#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 8510#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 8511#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 8512#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 8513#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 8514#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 8515#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 8516#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 8517#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 8518#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 8519#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 8520#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 8521#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 8522#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 8523#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 8524#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 8525#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 8526#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 8527#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 8528#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 8529#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 8530#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 8531#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 8532#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 8533#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 8534#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 8535#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 8536#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 8537#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 8538#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 8539#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 8540#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 8541#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 8542#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 8543#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,403 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:38:03,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:38:03,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:38:03,404 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-23 13:38:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:04,596 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 13:38:04,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:38:04,597 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-23 13:38:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:04,597 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:38:04,597 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:38:04,598 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:38:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:38:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 13:38:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:38:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 13:38:04,601 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-23 13:38:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:04,601 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 13:38:04,601 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:38:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 13:38:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:38:04,602 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:04,602 INFO L357 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-23 13:38:04,602 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-07-23 13:38:04,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:04,894 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:04,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:38:04,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:04,894 INFO L185 omatonBuilderFactory]: Interpolants [8844#true, 8845#false, 8846#(<= ULTIMATE.start_main_~i~5 0), 8847#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 8848#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 8849#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 8850#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 8851#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 8852#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 8853#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 8854#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 8855#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 8856#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 8857#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 8858#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 8859#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 8860#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 8861#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 8862#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 8863#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 8864#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 8865#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 8866#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 8867#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 8868#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 8869#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 8870#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 8871#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 8872#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 8873#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 8874#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 8875#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 8876#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 8877#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 8878#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 8879#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 8880#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 8881#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 8882#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 8883#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 8884#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 8885#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 8886#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 8887#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 8888#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 8889#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 8890#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 8891#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 8892#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 8893#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:04,895 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:38:04,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:38:04,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:38:04,895 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-23 13:38:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:06,338 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-23 13:38:06,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:38:06,338 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-23 13:38:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:06,339 INFO L225 Difference]: With dead ends: 54 [2018-07-23 13:38:06,339 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 13:38:06,340 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:38:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 13:38:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-23 13:38:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 13:38:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-23 13:38:06,344 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-23 13:38:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:06,344 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-23 13:38:06,344 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:38:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-23 13:38:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-23 13:38:06,344 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:06,345 INFO L357 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-23 13:38:06,345 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-07-23 13:38:06,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,597 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:06,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:38:06,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,597 INFO L185 omatonBuilderFactory]: Interpolants [9216#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 9217#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 9218#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 9219#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 9220#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 9221#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 9222#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 9223#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 9224#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 9225#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 9226#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 9227#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 9228#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 9229#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 9230#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 9231#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 9232#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 9233#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 9234#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 9235#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 9236#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 9237#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 9238#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 9239#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 9240#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 9241#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 9242#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 9243#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 9244#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 9245#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 9246#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 9247#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 9248#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 9249#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 9250#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 9200#true, 9201#false, 9202#(<= ULTIMATE.start_main_~i~5 0), 9203#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 9204#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 9205#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 9206#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 9207#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 9208#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 9209#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 9210#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 9211#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 9212#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 9213#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 9214#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 9215#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,598 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:38:06,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:38:06,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:38:06,599 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-23 13:38:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:08,091 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 13:38:08,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:38:08,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-23 13:38:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:08,091 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:38:08,092 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:38:08,092 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:38:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:38:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:38:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:38:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 13:38:08,095 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-23 13:38:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:08,095 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 13:38:08,096 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:38:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 13:38:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:38:08,096 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:08,096 INFO L357 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-23 13:38:08,096 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-07-23 13:38:08,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:08,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:08,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:38:08,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:08,368 INFO L185 omatonBuilderFactory]: Interpolants [9600#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 9601#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 9602#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 9603#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 9604#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 9605#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 9606#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 9607#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 9608#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 9609#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 9610#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 9611#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 9612#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 9613#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 9614#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 9563#true, 9564#false, 9565#(<= ULTIMATE.start_main_~i~5 0), 9566#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 9567#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 9568#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 9569#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 9570#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 9571#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 9572#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 9573#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 9574#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 9575#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 9576#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 9577#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 9578#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 9579#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 9580#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 9581#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 9582#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 9583#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 9584#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 9585#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 9586#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 9587#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 9588#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 9589#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 9590#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 9591#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 9592#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 9593#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 9594#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 9595#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 9596#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 9597#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 9598#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 9599#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:08,369 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:38:08,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:38:08,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:38:08,370 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-23 13:38:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:09,923 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-23 13:38:09,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:38:09,923 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-23 13:38:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:09,924 INFO L225 Difference]: With dead ends: 56 [2018-07-23 13:38:09,924 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 13:38:09,925 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:38:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 13:38:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-23 13:38:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-23 13:38:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-23 13:38:09,929 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-23 13:38:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:09,930 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-23 13:38:09,930 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:38:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-23 13:38:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-23 13:38:09,930 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:09,930 INFO L357 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-23 13:38:09,930 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:09,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-07-23 13:38:09,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:10,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:10,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:38:10,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:10,255 INFO L185 omatonBuilderFactory]: Interpolants [9984#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 9985#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 9933#true, 9934#false, 9935#(<= ULTIMATE.start_main_~i~5 0), 9936#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 9937#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 9938#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 9939#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 9940#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 9941#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 9942#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 9943#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 9944#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 9945#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 9946#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 9947#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 9948#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 9949#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 9950#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 9951#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 9952#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 9953#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 9954#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 9955#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 9956#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 9957#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 9958#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 9959#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 9960#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 9961#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 9962#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 9963#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 9964#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 9965#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 9966#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 9967#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 9968#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 9969#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 9970#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 9971#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 9972#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 9973#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 9974#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 9975#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 9976#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 9977#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 9978#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 9979#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 9980#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 9981#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 9982#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 9983#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:10,255 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:38:10,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:38:10,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:38:10,256 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-23 13:38:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:12,016 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 13:38:12,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:38:12,016 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-23 13:38:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:12,017 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:38:12,017 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 13:38:12,018 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:38:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 13:38:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 13:38:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 13:38:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 13:38:12,029 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-23 13:38:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:12,029 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 13:38:12,029 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:38:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 13:38:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 13:38:12,030 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:12,030 INFO L357 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-23 13:38:12,030 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-07-23 13:38:12,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:12,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:38:12,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,404 INFO L185 omatonBuilderFactory]: Interpolants [10310#true, 10311#false, 10312#(<= ULTIMATE.start_main_~i~5 0), 10313#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 10314#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 10315#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 10316#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 10317#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 10318#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 10319#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 10320#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 10321#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 10322#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 10323#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 10324#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 10325#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 10326#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 10327#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 10328#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 10329#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 10330#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 10331#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 10332#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 10333#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 10334#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 10335#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 10336#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 10337#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 10338#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 10339#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 10340#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 10341#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 10342#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 10343#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 10344#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 10345#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 10346#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 10347#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 10348#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 10349#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 10350#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 10351#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 10352#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 10353#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 10354#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 10355#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 10356#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 10357#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 10358#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 10359#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 10360#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 10361#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 10362#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 10363#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,405 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:38:12,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:38:12,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:38:12,405 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-23 13:38:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:14,008 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-23 13:38:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:38:14,008 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-23 13:38:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:14,009 INFO L225 Difference]: With dead ends: 58 [2018-07-23 13:38:14,009 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 13:38:14,010 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:38:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 13:38:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-23 13:38:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 13:38:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-23 13:38:14,014 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-23 13:38:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:14,014 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-23 13:38:14,014 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:38:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-23 13:38:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-23 13:38:14,015 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:14,015 INFO L357 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-23 13:38:14,015 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-07-23 13:38:14,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:14,307 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:14,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:38:14,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:14,308 INFO L185 omatonBuilderFactory]: Interpolants [10694#true, 10695#false, 10696#(<= ULTIMATE.start_main_~i~5 0), 10697#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 10698#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 10699#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 10700#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 10701#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 10702#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 10703#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 10704#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 10705#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 10706#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 10707#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 10708#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 10709#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 10710#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 10711#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 10712#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 10713#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 10714#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 10715#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 10716#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 10717#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 10718#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 10719#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 10720#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 10721#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 10722#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 10723#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 10724#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 10725#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 10726#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 10727#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 10728#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 10729#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 10730#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 10731#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 10732#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 10733#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 10734#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 10735#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 10736#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 10737#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 10738#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 10739#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 10740#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 10741#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 10742#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 10743#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 10744#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 10745#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 10746#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 10747#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 10748#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:14,308 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:38:14,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:38:14,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:38:14,309 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-23 13:38:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:16,082 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 13:38:16,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:38:16,082 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-23 13:38:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:16,083 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:38:16,083 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:38:16,083 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:38:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:38:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 13:38:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:38:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 13:38:16,088 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-23 13:38:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:16,088 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 13:38:16,088 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:38:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 13:38:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 13:38:16,088 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:16,089 INFO L357 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-23 13:38:16,089 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-07-23 13:38:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:16,385 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:16,385 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:38:16,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:16,386 INFO L185 omatonBuilderFactory]: Interpolants [11136#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 11137#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 11138#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 11139#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 11140#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 11085#true, 11086#false, 11087#(<= ULTIMATE.start_main_~i~5 0), 11088#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 11089#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 11090#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 11091#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 11092#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 11093#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 11094#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 11095#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 11096#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 11097#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 11098#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 11099#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 11100#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 11101#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 11102#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 11103#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 11104#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 11105#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 11106#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 11107#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 11108#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 11109#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 11110#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 11111#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 11112#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 11113#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 11114#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 11115#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 11116#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 11117#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 11118#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 11119#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 11120#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 11121#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 11122#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 11123#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 11124#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 11125#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 11126#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 11127#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 11128#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 11129#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 11130#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 11131#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 11132#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 11133#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 11134#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 11135#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:16,386 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:38:16,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:38:16,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:38:16,387 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-23 13:38:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:18,127 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-23 13:38:18,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:38:18,127 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-23 13:38:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:18,128 INFO L225 Difference]: With dead ends: 60 [2018-07-23 13:38:18,128 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 13:38:18,129 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:38:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 13:38:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-23 13:38:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 13:38:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-23 13:38:18,132 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-23 13:38:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:18,132 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-23 13:38:18,132 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:38:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-23 13:38:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 13:38:18,133 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:18,133 INFO L357 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-23 13:38:18,133 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-07-23 13:38:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:18,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:18,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:38:18,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:18,445 INFO L185 omatonBuilderFactory]: Interpolants [11520#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 11521#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 11522#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 11523#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 11524#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 11525#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 11526#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 11527#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 11528#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 11529#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 11530#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 11531#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 11532#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 11533#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 11534#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 11535#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 11536#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 11537#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 11538#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 11539#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 11483#true, 11484#false, 11485#(<= ULTIMATE.start_main_~i~5 0), 11486#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 11487#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 11488#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 11489#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 11490#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 11491#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 11492#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 11493#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 11494#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 11495#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 11496#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 11497#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 11498#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 11499#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 11500#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 11501#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 11502#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 11503#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 11504#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 11505#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 11506#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 11507#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 11508#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 11509#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 11510#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 11511#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 11512#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 11513#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 11514#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 11515#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 11516#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 11517#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 11518#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 11519#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:18,445 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:38:18,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:38:18,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:38:18,446 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-23 13:38:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:20,184 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 13:38:20,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:38:20,184 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-23 13:38:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:20,185 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:38:20,185 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:38:20,186 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:38:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:38:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 13:38:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 13:38:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 13:38:20,190 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-23 13:38:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:20,190 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 13:38:20,190 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:38:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 13:38:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:38:20,191 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:20,191 INFO L357 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-23 13:38:20,191 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-07-23 13:38:20,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:20,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:20,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:38:20,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:20,519 INFO L185 omatonBuilderFactory]: Interpolants [11904#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 11905#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 11906#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 11907#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 11908#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 11909#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 11910#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 11911#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 11912#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 11913#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 11914#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 11915#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 11916#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 11917#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 11918#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 11919#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 11920#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 11921#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 11922#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 11923#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 11924#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 11925#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 11926#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 11927#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 11928#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 11929#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 11930#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 11931#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 11932#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 11933#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 11934#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 11935#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 11936#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 11937#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 11938#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 11939#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 11940#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 11941#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 11942#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 11943#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 11944#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 11945#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 11888#true, 11889#false, 11890#(<= ULTIMATE.start_main_~i~5 0), 11891#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 11892#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 11893#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 11894#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 11895#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 11896#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 11897#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 11898#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 11899#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 11900#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 11901#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 11902#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 11903#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:20,519 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:38:20,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:38:20,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:38:20,520 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-23 13:38:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:22,454 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-23 13:38:22,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:38:22,454 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-23 13:38:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:22,454 INFO L225 Difference]: With dead ends: 62 [2018-07-23 13:38:22,454 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 13:38:22,455 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:38:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 13:38:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-23 13:38:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 13:38:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-23 13:38:22,459 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-23 13:38:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:22,459 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-23 13:38:22,460 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:38:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-23 13:38:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 13:38:22,460 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:22,460 INFO L357 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-23 13:38:22,461 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-07-23 13:38:22,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:22,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:22,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:38:22,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:22,788 INFO L185 omatonBuilderFactory]: Interpolants [12300#true, 12301#false, 12302#(<= ULTIMATE.start_main_~i~5 0), 12303#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 12304#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 12305#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 12306#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 12307#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 12308#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 12309#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 12310#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 12311#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 12312#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 12313#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 12314#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 12315#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 12316#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 12317#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 12318#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 12319#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 12320#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 12321#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 12322#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 12323#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 12324#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 12325#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 12326#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 12327#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 12328#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 12329#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 12330#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 12331#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 12332#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 12333#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 12334#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 12335#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 12336#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 12337#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 12338#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 12339#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 12340#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 12341#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 12342#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 12343#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 12344#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 12345#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 12346#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 12347#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 12348#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 12349#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 12350#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 12351#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 12352#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 12353#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 12354#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 12355#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 12356#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 12357#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 12358#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:22,789 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:38:22,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:38:22,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:38:22,789 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-23 13:38:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:24,677 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 13:38:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:38:24,678 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-23 13:38:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:24,678 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:38:24,678 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 13:38:24,679 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:38:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 13:38:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 13:38:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 13:38:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 13:38:24,682 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-23 13:38:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:24,683 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 13:38:24,683 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:38:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 13:38:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:38:24,683 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:24,683 INFO L357 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-23 13:38:24,683 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:24,684 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-07-23 13:38:24,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,073 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:25,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:38:25,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,074 INFO L185 omatonBuilderFactory]: Interpolants [12719#true, 12720#false, 12721#(<= ULTIMATE.start_main_~i~5 0), 12722#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 12723#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 12724#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 12725#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 12726#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 12727#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 12728#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 12729#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 12730#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 12731#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 12732#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 12733#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 12734#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 12735#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 12736#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 12737#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 12738#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 12739#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 12740#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 12741#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 12742#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 12743#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 12744#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 12745#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 12746#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 12747#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 12748#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 12749#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 12750#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 12751#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 12752#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 12753#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 12754#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 12755#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 12756#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 12757#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 12758#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 12759#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 12760#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 12761#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 12762#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 12763#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 12764#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 12765#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 12766#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 12767#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 12768#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 12769#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 12770#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 12771#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 12772#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 12773#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 12774#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 12775#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 12776#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 12777#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 12778#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,074 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:38:25,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:38:25,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:38:25,075 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-23 13:38:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:27,135 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-23 13:38:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:38:27,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-23 13:38:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:27,136 INFO L225 Difference]: With dead ends: 64 [2018-07-23 13:38:27,136 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 13:38:27,137 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 13:38:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 13:38:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-23 13:38:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 13:38:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-23 13:38:27,141 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-23 13:38:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:27,142 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-23 13:38:27,142 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:38:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-23 13:38:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-23 13:38:27,142 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:27,143 INFO L357 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-23 13:38:27,143 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-07-23 13:38:27,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:27,543 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:27,543 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:38:27,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:27,544 INFO L185 omatonBuilderFactory]: Interpolants [13184#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 13185#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 13186#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 13187#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 13188#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 13189#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 13190#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 13191#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 13192#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 13193#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 13194#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 13195#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 13196#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 13197#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 13198#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 13199#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 13200#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 13201#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 13202#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 13203#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 13204#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 13205#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 13145#true, 13146#false, 13147#(<= ULTIMATE.start_main_~i~5 0), 13148#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 13149#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 13150#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 13151#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 13152#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 13153#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 13154#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 13155#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 13156#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 13157#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 13158#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 13159#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 13160#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 13161#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 13162#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 13163#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 13164#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 13165#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 13166#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 13167#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 13168#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 13169#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 13170#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 13171#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 13172#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 13173#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 13174#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 13175#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 13176#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 13177#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 13178#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 13179#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 13180#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 13181#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 13182#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 13183#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:27,544 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:38:27,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:38:27,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:38:27,545 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-23 13:38:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:29,748 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 13:38:29,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:38:29,748 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-23 13:38:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:29,749 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:38:29,749 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 13:38:29,750 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 13:38:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 13:38:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 13:38:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 13:38:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 13:38:29,753 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-23 13:38:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:29,753 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 13:38:29,753 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:38:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 13:38:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 13:38:29,754 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:29,754 INFO L357 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-23 13:38:29,754 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-07-23 13:38:29,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:30,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:30,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:38:30,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:30,190 INFO L185 omatonBuilderFactory]: Interpolants [13578#true, 13579#false, 13580#(<= ULTIMATE.start_main_~i~5 0), 13581#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 13582#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 13583#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 13584#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 13585#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 13586#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 13587#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 13588#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 13589#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 13590#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 13591#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 13592#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 13593#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 13594#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 13595#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 13596#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 13597#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 13598#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 13599#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 13600#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 13601#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 13602#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 13603#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 13604#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 13605#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 13606#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 13607#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 13608#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 13609#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 13610#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 13611#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 13612#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 13613#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 13614#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 13615#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 13616#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 13617#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 13618#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 13619#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 13620#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 13621#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 13622#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 13623#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 13624#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 13625#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 13626#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 13627#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 13628#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 13629#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 13630#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 13631#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 13632#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 13633#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 13634#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 13635#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 13636#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 13637#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 13638#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 13639#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:30,191 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:38:30,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:38:30,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:38:30,191 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-23 13:38:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:32,489 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-23 13:38:32,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:38:32,489 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-23 13:38:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:32,490 INFO L225 Difference]: With dead ends: 66 [2018-07-23 13:38:32,490 INFO L226 Difference]: Without dead ends: 64 [2018-07-23 13:38:32,491 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 13:38:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-23 13:38:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-23 13:38:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-23 13:38:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-23 13:38:32,496 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-23 13:38:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:32,496 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-23 13:38:32,496 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:38:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-23 13:38:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-23 13:38:32,497 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:32,497 INFO L357 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-23 13:38:32,498 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:32,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-07-23 13:38:32,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:32,910 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:32,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:38:32,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:32,911 INFO L185 omatonBuilderFactory]: Interpolants [14080#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 14018#true, 14019#false, 14020#(<= ULTIMATE.start_main_~i~5 0), 14021#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 14022#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 14023#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 14024#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 14025#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 14026#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 14027#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 14028#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 14029#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 14030#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 14031#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 14032#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 14033#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 14034#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 14035#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 14036#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 14037#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 14038#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 14039#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 14040#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 14041#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 14042#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 14043#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 14044#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 14045#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 14046#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 14047#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 14048#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 14049#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 14050#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 14051#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 14052#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 14053#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 14054#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 14055#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 14056#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 14057#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 14058#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 14059#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 14060#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 14061#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 14062#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 14063#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 14064#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 14065#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 14066#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 14067#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 14068#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 14069#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 14070#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 14071#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 14072#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 14073#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 14074#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 14075#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 14076#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 14077#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 14078#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 14079#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:32,911 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:38:32,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:38:32,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:38:32,912 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-23 13:38:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:35,386 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 13:38:35,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:38:35,386 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-23 13:38:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:35,387 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:38:35,387 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:38:35,388 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 13:38:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:38:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 13:38:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:38:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 13:38:35,394 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-23 13:38:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:35,395 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 13:38:35,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:38:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 13:38:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 13:38:35,396 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:35,396 INFO L357 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-23 13:38:35,396 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-07-23 13:38:35,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:35,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:35,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:38:35,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:35,922 INFO L185 omatonBuilderFactory]: Interpolants [14465#true, 14466#false, 14467#(<= ULTIMATE.start_main_~i~5 0), 14468#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 14469#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 14470#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 14471#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 14472#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 14473#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 14474#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 14475#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 14476#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 14477#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 14478#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 14479#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 14480#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 14481#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 14482#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 14483#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 14484#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 14485#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 14486#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 14487#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 14488#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 14489#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 14490#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 14491#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 14492#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 14493#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 14494#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 14495#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 14496#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 14497#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 14498#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 14499#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 14500#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 14501#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 14502#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 14503#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 14504#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 14505#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 14506#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 14507#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 14508#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 14509#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 14510#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 14511#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 14512#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 14513#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 14514#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 14515#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 14516#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 14517#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 14518#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 14519#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 14520#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 14521#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 14522#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 14523#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 14524#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 14525#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 14526#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 14527#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 14528#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:35,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:38:35,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:38:35,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:38:35,923 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-23 13:38:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:38,460 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-23 13:38:38,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:38:38,460 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-23 13:38:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:38,461 INFO L225 Difference]: With dead ends: 68 [2018-07-23 13:38:38,461 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 13:38:38,462 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 13:38:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 13:38:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-23 13:38:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 13:38:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-23 13:38:38,468 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-23 13:38:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:38,468 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-23 13:38:38,468 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:38:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-23 13:38:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-23 13:38:38,469 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:38,469 INFO L357 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-23 13:38:38,469 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:38,470 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-07-23 13:38:38,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:38,883 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:38,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:38:38,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:38,884 INFO L185 omatonBuilderFactory]: Interpolants [14976#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 14977#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 14978#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 14979#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 14980#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 14981#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 14982#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 14983#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 14919#true, 14920#false, 14921#(<= ULTIMATE.start_main_~i~5 0), 14922#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 14923#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 14924#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 14925#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 14926#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 14927#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 14928#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 14929#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 14930#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 14931#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 14932#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 14933#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 14934#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 14935#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 14936#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 14937#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 14938#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 14939#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 14940#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 14941#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 14942#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 14943#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 14944#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 14945#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 14946#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 14947#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 14948#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 14949#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 14950#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 14951#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 14952#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 14953#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 14954#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 14955#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 14956#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 14957#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 14958#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 14959#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 14960#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 14961#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 14962#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 14963#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 14964#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 14965#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 14966#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 14967#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 14968#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 14969#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 14970#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 14971#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 14972#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 14973#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 14974#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 14975#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:38,884 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:38:38,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:38:38,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:38:38,885 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-23 13:38:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:41,298 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 13:38:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:38:41,299 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-23 13:38:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:41,299 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:38:41,299 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:38:41,300 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 13:38:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:38:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 13:38:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:38:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 13:38:41,305 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-23 13:38:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:41,305 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 13:38:41,305 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:38:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 13:38:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:38:41,306 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:41,306 INFO L357 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-23 13:38:41,306 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-07-23 13:38:41,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:41,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:38:41,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,737 INFO L185 omatonBuilderFactory]: Interpolants [15380#true, 15381#false, 15382#(<= ULTIMATE.start_main_~i~5 0), 15383#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 15384#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 15385#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 15386#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 15387#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 15388#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 15389#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 15390#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 15391#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 15392#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 15393#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 15394#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 15395#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 15396#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 15397#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 15398#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 15399#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 15400#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 15401#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 15402#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 15403#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 15404#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 15405#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 15406#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 15407#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 15408#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 15409#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 15410#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 15411#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 15412#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 15413#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 15414#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 15415#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 15416#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 15417#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 15418#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 15419#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 15420#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 15421#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 15422#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 15423#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 15424#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 15425#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 15426#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 15427#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 15428#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 15429#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 15430#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 15431#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 15432#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 15433#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 15434#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 15435#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 15436#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 15437#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 15438#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 15439#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 15440#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 15441#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 15442#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 15443#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 15444#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 15445#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,738 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:38:41,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:38:41,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:38:41,739 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-23 13:38:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:44,453 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-23 13:38:44,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:38:44,453 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-23 13:38:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:44,454 INFO L225 Difference]: With dead ends: 70 [2018-07-23 13:38:44,454 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 13:38:44,456 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 13:38:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 13:38:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-23 13:38:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 13:38:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-23 13:38:44,461 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-23 13:38:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:44,461 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-23 13:38:44,461 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:38:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-23 13:38:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 13:38:44,462 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:44,462 INFO L357 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-23 13:38:44,462 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:44,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-07-23 13:38:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:44,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:44,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:38:44,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:44,926 INFO L185 omatonBuilderFactory]: Interpolants [15872#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 15873#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 15874#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 15875#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 15876#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 15877#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 15878#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 15879#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 15880#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 15881#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 15882#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 15883#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 15884#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 15885#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 15886#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 15887#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 15888#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 15889#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 15890#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 15891#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 15892#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 15893#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 15894#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 15895#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 15896#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 15897#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 15898#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 15899#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 15900#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 15901#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 15902#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 15903#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 15904#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 15905#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 15906#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 15907#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 15908#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 15909#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 15910#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 15911#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 15912#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 15913#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 15914#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 15848#true, 15849#false, 15850#(<= ULTIMATE.start_main_~i~5 0), 15851#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 15852#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 15853#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 15854#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 15855#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 15856#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 15857#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 15858#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 15859#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 15860#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 15861#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 15862#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 15863#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 15864#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 15865#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 15866#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 15867#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 15868#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 15869#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 15870#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 15871#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:44,926 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:38:44,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:38:44,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:38:44,927 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-23 13:38:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:47,553 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 13:38:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:38:47,554 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-23 13:38:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:47,554 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:38:47,554 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 13:38:47,555 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 13:38:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 13:38:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 13:38:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 13:38:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 13:38:47,560 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-23 13:38:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:47,561 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 13:38:47,561 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:38:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 13:38:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:38:47,562 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:47,562 INFO L357 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-23 13:38:47,562 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-07-23 13:38:47,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:48,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:48,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:38:48,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:48,036 INFO L185 omatonBuilderFactory]: Interpolants [16384#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 16385#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 16386#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 16387#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 16388#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 16389#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 16390#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 16323#true, 16324#false, 16325#(<= ULTIMATE.start_main_~i~5 0), 16326#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 16327#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 16328#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 16329#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 16330#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 16331#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 16332#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 16333#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 16334#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 16335#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 16336#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 16337#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 16338#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 16339#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 16340#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 16341#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 16342#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 16343#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 16344#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 16345#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 16346#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 16347#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 16348#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 16349#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 16350#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 16351#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 16352#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 16353#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 16354#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 16355#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 16356#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 16357#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 16358#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 16359#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 16360#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 16361#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 16362#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 16363#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 16364#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 16365#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 16366#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 16367#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 16368#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 16369#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 16370#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 16371#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 16372#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 16373#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 16374#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 16375#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 16376#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 16377#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 16378#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 16379#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 16380#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 16381#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 16382#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 16383#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:48,037 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:38:48,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:38:48,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:38:48,038 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-23 13:38:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:50,765 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-23 13:38:50,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:38:50,765 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-23 13:38:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:50,766 INFO L225 Difference]: With dead ends: 72 [2018-07-23 13:38:50,766 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 13:38:50,767 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 13:38:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 13:38:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-23 13:38:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:38:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-23 13:38:50,772 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-23 13:38:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:50,772 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-23 13:38:50,772 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:38:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-23 13:38:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-23 13:38:50,773 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:50,773 INFO L357 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-23 13:38:50,773 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:50,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-07-23 13:38:50,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:51,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:51,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:38:51,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:51,248 INFO L185 omatonBuilderFactory]: Interpolants [16805#true, 16806#false, 16807#(<= ULTIMATE.start_main_~i~5 0), 16808#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 16809#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 16810#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 16811#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 16812#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 16813#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 16814#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 16815#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 16816#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 16817#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 16818#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 16819#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 16820#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 16821#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 16822#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 16823#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 16824#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 16825#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 16826#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 16827#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 16828#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 16829#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 16830#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 16831#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 16832#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 16833#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 16834#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 16835#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 16836#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 16837#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 16838#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 16839#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 16840#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 16841#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 16842#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 16843#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 16844#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 16845#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 16846#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 16847#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 16848#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 16849#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 16850#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 16851#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 16852#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 16853#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 16854#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 16855#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 16856#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 16857#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 16858#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 16859#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 16860#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 16861#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 16862#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 16863#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 16864#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 16865#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 16866#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 16867#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 16868#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 16869#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 16870#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 16871#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 16872#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 16873#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:51,248 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:38:51,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:38:51,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:38:51,249 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-23 13:38:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:54,241 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 13:38:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:38:54,241 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-23 13:38:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:54,242 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:38:54,242 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 13:38:54,242 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-07-23 13:38:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 13:38:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 13:38:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 13:38:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 13:38:54,247 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-23 13:38:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:54,247 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 13:38:54,247 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:38:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 13:38:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 13:38:54,248 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:54,248 INFO L357 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-23 13:38:54,248 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:54,248 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-07-23 13:38:54,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:54,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:54,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:38:54,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,750 INFO L185 omatonBuilderFactory]: Interpolants [17294#true, 17295#false, 17296#(<= ULTIMATE.start_main_~i~5 0), 17297#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 17298#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 17299#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 17300#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 17301#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 17302#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 17303#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 17304#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 17305#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 17306#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 17307#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 17308#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 17309#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 17310#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 17311#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 17312#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 17313#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 17314#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 17315#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 17316#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 17317#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 17318#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 17319#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 17320#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 17321#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 17322#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 17323#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 17324#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 17325#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 17326#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 17327#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 17328#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 17329#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 17330#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 17331#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 17332#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 17333#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 17334#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 17335#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 17336#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 17337#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 17338#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 17339#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 17340#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 17341#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 17342#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 17343#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 17344#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 17345#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 17346#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 17347#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 17348#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 17349#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 17350#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 17351#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 17352#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 17353#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 17354#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 17355#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 17356#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 17357#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 17358#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 17359#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 17360#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 17361#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 17362#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 17363#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:38:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,750 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:38:54,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:38:54,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:38:54,751 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-23 13:38:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:57,780 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-23 13:38:57,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:38:57,780 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-23 13:38:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:57,781 INFO L225 Difference]: With dead ends: 74 [2018-07-23 13:38:57,781 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 13:38:57,782 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-07-23 13:38:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 13:38:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 13:38:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:38:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-23 13:38:57,787 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-23 13:38:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:57,788 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-23 13:38:57,788 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:38:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-23 13:38:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-23 13:38:57,788 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:57,788 INFO L357 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-23 13:38:57,789 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:38:57,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-07-23 13:38:57,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:58,310 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:58,310 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:38:58,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:58,310 INFO L185 omatonBuilderFactory]: Interpolants [17792#(<= ULTIMATE.start_main_~i~5 0), 17793#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 17794#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 17795#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 17796#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 17797#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 17798#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 17799#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 17800#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 17801#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 17802#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 17803#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 17804#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 17805#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 17806#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 17807#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 17808#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 17809#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 17810#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 17811#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 17812#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 17813#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 17814#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 17815#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 17816#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 17817#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 17818#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 17819#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 17820#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 17821#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 17822#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 17823#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 17824#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 17825#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 17826#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 17827#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 17828#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 17829#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 17830#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 17831#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 17832#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 17833#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 17834#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 17835#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 17836#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 17837#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 17838#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 17839#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 17840#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 17841#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 17842#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 17843#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 17844#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 17845#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 17846#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 17847#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 17848#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 17849#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 17850#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 17851#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 17852#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 17853#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 17854#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 17855#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 17856#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 17857#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 17858#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 17859#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 17860#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 17790#true, 17791#false] [2018-07-23 13:38:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:58,311 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:38:58,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:38:58,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:38:58,311 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-23 13:39:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:01,407 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 13:39:01,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:39:01,408 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-23 13:39:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:01,408 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:39:01,408 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 13:39:01,409 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-07-23 13:39:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 13:39:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 13:39:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 13:39:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 13:39:01,412 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-23 13:39:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:01,413 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 13:39:01,413 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:39:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 13:39:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 13:39:01,413 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:01,414 INFO L357 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-23 13:39:01,414 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-07-23 13:39:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:01,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:01,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:39:01,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:01,955 INFO L185 omatonBuilderFactory]: Interpolants [18304#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 18305#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 18306#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 18307#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 18308#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 18309#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 18310#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 18311#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 18312#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 18313#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 18314#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 18315#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 18316#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 18317#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 18318#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 18319#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 18320#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 18321#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 18322#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 18323#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 18324#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 18325#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 18326#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 18327#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 18328#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 18329#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 18330#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 18331#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 18332#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 18333#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 18334#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 18335#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 18336#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 18337#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 18338#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 18339#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 18340#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 18341#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 18342#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 18343#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 18344#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 18345#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 18346#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 18347#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 18348#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 18349#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 18350#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 18351#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 18352#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 18353#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 18354#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 18355#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 18356#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 18357#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 18358#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 18359#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 18360#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 18361#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 18362#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 18363#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 18364#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 18293#true, 18294#false, 18295#(<= ULTIMATE.start_main_~i~5 0), 18296#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 18297#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 18298#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 18299#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 18300#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 18301#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 18302#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 18303#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:01,955 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:39:01,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:39:01,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:39:01,956 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-23 13:39:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:05,285 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-23 13:39:05,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:39:05,286 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-23 13:39:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:05,286 INFO L225 Difference]: With dead ends: 76 [2018-07-23 13:39:05,286 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 13:39:05,287 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-07-23 13:39:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 13:39:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 13:39:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:39:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-23 13:39:05,292 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-23 13:39:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:05,292 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-23 13:39:05,292 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:39:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-23 13:39:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 13:39:05,293 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:05,293 INFO L357 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-23 13:39:05,293 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:05,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-07-23 13:39:05,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:05,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:05,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:39:05,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:05,832 INFO L185 omatonBuilderFactory]: Interpolants [18816#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 18817#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 18818#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 18819#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 18820#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 18821#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 18822#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 18823#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 18824#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 18825#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 18826#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 18827#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 18828#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 18829#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 18830#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 18831#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 18832#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 18833#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 18834#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 18835#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 18836#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 18837#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 18838#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 18839#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 18840#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 18841#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 18842#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 18843#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 18844#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 18845#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 18846#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 18847#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 18848#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 18849#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 18850#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 18851#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 18852#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 18853#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 18854#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 18855#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 18856#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 18857#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 18858#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 18859#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 18860#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 18861#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 18862#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 18863#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 18864#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 18865#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 18866#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 18867#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 18868#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 18869#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 18870#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 18871#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 18872#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 18873#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 18874#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 18875#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 18803#true, 18804#false, 18805#(<= ULTIMATE.start_main_~i~5 0), 18806#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 18807#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 18808#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 18809#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 18810#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 18811#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 18812#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 18813#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 18814#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 18815#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:05,832 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:39:05,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:39:05,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:39:05,833 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-23 13:39:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:09,206 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 13:39:09,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:39:09,206 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-23 13:39:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:09,207 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:39:09,207 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:39:09,208 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-07-23 13:39:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:39:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 13:39:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 13:39:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 13:39:09,213 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-23 13:39:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:09,213 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 13:39:09,214 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:39:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 13:39:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 13:39:09,214 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:09,214 INFO L357 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-23 13:39:09,214 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-07-23 13:39:09,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:09,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:09,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:39:09,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:09,968 INFO L185 omatonBuilderFactory]: Interpolants [19328#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 19329#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 19330#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 19331#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 19332#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 19333#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 19334#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 19335#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 19336#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 19337#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 19338#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 19339#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 19340#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 19341#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 19342#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 19343#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 19344#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 19345#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 19346#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 19347#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 19348#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 19349#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 19350#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 19351#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 19352#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 19353#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 19354#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 19355#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 19356#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 19357#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 19358#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 19359#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 19360#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 19361#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 19362#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 19363#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 19364#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 19365#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 19366#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 19367#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 19368#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 19369#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 19370#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 19371#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 19372#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 19373#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 19374#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 19375#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 19376#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 19377#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 19378#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 19379#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 19380#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 19381#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 19382#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 19383#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 19384#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 19385#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 19386#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 19387#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 19388#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 19389#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 19390#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 19391#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 19392#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 19393#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 19320#true, 19321#false, 19322#(<= ULTIMATE.start_main_~i~5 0), 19323#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 19324#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 19325#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 19326#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 19327#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:09,968 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:39:09,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:39:09,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:39:09,969 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-23 13:39:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:13,951 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-23 13:39:13,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:39:13,951 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-23 13:39:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:13,951 INFO L225 Difference]: With dead ends: 78 [2018-07-23 13:39:13,951 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:39:13,952 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-07-23 13:39:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:39:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 13:39:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:39:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-23 13:39:13,956 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-23 13:39:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:13,956 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-23 13:39:13,956 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:39:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-23 13:39:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-23 13:39:13,957 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:13,957 INFO L357 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-23 13:39:13,957 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-07-23 13:39:13,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,511 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:14,511 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:39:14,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,512 INFO L185 omatonBuilderFactory]: Interpolants [19844#true, 19845#false, 19846#(<= ULTIMATE.start_main_~i~5 0), 19847#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 19848#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 19849#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 19850#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 19851#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 19852#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 19853#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 19854#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 19855#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 19856#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 19857#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 19858#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 19859#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 19860#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 19861#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 19862#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 19863#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 19864#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 19865#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 19866#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 19867#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 19868#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 19869#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 19870#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 19871#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 19872#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 19873#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 19874#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 19875#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 19876#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 19877#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 19878#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 19879#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 19880#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 19881#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 19882#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 19883#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 19884#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 19885#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 19886#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 19887#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 19888#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 19889#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 19890#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 19891#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 19892#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 19893#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 19894#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 19895#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 19896#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 19897#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 19898#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 19899#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 19900#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 19901#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 19902#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 19903#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 19904#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 19905#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 19906#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 19907#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 19908#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 19909#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 19910#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 19911#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 19912#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 19913#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 19914#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 19915#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 19916#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 19917#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 19918#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,513 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:39:14,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:39:14,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:39:14,513 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-23 13:39:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:18,107 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 13:39:18,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:39:18,107 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-23 13:39:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:18,108 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:39:18,108 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:39:18,109 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-07-23 13:39:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:39:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 13:39:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 13:39:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 13:39:18,115 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-23 13:39:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:18,115 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 13:39:18,115 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:39:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 13:39:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:39:18,116 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:18,116 INFO L357 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-23 13:39:18,116 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-07-23 13:39:18,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:18,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:18,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:39:18,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:18,922 INFO L185 omatonBuilderFactory]: Interpolants [20375#true, 20376#false, 20377#(<= ULTIMATE.start_main_~i~5 0), 20378#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 20379#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 20380#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 20381#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 20382#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 20383#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 20384#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 20385#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 20386#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 20387#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 20388#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 20389#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 20390#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 20391#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 20392#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 20393#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 20394#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 20395#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 20396#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 20397#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 20398#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 20399#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 20400#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 20401#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 20402#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 20403#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 20404#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 20405#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 20406#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 20407#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 20408#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 20409#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 20410#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 20411#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 20412#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 20413#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 20414#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 20415#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 20416#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 20417#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 20418#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 20419#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 20420#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 20421#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 20422#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 20423#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 20424#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 20425#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 20426#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 20427#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 20428#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 20429#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 20430#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 20431#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 20432#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 20433#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 20434#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 20435#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 20436#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 20437#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 20438#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 20439#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 20440#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 20441#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 20442#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 20443#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 20444#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 20445#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 20446#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 20447#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 20448#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 20449#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 20450#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:18,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:39:18,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:39:18,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:39:18,924 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-23 13:39:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:23,136 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-23 13:39:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:39:23,136 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-23 13:39:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:23,137 INFO L225 Difference]: With dead ends: 80 [2018-07-23 13:39:23,137 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 13:39:23,138 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-07-23 13:39:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 13:39:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-23 13:39:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 13:39:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-23 13:39:23,144 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-23 13:39:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:23,145 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-23 13:39:23,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:39:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-23 13:39:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-23 13:39:23,145 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:23,145 INFO L357 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-23 13:39:23,146 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-07-23 13:39:23,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:23,983 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:23,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:39:23,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:23,984 INFO L185 omatonBuilderFactory]: Interpolants [20913#true, 20914#false, 20915#(<= ULTIMATE.start_main_~i~5 0), 20916#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 20917#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 20918#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 20919#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 20920#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 20921#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 20922#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 20923#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 20924#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 20925#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 20926#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 20927#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 20928#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 20929#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 20930#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 20931#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 20932#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 20933#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 20934#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 20935#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 20936#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 20937#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 20938#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 20939#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 20940#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 20941#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 20942#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 20943#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 20944#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 20945#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 20946#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 20947#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 20948#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 20949#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 20950#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 20951#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 20952#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 20953#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 20954#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 20955#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 20956#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 20957#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 20958#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 20959#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 20960#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 20961#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 20962#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 20963#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 20964#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 20965#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 20966#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 20967#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 20968#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 20969#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 20970#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 20971#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 20972#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 20973#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 20974#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 20975#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 20976#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 20977#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 20978#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 20979#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 20980#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 20981#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 20982#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 20983#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 20984#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 20985#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 20986#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 20987#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 20988#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 20989#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:23,985 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:39:23,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:39:23,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:39:23,985 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-23 13:39:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:28,150 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 13:39:28,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:39:28,150 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-23 13:39:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:28,151 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:39:28,151 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:39:28,152 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2018-07-23 13:39:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:39:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 13:39:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 13:39:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 13:39:28,158 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-23 13:39:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:28,158 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 13:39:28,158 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:39:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 13:39:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:39:28,159 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:28,159 INFO L357 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-23 13:39:28,159 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-07-23 13:39:28,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:28,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:28,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:39:28,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:28,780 INFO L185 omatonBuilderFactory]: Interpolants [21504#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 21505#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 21506#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 21507#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 21508#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 21509#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 21510#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 21511#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 21512#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 21513#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 21514#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 21515#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 21516#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 21517#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 21518#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 21519#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 21520#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 21521#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 21522#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 21523#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 21524#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 21525#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 21526#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 21527#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 21528#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 21529#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 21530#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 21531#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 21532#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 21533#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 21534#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 21535#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 21458#true, 21459#false, 21460#(<= ULTIMATE.start_main_~i~5 0), 21461#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 21462#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 21463#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 21464#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 21465#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 21466#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 21467#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 21468#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 21469#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 21470#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 21471#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 21472#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 21473#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 21474#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 21475#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 21476#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 21477#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 21478#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 21479#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 21480#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 21481#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 21482#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 21483#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 21484#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 21485#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 21486#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 21487#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 21488#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 21489#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 21490#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 21491#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 21492#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 21493#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 21494#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 21495#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 21496#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 21497#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 21498#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 21499#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 21500#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 21501#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 21502#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 21503#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:28,780 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:39:28,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:39:28,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:39:28,781 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-23 13:39:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:33,003 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-23 13:39:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:39:33,003 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-23 13:39:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:33,004 INFO L225 Difference]: With dead ends: 82 [2018-07-23 13:39:33,004 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 13:39:33,005 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2018-07-23 13:39:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 13:39:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 13:39:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 13:39:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-23 13:39:33,010 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-23 13:39:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:33,010 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-23 13:39:33,010 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:39:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-23 13:39:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 13:39:33,011 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:33,011 INFO L357 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-23 13:39:33,011 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:33,011 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-07-23 13:39:33,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:33,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:33,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:39:33,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:33,728 INFO L185 omatonBuilderFactory]: Interpolants [22016#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 22017#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 22018#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 22019#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 22020#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 22021#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 22022#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 22023#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 22024#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 22025#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 22026#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 22027#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 22028#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 22029#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 22030#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 22031#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 22032#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 22033#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 22034#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 22035#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 22036#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 22037#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 22038#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 22039#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 22040#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 22041#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 22042#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 22043#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 22044#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 22045#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 22046#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 22047#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 22048#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 22049#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 22050#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 22051#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 22052#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 22053#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 22054#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 22055#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 22056#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 22057#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 22058#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 22059#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 22060#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 22061#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 22062#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 22063#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 22064#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 22065#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 22066#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 22067#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 22068#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 22069#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 22070#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 22071#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 22072#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 22073#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 22074#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 22075#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 22076#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 22077#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 22078#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 22079#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 22080#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 22081#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 22082#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 22083#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 22084#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 22085#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 22086#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 22087#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 22088#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 22010#true, 22011#false, 22012#(<= ULTIMATE.start_main_~i~5 0), 22013#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 22014#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 22015#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:33,728 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:39:33,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:39:33,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:39:33,729 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-23 13:39:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:38,199 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 13:39:38,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:39:38,200 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-23 13:39:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:38,200 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:39:38,201 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 13:39:38,202 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6083, Invalid=17787, Unknown=0, NotChecked=0, Total=23870 [2018-07-23 13:39:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 13:39:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 13:39:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 13:39:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 13:39:38,207 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-23 13:39:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:38,207 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 13:39:38,207 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:39:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 13:39:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 13:39:38,208 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:38,208 INFO L357 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-23 13:39:38,208 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-07-23 13:39:38,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:38,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:38,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:39:38,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:38,915 INFO L185 omatonBuilderFactory]: Interpolants [22569#true, 22570#false, 22571#(<= ULTIMATE.start_main_~i~5 0), 22572#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 22573#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 22574#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 22575#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 22576#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 22577#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 22578#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 22579#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 22580#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 22581#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 22582#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 22583#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 22584#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 22585#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 22586#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 22587#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 22588#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 22589#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 22590#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 22591#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 22592#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 22593#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 22594#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 22595#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 22596#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 22597#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 22598#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 22599#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 22600#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 22601#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 22602#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 22603#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 22604#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 22605#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 22606#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 22607#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 22608#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 22609#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 22610#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 22611#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 22612#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 22613#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 22614#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 22615#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 22616#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 22617#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 22618#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 22619#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 22620#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 22621#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 22622#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 22623#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 22624#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 22625#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 22626#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 22627#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 22628#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 22629#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 22630#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 22631#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 22632#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 22633#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 22634#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 22635#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 22636#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 22637#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 22638#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 22639#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 22640#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 22641#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 22642#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 22643#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 22644#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 22645#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 22646#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 22647#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 22648#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:38,915 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:39:38,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:39:38,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:39:38,916 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-23 13:39:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:43,828 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-23 13:39:43,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:39:43,828 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-23 13:39:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:43,829 INFO L225 Difference]: With dead ends: 84 [2018-07-23 13:39:43,829 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 13:39:43,830 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2018-07-23 13:39:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 13:39:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-23 13:39:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 13:39:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-23 13:39:43,834 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-23 13:39:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:43,834 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-23 13:39:43,835 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:39:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-23 13:39:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-23 13:39:43,835 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:43,835 INFO L357 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-23 13:39:43,835 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-07-23 13:39:43,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:44,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:44,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:39:44,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:44,799 INFO L185 omatonBuilderFactory]: Interpolants [23168#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 23169#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 23170#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 23171#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 23172#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 23173#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 23174#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 23175#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 23176#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 23177#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 23178#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 23179#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 23180#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 23181#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 23182#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 23183#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 23184#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 23185#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 23186#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 23187#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 23188#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 23189#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 23190#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 23191#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 23192#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 23193#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 23194#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 23195#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 23196#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 23197#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 23198#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 23199#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 23200#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 23201#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 23202#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 23203#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 23204#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 23205#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 23206#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 23207#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 23208#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 23209#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 23210#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 23211#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 23212#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 23213#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 23214#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 23215#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 23135#true, 23136#false, 23137#(<= ULTIMATE.start_main_~i~5 0), 23138#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 23139#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 23140#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 23141#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 23142#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 23143#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 23144#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 23145#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 23146#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 23147#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 23148#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 23149#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 23150#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 23151#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 23152#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 23153#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 23154#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 23155#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 23156#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 23157#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 23158#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 23159#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 23160#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 23161#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 23162#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 23163#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 23164#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 23165#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 23166#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 23167#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:44,800 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:39:44,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:39:44,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:39:44,800 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-23 13:39:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:49,513 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 13:39:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:39:49,513 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-23 13:39:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:49,514 INFO L225 Difference]: With dead ends: 85 [2018-07-23 13:39:49,514 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:39:49,515 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2018-07-23 13:39:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:39:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 13:39:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:39:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 13:39:49,521 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-23 13:39:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:49,521 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 13:39:49,521 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:39:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 13:39:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 13:39:49,522 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:49,522 INFO L357 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-23 13:39:49,522 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-07-23 13:39:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:50,253 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:50,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:39:50,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:50,254 INFO L185 omatonBuilderFactory]: Interpolants [23708#true, 23709#false, 23710#(<= ULTIMATE.start_main_~i~5 0), 23711#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 23712#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 23713#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 23714#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 23715#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 23716#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 23717#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 23718#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 23719#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 23720#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 23721#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 23722#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 23723#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 23724#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 23725#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 23726#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 23727#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 23728#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 23729#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 23730#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 23731#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 23732#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 23733#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 23734#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 23735#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 23736#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 23737#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 23738#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 23739#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 23740#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 23741#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 23742#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 23743#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 23744#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 23745#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 23746#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 23747#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 23748#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 23749#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 23750#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 23751#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 23752#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 23753#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 23754#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 23755#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 23756#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 23757#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 23758#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 23759#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 23760#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 23761#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 23762#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 23763#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 23764#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 23765#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 23766#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 23767#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 23768#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 23769#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 23770#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 23771#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 23772#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 23773#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 23774#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 23775#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 23776#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 23777#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 23778#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 23779#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 23780#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 23781#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 23782#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 23783#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 23784#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 23785#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 23786#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 23787#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 23788#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 23789#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:50,254 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:39:50,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:39:50,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:39:50,255 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-23 13:39:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:55,110 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-23 13:39:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:39:55,110 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-23 13:39:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:55,111 INFO L225 Difference]: With dead ends: 86 [2018-07-23 13:39:55,111 INFO L226 Difference]: Without dead ends: 84 [2018-07-23 13:39:55,111 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2018-07-23 13:39:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-23 13:39:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-23 13:39:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:39:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-23 13:39:55,117 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-23 13:39:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:55,117 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-23 13:39:55,117 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:39:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-23 13:39:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 13:39:55,118 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:55,118 INFO L357 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-23 13:39:55,118 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:39:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-07-23 13:39:55,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:55,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:55,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:39:55,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:55,851 INFO L185 omatonBuilderFactory]: Interpolants [24320#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 24321#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 24322#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 24323#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 24324#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 24325#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 24326#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 24327#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 24328#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 24329#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 24330#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 24331#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 24332#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 24333#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 24334#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 24335#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 24336#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 24337#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 24338#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 24339#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 24340#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 24341#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 24342#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 24343#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 24344#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 24345#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 24346#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 24347#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 24348#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 24349#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 24350#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 24351#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 24352#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 24353#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 24354#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 24355#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 24356#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 24357#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 24358#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 24359#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 24360#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 24361#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 24362#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 24363#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 24364#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 24365#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 24366#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 24367#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 24368#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 24369#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 24370#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 24288#true, 24289#false, 24290#(<= ULTIMATE.start_main_~i~5 0), 24291#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 24292#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 24293#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 24294#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 24295#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 24296#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 24297#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 24298#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 24299#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 24300#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 24301#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 24302#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 24303#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 24304#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 24305#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 24306#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 24307#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 24308#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 24309#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 24310#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 24311#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 24312#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 24313#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 24314#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 24315#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 24316#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 24317#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 24318#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 24319#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5))] [2018-07-23 13:39:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:55,851 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:39:55,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:39:55,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:39:55,852 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-23 13:40:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:00,787 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 13:40:00,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:40:00,787 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-23 13:40:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:00,788 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:40:00,788 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 13:40:00,789 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6723, Invalid=19683, Unknown=0, NotChecked=0, Total=26406 [2018-07-23 13:40:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 13:40:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 13:40:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:40:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 13:40:00,795 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-23 13:40:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:00,796 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 13:40:00,796 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:40:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 13:40:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 13:40:00,796 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:00,796 INFO L357 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-23 13:40:00,797 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-07-23 13:40:00,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:01,569 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:01,569 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:40:01,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:01,570 INFO L185 omatonBuilderFactory]: Interpolants [24875#true, 24876#false, 24877#(<= ULTIMATE.start_main_~i~5 0), 24878#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 24879#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 24880#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 24881#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 24882#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 24883#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 24884#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 24885#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 24886#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 24887#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 24888#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 24889#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 24890#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 24891#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 24892#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 24893#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 24894#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 24895#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 24896#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 24897#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 24898#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 24899#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 24900#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 24901#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 24902#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 24903#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 24904#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 24905#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 24906#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 24907#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 24908#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 24909#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 24910#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 24911#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 24912#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 24913#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 24914#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 24915#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 24916#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 24917#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 24918#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 24919#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 24920#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 24921#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 24922#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 24923#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 24924#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 24925#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 24926#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 24927#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 24928#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 24929#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 24930#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 24931#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 24932#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 24933#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 24934#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 24935#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 24936#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 24937#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 24938#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 24939#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 24940#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 24941#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 24942#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 24943#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 24944#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 24945#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 24946#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 24947#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 24948#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 24949#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 24950#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 24951#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 24952#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 24953#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 24954#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 24955#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 24956#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 24957#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 24958#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:40:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:01,570 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:40:01,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:40:01,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:40:01,571 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-23 13:40:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:06,712 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-23 13:40:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:40:06,713 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-23 13:40:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:06,713 INFO L225 Difference]: With dead ends: 88 [2018-07-23 13:40:06,713 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 13:40:06,714 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2018-07-23 13:40:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 13:40:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 13:40:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:40:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-23 13:40:06,721 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-23 13:40:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:06,721 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-23 13:40:06,721 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:40:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-23 13:40:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-23 13:40:06,722 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:06,722 INFO L357 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-23 13:40:06,722 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-07-23 13:40:06,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:07,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:07,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:40:07,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:07,501 INFO L185 omatonBuilderFactory]: Interpolants [25472#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 25473#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 25474#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 25475#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 25476#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 25477#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 25478#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 25479#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 25480#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 25481#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 25482#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 25483#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 25484#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 25485#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 25486#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 25487#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 25488#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 25489#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 25490#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 25491#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 25492#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 25493#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 25494#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 25495#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 25496#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 25497#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 25498#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 25499#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 25500#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 25501#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 25502#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 25503#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 25504#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 25505#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 25506#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 25507#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 25508#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 25509#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 25510#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 25511#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 25512#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 25513#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 25514#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 25515#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 25516#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 25517#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 25518#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 25519#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 25520#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 25521#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 25522#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 25523#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 25524#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 25525#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 25526#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 25527#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 25528#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 25529#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 25530#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 25531#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 25532#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 25533#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 25534#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 25535#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 25536#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 25537#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 25538#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 25539#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 25540#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 25541#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 25542#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 25543#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 25544#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 25545#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 25546#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 25547#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 25548#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 25549#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 25550#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 25551#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 25552#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 25553#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 25469#true, 25470#false, 25471#(<= ULTIMATE.start_main_~i~5 0)] [2018-07-23 13:40:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:07,502 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:40:07,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:40:07,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:40:07,503 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-23 13:40:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:12,808 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 13:40:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:40:12,808 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-23 13:40:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:12,809 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:40:12,809 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:40:12,810 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2018-07-23 13:40:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:40:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 13:40:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:40:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 13:40:12,816 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-23 13:40:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:12,817 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 13:40:12,817 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:40:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 13:40:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:40:12,817 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:12,818 INFO L357 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-23 13:40:12,818 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-07-23 13:40:12,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:13,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:13,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:40:13,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:13,646 INFO L185 omatonBuilderFactory]: Interpolants [26112#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 26113#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 26114#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 26115#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 26116#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 26117#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 26118#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 26119#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 26120#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 26121#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 26122#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 26123#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 26124#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 26125#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 26126#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 26127#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 26128#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 26129#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 26130#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 26131#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 26132#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 26133#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 26134#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 26135#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 26136#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 26137#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 26138#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 26139#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 26140#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 26141#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 26142#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 26143#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 26144#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 26145#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 26146#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 26147#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 26148#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 26149#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 26150#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 26151#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 26152#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 26153#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 26154#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 26155#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 26070#true, 26071#false, 26072#(<= ULTIMATE.start_main_~i~5 0), 26073#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 26074#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 26075#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 26076#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 26077#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 26078#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 26079#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 26080#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 26081#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 26082#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 26083#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 26084#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 26085#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 26086#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 26087#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 26088#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 26089#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 26090#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 26091#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 26092#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 26093#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 26094#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 26095#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 26096#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 26097#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 26098#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 26099#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 26100#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 26101#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 26102#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 26103#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 26104#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 26105#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 26106#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 26107#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 26108#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 26109#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 26110#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 26111#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5))] [2018-07-23 13:40:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:13,646 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:40:13,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:40:13,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:40:13,647 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-23 13:40:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:19,427 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-23 13:40:19,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:40:19,428 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-23 13:40:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:19,428 INFO L225 Difference]: With dead ends: 90 [2018-07-23 13:40:19,429 INFO L226 Difference]: Without dead ends: 88 [2018-07-23 13:40:19,430 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2018-07-23 13:40:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-23 13:40:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-23 13:40:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 13:40:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-23 13:40:19,436 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-23 13:40:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:19,437 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-23 13:40:19,437 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:40:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-23 13:40:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-23 13:40:19,437 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:19,438 INFO L357 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-23 13:40:19,438 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-07-23 13:40:19,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:20,346 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:20,346 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:40:20,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:20,346 INFO L185 omatonBuilderFactory]: Interpolants [26752#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 26753#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 26754#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 26755#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 26756#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 26757#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 26758#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 26759#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 26760#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 26761#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 26762#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 26763#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 26764#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 26678#true, 26679#false, 26680#(<= ULTIMATE.start_main_~i~5 0), 26681#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 26682#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 26683#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 26684#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 26685#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 26686#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 26687#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 26688#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 26689#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 26690#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 26691#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 26692#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 26693#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 26694#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 26695#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 26696#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 26697#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 26698#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 26699#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 26700#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 26701#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 26702#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 26703#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 26704#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 26705#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 26706#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 26707#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 26708#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 26709#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 26710#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 26711#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 26712#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 26713#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 26714#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 26715#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 26716#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 26717#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 26718#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 26719#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 26720#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 26721#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 26722#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 26723#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 26724#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 26725#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 26726#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 26727#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 26728#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 26729#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 26730#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 26731#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 26732#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 26733#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 26734#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 26735#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 26736#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 26737#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 26738#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 26739#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 26740#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 26741#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 26742#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 26743#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 26744#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 26745#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 26746#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 26747#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 26748#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 26749#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 26750#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 26751#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5))] [2018-07-23 13:40:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:20,347 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:40:20,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:40:20,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:40:20,347 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-23 13:40:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:26,019 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 13:40:26,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:40:26,019 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-23 13:40:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:26,020 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:40:26,020 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 13:40:26,021 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2018-07-23 13:40:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 13:40:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 13:40:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 13:40:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 13:40:26,026 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-23 13:40:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:26,026 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 13:40:26,026 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:40:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 13:40:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:40:26,027 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:26,027 INFO L357 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-23 13:40:26,027 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-07-23 13:40:26,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:26,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:26,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:40:26,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:26,853 INFO L185 omatonBuilderFactory]: Interpolants [27293#true, 27294#false, 27295#(<= ULTIMATE.start_main_~i~5 0), 27296#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 27297#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 27298#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 27299#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 27300#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 27301#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 27302#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 27303#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 27304#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 27305#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 27306#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 27307#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 27308#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 27309#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 27310#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 27311#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 27312#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 27313#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 27314#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 27315#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 27316#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 27317#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 27318#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 27319#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 27320#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 27321#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 27322#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 27323#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 27324#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 27325#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 27326#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 27327#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 27328#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 27329#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 27330#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 27331#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 27332#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 27333#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 27334#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 27335#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 27336#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 27337#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 27338#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 27339#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 27340#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 27341#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 27342#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 27343#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 27344#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 27345#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 27346#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 27347#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 27348#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 27349#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 27350#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 27351#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 27352#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 27353#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 27354#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 27355#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 27356#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 27357#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 27358#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 27359#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 27360#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 27361#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 27362#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 27363#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 27364#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 27365#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 27366#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 27367#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 27368#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 27369#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 27370#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 27371#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 27372#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 27373#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 27374#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 27375#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 27376#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 27377#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 27378#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 27379#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 27380#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:40:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:26,854 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:40:26,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:40:26,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:40:26,855 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-23 13:40:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:32,715 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-23 13:40:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:40:32,715 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-23 13:40:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:32,716 INFO L225 Difference]: With dead ends: 92 [2018-07-23 13:40:32,716 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 13:40:32,717 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2018-07-23 13:40:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 13:40:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-23 13:40:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 13:40:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-23 13:40:32,721 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-23 13:40:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:32,721 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-23 13:40:32,721 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:40:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-23 13:40:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-23 13:40:32,722 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:32,722 INFO L357 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-23 13:40:32,722 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-07-23 13:40:32,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:33,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:33,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:40:33,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:33,557 INFO L185 omatonBuilderFactory]: Interpolants [27915#true, 27916#false, 27917#(<= ULTIMATE.start_main_~i~5 0), 27918#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 27919#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 27920#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 27921#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 27922#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 27923#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 27924#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 27925#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 27926#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 27927#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 27928#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 27929#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 27930#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 27931#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 27932#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 27933#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 27934#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 27935#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 27936#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 27937#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 27938#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 27939#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 27940#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 27941#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 27942#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 27943#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 27944#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 27945#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 27946#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 27947#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 27948#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 27949#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 27950#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 27951#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 27952#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 27953#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 27954#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 27955#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 27956#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 27957#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 27958#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 27959#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 27960#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 27961#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 27962#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 27963#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 27964#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 27965#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 27966#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 27967#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 27968#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 27969#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 27970#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 27971#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 27972#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 27973#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 27974#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 27975#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 27976#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 27977#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 27978#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 27979#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 27980#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 27981#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 27982#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 27983#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 27984#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 27985#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 27986#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 27987#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 27988#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 27989#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 27990#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 27991#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 27992#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 27993#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 27994#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 27995#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 27996#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 27997#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 27998#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 27999#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 28000#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 28001#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 28002#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 28003#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:40:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:33,558 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:40:33,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:40:33,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:40:33,559 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-23 13:40:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:39,542 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 13:40:39,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:40:39,543 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-23 13:40:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:39,543 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:40:39,544 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 13:40:39,545 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7743, Invalid=22707, Unknown=0, NotChecked=0, Total=30450 [2018-07-23 13:40:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 13:40:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 13:40:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 13:40:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 13:40:39,552 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-23 13:40:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:39,552 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 13:40:39,552 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:40:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 13:40:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 13:40:39,553 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:39,553 INFO L357 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-23 13:40:39,553 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-07-23 13:40:39,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:40,709 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:40,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:40:40,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:40,710 INFO L185 omatonBuilderFactory]: Interpolants [28544#true, 28545#false, 28546#(<= ULTIMATE.start_main_~i~5 0), 28547#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 28548#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 28549#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 28550#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 28551#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 28552#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 28553#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 28554#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 28555#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 28556#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 28557#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 28558#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 28559#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 28560#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 28561#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 28562#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 28563#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 28564#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 28565#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 28566#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 28567#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 28568#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 28569#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 28570#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 28571#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 28572#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 28573#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 28574#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 28575#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 28576#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 28577#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 28578#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 28579#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 28580#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 28581#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 28582#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 28583#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 28584#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 28585#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 28586#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 28587#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 28588#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 28589#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 28590#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 28591#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 28592#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 28593#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 28594#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 28595#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 28596#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 28597#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 28598#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 28599#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 28600#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 28601#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 28602#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 28603#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 28604#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 28605#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 28606#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 28607#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 28608#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 28609#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 28610#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 28611#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 28612#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 28613#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 28614#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 28615#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 28616#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 28617#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 28618#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 28619#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 28620#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 28621#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 28622#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 28623#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 28624#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 28625#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 28626#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 28627#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 28628#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 28629#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 28630#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 28631#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 28632#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 28633#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:40:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:40,710 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:40:40,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:40:40,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:40:40,711 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-23 13:40:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:47,095 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-23 13:40:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:40:47,095 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-23 13:40:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:47,096 INFO L225 Difference]: With dead ends: 94 [2018-07-23 13:40:47,096 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:40:47,097 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2018-07-23 13:40:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:40:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 13:40:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:40:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-23 13:40:47,101 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-23 13:40:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:47,102 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-23 13:40:47,102 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:40:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-23 13:40:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 13:40:47,102 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:47,102 INFO L357 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-23 13:40:47,102 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-07-23 13:40:47,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:48,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:48,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:40:48,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:48,102 INFO L185 omatonBuilderFactory]: Interpolants [29184#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 29185#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 29186#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 29187#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 29188#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 29189#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 29190#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 29191#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 29192#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 29193#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 29194#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 29195#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 29196#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 29197#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 29198#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 29199#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 29200#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 29201#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 29202#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 29203#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 29204#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 29205#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 29206#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 29207#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 29208#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 29209#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 29210#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 29211#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 29212#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 29213#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 29214#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 29215#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 29216#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 29217#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 29218#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 29219#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 29220#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 29221#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 29222#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 29223#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 29224#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 29225#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 29226#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 29227#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 29228#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 29229#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 29230#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 29231#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 29232#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 29233#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 29234#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 29235#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 29236#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 29237#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 29238#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 29239#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 29240#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 29241#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 29242#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 29243#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 29244#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 29245#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 29246#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 29247#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 29248#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 29249#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 29250#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 29251#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 29252#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 29253#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 29254#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 29255#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 29256#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 29257#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 29258#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 29259#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 29260#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 29261#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 29262#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 29263#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 29264#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 29265#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 29266#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 29267#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 29268#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 29269#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 29270#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 29180#true, 29181#false, 29182#(<= ULTIMATE.start_main_~i~5 0), 29183#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5)] [2018-07-23 13:40:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:48,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:40:48,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:40:48,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:40:48,103 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-23 13:40:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:55,106 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 13:40:55,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:40:55,107 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-23 13:40:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:55,107 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:40:55,107 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 13:40:55,109 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2018-07-23 13:40:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 13:40:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 13:40:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 13:40:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 13:40:55,115 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-23 13:40:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:55,115 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 13:40:55,115 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:40:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 13:40:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 13:40:55,116 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:55,116 INFO L357 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-23 13:40:55,116 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:40:55,116 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-07-23 13:40:55,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:56,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:56,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:40:56,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:56,146 INFO L185 omatonBuilderFactory]: Interpolants [29824#false, 29825#(<= ULTIMATE.start_main_~i~5 0), 29826#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 29827#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 29828#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 29829#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 29830#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 29831#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 29832#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 29833#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 29834#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 29835#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 29836#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 29837#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 29838#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 29839#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 29840#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 29841#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 29842#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 29843#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 29844#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 29845#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 29846#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 29847#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 29848#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 29849#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 29850#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 29851#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 29852#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 29853#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 29854#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 29855#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 29856#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 29857#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 29858#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 29859#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 29860#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 29861#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 29862#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 29863#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 29864#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 29865#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 29866#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 29867#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 29868#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 29869#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 29870#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 29871#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 29872#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 29873#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 29874#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 29875#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 29876#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 29877#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 29878#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 29879#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 29880#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 29881#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 29882#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 29883#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 29884#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 29885#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 29886#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 29887#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 29888#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 29889#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 29890#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 29891#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 29892#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 29893#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 29894#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 29895#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 29896#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 29897#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 29898#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 29899#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 29900#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 29901#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 29902#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 29903#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 29904#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 29905#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 29906#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 29907#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 29908#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 29909#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 29910#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 29911#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 29912#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 29913#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 29914#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 29823#true] [2018-07-23 13:40:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:56,147 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:40:56,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:40:56,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:40:56,148 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-23 13:41:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,199 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-23 13:41:03,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:41:03,199 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-23 13:41:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,199 INFO L225 Difference]: With dead ends: 96 [2018-07-23 13:41:03,199 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 13:41:03,200 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8280, Invalid=24300, Unknown=0, NotChecked=0, Total=32580 [2018-07-23 13:41:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 13:41:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 13:41:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 13:41:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-23 13:41:03,205 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-23 13:41:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,205 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-23 13:41:03,205 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:41:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-23 13:41:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 13:41:03,205 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,205 INFO L357 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-23 13:41:03,206 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-07-23 13:41:03,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:04,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:41:04,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,327 INFO L185 omatonBuilderFactory]: Interpolants [30473#true, 30474#false, 30475#(<= ULTIMATE.start_main_~i~5 0), 30476#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 30477#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 30478#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 30479#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 30480#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 30481#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 30482#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 30483#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 30484#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 30485#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 30486#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 30487#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 30488#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 30489#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 30490#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 30491#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 30492#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 30493#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 30494#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 30495#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 30496#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 30497#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 30498#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 30499#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 30500#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 30501#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 30502#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 30503#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 30504#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 30505#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 30506#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 30507#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 30508#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 30509#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 30510#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 30511#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 30512#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 30513#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 30514#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 30515#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 30516#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 30517#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 30518#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 30519#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 30520#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 30521#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 30522#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 30523#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 30524#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 30525#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 30526#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 30527#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 30528#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 30529#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 30530#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 30531#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 30532#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 30533#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 30534#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 30535#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 30536#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 30537#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 30538#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 30539#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 30540#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 30541#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 30542#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 30543#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 30544#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 30545#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 30546#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 30547#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 30548#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 30549#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 30550#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 30551#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 30552#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 30553#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 30554#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 30555#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 30556#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 30557#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 30558#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 30559#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 30560#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 30561#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 30562#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 30563#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 30564#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 30565#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:41:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,327 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:41:04,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:41:04,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:41:04,328 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-23 13:41:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:11,742 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 13:41:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:41:11,742 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-23 13:41:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:11,743 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:41:11,743 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 13:41:11,744 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=8463, Invalid=24843, Unknown=0, NotChecked=0, Total=33306 [2018-07-23 13:41:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 13:41:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 13:41:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:41:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 13:41:11,749 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-23 13:41:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:11,749 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 13:41:11,750 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:41:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 13:41:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 13:41:11,750 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:11,750 INFO L357 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-23 13:41:11,751 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:11,751 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-07-23 13:41:11,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:13,120 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:13,120 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:41:13,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:13,120 INFO L185 omatonBuilderFactory]: Interpolants [31130#true, 31131#false, 31132#(<= ULTIMATE.start_main_~i~5 0), 31133#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 31134#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 31135#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 31136#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 31137#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 31138#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 31139#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 31140#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 31141#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 31142#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 31143#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 31144#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 31145#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 31146#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 31147#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 31148#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 31149#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 31150#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 31151#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 31152#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 31153#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 31154#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 31155#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 31156#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 31157#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 31158#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 31159#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 31160#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 31161#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 31162#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 31163#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 31164#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 31165#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 31166#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 31167#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 31168#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 31169#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 31170#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 31171#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 31172#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 31173#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 31174#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 31175#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 31176#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 31177#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 31178#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 31179#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 31180#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 31181#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 31182#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 31183#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 31184#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 31185#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 31186#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 31187#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 31188#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 31189#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 31190#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 31191#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 31192#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 31193#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 31194#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 31195#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 31196#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 31197#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 31198#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 31199#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 31200#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 31201#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 31202#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 31203#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 31204#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 31205#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 31206#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 31207#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 31208#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 31209#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 31210#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 31211#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 31212#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 31213#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 31214#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 31215#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 31216#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 31217#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 31218#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 31219#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 31220#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 31221#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 31222#(<= ULTIMATE.start_main_~i~5 (* 90 ULTIMATE.start_main_~k~5)), 31223#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:41:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:13,121 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:41:13,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:41:13,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:41:13,122 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-23 13:41:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:20,782 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-23 13:41:20,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:41:20,782 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-23 13:41:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:20,783 INFO L225 Difference]: With dead ends: 98 [2018-07-23 13:41:20,783 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 13:41:20,784 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=8648, Invalid=25392, Unknown=0, NotChecked=0, Total=34040 [2018-07-23 13:41:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 13:41:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-23 13:41:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:41:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-23 13:41:20,790 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-23 13:41:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:20,791 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-23 13:41:20,791 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:41:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-23 13:41:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-23 13:41:20,791 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:20,792 INFO L357 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-23 13:41:20,792 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-07-23 13:41:20,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:21,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:21,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:41:21,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:21,905 INFO L185 omatonBuilderFactory]: Interpolants [31872#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 31873#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 31874#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 31875#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 31876#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 31877#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 31878#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 31879#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 31880#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 31881#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 31882#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 31883#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 31884#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 31885#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 31886#(<= ULTIMATE.start_main_~i~5 (* 90 ULTIMATE.start_main_~k~5)), 31887#(<= ULTIMATE.start_main_~i~5 (* 91 ULTIMATE.start_main_~k~5)), 31888#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 31794#true, 31795#false, 31796#(<= ULTIMATE.start_main_~i~5 0), 31797#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 31798#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 31799#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 31800#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 31801#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 31802#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 31803#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 31804#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 31805#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 31806#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 31807#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 31808#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 31809#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 31810#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 31811#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 31812#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 31813#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 31814#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 31815#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 31816#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 31817#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 31818#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 31819#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 31820#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 31821#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 31822#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 31823#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 31824#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 31825#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 31826#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 31827#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 31828#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 31829#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 31830#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 31831#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 31832#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 31833#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 31834#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 31835#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 31836#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 31837#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 31838#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 31839#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 31840#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 31841#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 31842#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 31843#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 31844#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 31845#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 31846#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 31847#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 31848#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 31849#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 31850#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 31851#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 31852#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 31853#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 31854#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 31855#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 31856#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 31857#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 31858#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 31859#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 31860#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 31861#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 31862#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 31863#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 31864#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 31865#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 31866#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 31867#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 31868#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 31869#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 31870#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 31871#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5))] [2018-07-23 13:41:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:21,905 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:41:21,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:41:21,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:41:21,906 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-23 13:41:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:29,502 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 13:41:29,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:41:29,502 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-23 13:41:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:29,502 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:41:29,503 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 13:41:29,503 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=8835, Invalid=25947, Unknown=0, NotChecked=0, Total=34782 [2018-07-23 13:41:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 13:41:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 13:41:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 13:41:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 13:41:29,508 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-23 13:41:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:29,508 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 13:41:29,508 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:41:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 13:41:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:41:29,509 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:29,509 INFO L357 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-23 13:41:29,509 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-07-23 13:41:29,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:30,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:30,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:41:30,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:30,747 INFO L185 omatonBuilderFactory]: Interpolants [32512#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 32513#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 32514#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 32515#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 32516#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 32517#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 32518#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 32519#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 32520#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 32521#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 32522#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 32523#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 32524#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 32525#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 32526#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 32527#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 32528#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 32529#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 32530#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 32531#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 32532#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 32533#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 32534#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 32535#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 32536#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 32537#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 32538#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 32539#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 32540#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 32541#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 32542#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 32543#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 32544#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 32545#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 32546#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 32547#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 32548#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 32549#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 32550#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 32551#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 32552#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 32553#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 32554#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 32555#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 32556#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 32557#(<= ULTIMATE.start_main_~i~5 (* 90 ULTIMATE.start_main_~k~5)), 32558#(<= ULTIMATE.start_main_~i~5 (* 91 ULTIMATE.start_main_~k~5)), 32559#(<= ULTIMATE.start_main_~i~5 (* 92 ULTIMATE.start_main_~k~5)), 32560#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 32465#true, 32466#false, 32467#(<= ULTIMATE.start_main_~i~5 0), 32468#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 32469#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 32470#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 32471#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 32472#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 32473#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 32474#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 32475#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 32476#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 32477#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 32478#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 32479#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 32480#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 32481#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 32482#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 32483#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 32484#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 32485#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 32486#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 32487#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 32488#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 32489#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 32490#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 32491#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 32492#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 32493#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 32494#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 32495#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 32496#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 32497#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 32498#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 32499#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 32500#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 32501#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 32502#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 32503#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 32504#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 32505#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 32506#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 32507#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 32508#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 32509#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 32510#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 32511#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5))] [2018-07-23 13:41:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:30,748 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:41:30,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:41:30,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:41:30,749 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-23 13:41:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:38,568 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-23 13:41:38,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:41:38,568 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-23 13:41:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:38,568 INFO L225 Difference]: With dead ends: 100 [2018-07-23 13:41:38,568 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 13:41:38,570 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=9024, Invalid=26508, Unknown=0, NotChecked=0, Total=35532 [2018-07-23 13:41:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 13:41:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 13:41:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:41:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-23 13:41:38,574 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-23 13:41:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:38,574 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-23 13:41:38,574 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:41:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-23 13:41:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-23 13:41:38,574 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:38,575 INFO L357 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-23 13:41:38,575 INFO L414 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-07-23 13:41:38,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:39,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:39,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:41:39,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:39,765 INFO L185 omatonBuilderFactory]: Interpolants [33143#true, 33144#false, 33145#(<= ULTIMATE.start_main_~i~5 0), 33146#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 33147#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 33148#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 33149#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 33150#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 33151#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 33152#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 33153#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 33154#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 33155#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 33156#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 33157#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 33158#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 33159#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 33160#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 33161#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 33162#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 33163#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 33164#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 33165#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 33166#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 33167#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 33168#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 33169#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 33170#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 33171#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 33172#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 33173#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 33174#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 33175#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 33176#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 33177#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 33178#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 33179#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 33180#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 33181#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 33182#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 33183#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 33184#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 33185#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 33186#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 33187#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 33188#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 33189#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 33190#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 33191#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 33192#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 33193#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 33194#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 33195#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 33196#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 33197#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 33198#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 33199#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 33200#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 33201#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 33202#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 33203#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 33204#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 33205#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 33206#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 33207#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 33208#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 33209#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 33210#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 33211#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 33212#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 33213#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 33214#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 33215#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 33216#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 33217#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 33218#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 33219#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 33220#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 33221#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 33222#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 33223#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 33224#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 33225#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 33226#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 33227#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 33228#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 33229#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 33230#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 33231#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 33232#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 33233#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 33234#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 33235#(<= ULTIMATE.start_main_~i~5 (* 90 ULTIMATE.start_main_~k~5)), 33236#(<= ULTIMATE.start_main_~i~5 (* 91 ULTIMATE.start_main_~k~5)), 33237#(<= ULTIMATE.start_main_~i~5 (* 92 ULTIMATE.start_main_~k~5)), 33238#(<= ULTIMATE.start_main_~i~5 (* 93 ULTIMATE.start_main_~k~5)), 33239#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:41:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:39,766 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:41:39,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:41:39,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:41:39,767 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. Received shutdown request... [2018-07-23 13:41:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:41:43,602 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:41:43,608 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:41:43,609 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:41:43 BoogieIcfgContainer [2018-07-23 13:41:43,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:41:43,610 INFO L168 Benchmark]: Toolchain (without parser) took 254131.86 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -863.5 MB). Peak memory consumption was 748.2 MB. Max. memory is 7.1 GB. [2018-07-23 13:41:43,614 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:43,614 INFO L168 Benchmark]: Boogie Preprocessor took 52.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:43,615 INFO L168 Benchmark]: RCFGBuilder took 245.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:41:43,615 INFO L168 Benchmark]: TraceAbstraction took 253829.54 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -874.0 MB). Peak memory consumption was 737.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:41:43,622 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 245.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253829.54 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -874.0 MB). Peak memory consumption was 737.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (98states) and interpolant automaton (currently 46 states, 97 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 141 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 253.7s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 214.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 0 SDslu, 4465 SDs, 0 SdLazy, 9351 SolverSat, 4371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9070 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8974 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135028 ImplicationChecksByTransitivity, 226.6s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/142880 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 94 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 16.8s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 4750 NumberOfCodeBlocks, 4750 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 4655 ConstructedInterpolants, 0 QuantifiedInterpolants, 1469759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 1 PerfectInterpolantSequences, 0/142880 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-41-43-635.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-41-43-635.csv Completed graceful shutdown