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/20170304-DifficultPathPrograms/count_by_k.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:45:07,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:45:07,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:45:07,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:45:07,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:45:07,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:45:07,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:45:07,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:45:07,616 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:45:07,617 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:45:07,618 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:45:07,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:45:07,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:45:07,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:45:07,625 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:45:07,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:45:07,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:45:07,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:45:07,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:45:07,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:45:07,633 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:45:07,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:45:07,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:45:07,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:45:07,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:45:07,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:45:07,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:45:07,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:45:07,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:45:07,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:45:07,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:45:07,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:45:07,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:45:07,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:45:07,644 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:45:07,645 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:45:07,645 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:45:07,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:45:07,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:45:07,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:45:07,666 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:45:07,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:45:07,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:45:07,666 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:45:07,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:45:07,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:45:07,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:45:07,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:45:07,743 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:45:07,743 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:45:07,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_k.i_3.bpl [2018-07-23 13:45:07,745 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_k.i_3.bpl' [2018-07-23 13:45:07,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:45:07,797 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:45:07,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:45:07,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:45:07,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:45:07,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/1) ... [2018-07-23 13:45:07,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/1) ... [2018-07-23 13:45:07,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/1) ... [2018-07-23 13:45:07,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/1) ... [2018-07-23 13:45:07,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/1) ... [2018-07-23 13:45:07,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/1) ... [2018-07-23 13:45:07,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/1) ... [2018-07-23 13:45:07,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:45:07,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:45:07,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:45:07,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:45:07,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/1) ... [2018-07-23 13:45:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:45:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:45:08,062 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:45:08,063 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:45:08 BoogieIcfgContainer [2018-07-23 13:45:08,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:45:08,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:45:08,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:45:08,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:45:08,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:45:07" (1/2) ... [2018-07-23 13:45:08,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ee2f14 and model type count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:45:08, skipping insertion in model container [2018-07-23 13:45:08,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:45:08" (2/2) ... [2018-07-23 13:45:08,073 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bpl [2018-07-23 13:45:08,083 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:45:08,093 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:45:08,149 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:45:08,150 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:45:08,150 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:45:08,150 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:45:08,150 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:45:08,151 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:45:08,151 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:45:08,151 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:45:08,151 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:45:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:45:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:45:08,180 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:08,181 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:45:08,182 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:08,189 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-23 13:45:08,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:08,337 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:45:08,340 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:45:08,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:45:08,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:08,343 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:45:08,344 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(< ULTIMATE.start_main_~i~5 (+ (* 1000000 ULTIMATE.start_main_~k~5) 1))] [2018-07-23 13:45:08,344 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:45:08,345 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:45:08,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:45:08,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:45:08,365 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 13:45:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:08,395 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-23 13:45:08,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:45:08,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 13:45:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:08,409 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:45:08,409 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:45:08,413 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:45:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:45:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:45:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:45:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:45:08,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:45:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:08,464 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:45:08,464 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:45:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:45:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:45:08,465 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:08,466 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:45:08,466 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-23 13:45:08,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:08,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:08,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:45:08,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:08,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:45:08,501 INFO L185 omatonBuilderFactory]: Interpolants [48#(<= ULTIMATE.start_main_~i~5 0), 49#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 46#true, 47#false] [2018-07-23 13:45:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:08,503 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:45:08,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:45:08,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:45:08,504 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 13:45:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:08,523 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:45:08,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:45:08,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:45:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:08,527 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:45:08,527 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:45:08,534 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:45:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:45:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:45:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:45:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:45:08,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:45:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:08,541 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:45:08,541 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:45:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:45:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:45:08,542 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:08,542 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:45:08,543 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-23 13:45:08,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:08,594 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:45:08,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:08,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:45:08,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:08,596 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:45:08,596 INFO L185 omatonBuilderFactory]: Interpolants [90#true, 91#false, 92#(<= ULTIMATE.start_main_~i~5 0), 93#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 94#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:08,596 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:45:08,597 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:45:08,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:45:08,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:45:08,601 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-23 13:45:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:08,652 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:45:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:45:08,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 13:45:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:08,653 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:45:08,653 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:45:08,654 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:45:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:45:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:45:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:45:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:45:08,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:45:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:08,659 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:45:08,660 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:45:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:45:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:45:08,660 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:08,661 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:45:08,661 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-23 13:45:08,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:08,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:08,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:45:08,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:08,758 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:45:08,758 INFO L185 omatonBuilderFactory]: Interpolants [147#true, 148#false, 149#(<= ULTIMATE.start_main_~i~5 0), 150#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 151#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 152#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:08,761 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:45:08,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:45:08,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:45:08,762 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-23 13:45:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:08,845 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:45:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:45:08,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 13:45:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:08,849 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:45:08,849 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:45:08,850 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:45:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:45:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:45:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:45:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:45:08,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:45:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:08,860 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:45:08,860 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:45:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:45:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:45:08,863 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:08,863 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:45:08,864 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-23 13:45:08,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:08,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:08,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:45:08,916 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:08,917 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:45:08,917 INFO L185 omatonBuilderFactory]: Interpolants [215#true, 216#false, 217#(<= ULTIMATE.start_main_~i~5 0), 218#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 219#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 220#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 221#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:08,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:45:08,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:45:08,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:45:08,919 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-23 13:45:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:08,998 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:45:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:45:08,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:45:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:09,000 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:45:09,000 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:45:09,003 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:45:09,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:45:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:45:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:45:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:45:09,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:45:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:09,017 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:45:09,017 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:45:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:45:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:45:09,018 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:09,019 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:45:09,019 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-23 13:45:09,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:09,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:45:09,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:09,097 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:45:09,098 INFO L185 omatonBuilderFactory]: Interpolants [294#true, 295#false, 296#(<= ULTIMATE.start_main_~i~5 0), 297#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 298#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 299#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 300#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 301#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,101 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:45:09,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:45:09,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:45:09,102 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-23 13:45:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:09,196 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:45:09,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:45:09,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:45:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:09,197 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:45:09,197 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:45:09,198 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:45:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:45:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:45:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:45:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:45:09,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-23 13:45:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:09,205 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:45:09,205 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:45:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:45:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:45:09,206 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:09,206 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-23 13:45:09,206 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-23 13:45:09,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:09,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:45:09,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:09,266 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:45:09,268 INFO L185 omatonBuilderFactory]: Interpolants [384#true, 385#false, 386#(<= ULTIMATE.start_main_~i~5 0), 387#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 388#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 389#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 390#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 391#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 392#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,269 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:45:09,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:45:09,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:45:09,270 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-23 13:45:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:09,379 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:45:09,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:45:09,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:45:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:09,380 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:45:09,380 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:45:09,381 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:45:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:45:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:45:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:45:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:45:09,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-23 13:45:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:09,394 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:45:09,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:45:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:45:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:45:09,396 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:09,397 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 13:45:09,397 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-23 13:45:09,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:09,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:45:09,475 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:09,476 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:45:09,477 INFO L185 omatonBuilderFactory]: Interpolants [485#true, 486#false, 487#(<= ULTIMATE.start_main_~i~5 0), 488#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 489#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 490#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 491#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 492#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 493#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 494#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,477 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:45:09,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:45:09,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:45:09,479 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-23 13:45:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:09,618 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:45:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:45:09,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:45:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:09,620 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:45:09,620 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:45:09,623 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:45:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:45:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:45:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:45:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 13:45:09,635 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-23 13:45:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:09,636 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 13:45:09,636 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:45:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 13:45:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:45:09,638 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:09,638 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-23 13:45:09,639 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-23 13:45:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:09,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:45:09,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:09,703 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:45:09,704 INFO L185 omatonBuilderFactory]: Interpolants [597#true, 598#false, 599#(<= ULTIMATE.start_main_~i~5 0), 600#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 601#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 602#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 603#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 604#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 605#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 606#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 607#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,708 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:45:09,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:45:09,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:45:09,710 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-23 13:45:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:09,835 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 13:45:09,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:45:09,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 13:45:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:09,837 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:45:09,838 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:45:09,838 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:45:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:45:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:45:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:45:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 13:45:09,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-23 13:45:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:09,848 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 13:45:09,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:45:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 13:45:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:45:09,850 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:09,850 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-23 13:45:09,850 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-23 13:45:09,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,910 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:09,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:45:09,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:09,911 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:45:09,911 INFO L185 omatonBuilderFactory]: Interpolants [720#true, 721#false, 722#(<= ULTIMATE.start_main_~i~5 0), 723#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 724#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 725#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 726#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 727#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 728#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 729#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 730#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 731#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:09,912 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:45:09,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:45:09,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:45:09,913 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-23 13:45:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:10,058 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 13:45:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:45:10,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-23 13:45:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:10,060 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:45:10,060 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:45:10,061 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:45:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:45:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:45:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:45:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 13:45:10,068 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-23 13:45:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:10,069 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 13:45:10,069 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:45:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 13:45:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:45:10,071 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:10,071 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-23 13:45:10,072 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-23 13:45:10,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:10,154 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:10,154 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:45:10,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:10,155 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:45:10,156 INFO L185 omatonBuilderFactory]: Interpolants [864#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 865#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 866#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 854#true, 855#false, 856#(<= ULTIMATE.start_main_~i~5 0), 857#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 858#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 859#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 860#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 861#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 862#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 863#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:10,157 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:45:10,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:45:10,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:45:10,158 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-23 13:45:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:10,322 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:45:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:45:10,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-23 13:45:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:10,325 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:45:10,325 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:45:10,327 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:45:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:45:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:45:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:45:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 13:45:10,339 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-23 13:45:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:10,339 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 13:45:10,340 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:45:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 13:45:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:45:10,341 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:10,342 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-23 13:45:10,342 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-23 13:45:10,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:10,427 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:10,427 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:45:10,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:10,427 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:45:10,428 INFO L185 omatonBuilderFactory]: Interpolants [999#true, 1000#false, 1001#(<= ULTIMATE.start_main_~i~5 0), 1002#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1003#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1004#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1005#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1006#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1007#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1008#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1009#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1010#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1011#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1012#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:10,429 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:45:10,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:45:10,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:45:10,430 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-23 13:45:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:10,603 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:45:10,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:45:10,604 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-23 13:45:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:10,605 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:45:10,606 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:45:10,607 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:45:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:45:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:45:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:45:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 13:45:10,615 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-23 13:45:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:10,616 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 13:45:10,616 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:45:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 13:45:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:45:10,617 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:10,618 INFO L357 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-23 13:45:10,618 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-23 13:45:10,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:10,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:10,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:45:10,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:10,728 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:45:10,728 INFO L185 omatonBuilderFactory]: Interpolants [1155#true, 1156#false, 1157#(<= ULTIMATE.start_main_~i~5 0), 1158#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1159#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1160#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1161#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1162#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1163#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1164#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1165#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1166#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1167#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1168#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1169#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:10,729 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:45:10,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:45:10,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:45:10,731 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-23 13:45:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:10,934 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 13:45:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:45:10,934 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-23 13:45:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:10,935 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:45:10,935 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:45:10,936 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:45:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:45:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:45:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:45:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 13:45:10,946 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-23 13:45:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:10,946 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 13:45:10,946 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:45:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 13:45:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:45:10,947 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:10,949 INFO L357 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-23 13:45:10,949 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-23 13:45:10,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:11,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:11,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:45:11,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:11,053 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:45:11,054 INFO L185 omatonBuilderFactory]: Interpolants [1322#true, 1323#false, 1324#(<= ULTIMATE.start_main_~i~5 0), 1325#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1326#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1327#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1328#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1329#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1330#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1331#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1332#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1333#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1334#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1335#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1336#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1337#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:11,055 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:45:11,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:45:11,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:45:11,056 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-23 13:45:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:11,313 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 13:45:11,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:45:11,313 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-23 13:45:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:11,314 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:45:11,314 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:45:11,315 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:45:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:45:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 13:45:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 13:45:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 13:45:11,323 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-23 13:45:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:11,323 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 13:45:11,323 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:45:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 13:45:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:45:11,324 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:11,325 INFO L357 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-23 13:45:11,325 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-23 13:45:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:11,437 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:45:11,438 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:11,438 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:45:11,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:11,438 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:45:11,439 INFO L185 omatonBuilderFactory]: Interpolants [1504#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1505#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1506#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1507#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1508#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1509#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1510#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1511#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1512#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1513#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1514#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1515#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1516#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 1500#true, 1501#false, 1502#(<= ULTIMATE.start_main_~i~5 0), 1503#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5)] [2018-07-23 13:45:11,439 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:45:11,440 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:45:11,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:45:11,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:45:11,441 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-23 13:45:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:11,691 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 13:45:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:45:11,692 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-23 13:45:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:11,693 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:45:11,693 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:45:11,694 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:45:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:45:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:45:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:45:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 13:45:11,704 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-23 13:45:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:11,705 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 13:45:11,705 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:45:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 13:45:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:45:11,706 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:11,706 INFO L357 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-23 13:45:11,706 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:11,707 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-23 13:45:11,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:11,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:11,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:45:11,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:11,836 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:45:11,837 INFO L185 omatonBuilderFactory]: Interpolants [1696#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1697#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1698#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1699#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1700#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1701#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1702#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1703#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1704#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1705#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 1706#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 1689#true, 1690#false, 1691#(<= ULTIMATE.start_main_~i~5 0), 1692#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1693#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1694#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1695#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:11,839 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:45:11,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:45:11,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:45:11,840 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-23 13:45:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:12,165 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 13:45:12,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:45:12,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 13:45:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:12,167 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:45:12,167 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 13:45:12,171 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:45:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 13:45:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 13:45:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:45:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 13:45:12,180 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-23 13:45:12,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:12,181 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 13:45:12,181 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:45:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 13:45:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:45:12,182 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:12,182 INFO L357 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-23 13:45:12,182 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:12,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-23 13:45:12,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:12,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:12,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:45:12,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:12,305 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:45:12,305 INFO L185 omatonBuilderFactory]: Interpolants [1889#true, 1890#false, 1891#(<= ULTIMATE.start_main_~i~5 0), 1892#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 1893#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 1894#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 1895#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 1896#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 1897#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 1898#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 1899#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 1900#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 1901#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 1902#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 1903#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 1904#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 1905#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 1906#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 1907#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:12,306 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:45:12,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:45:12,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:45:12,307 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-23 13:45:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:12,624 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 13:45:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:45:12,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-23 13:45:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:12,625 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:45:12,625 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:45:12,628 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:45:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:45:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 13:45:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 13:45:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 13:45:12,638 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-23 13:45:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:12,639 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 13:45:12,639 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:45:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 13:45:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:45:12,640 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:12,640 INFO L357 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-23 13:45:12,640 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-23 13:45:12,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:12,759 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:12,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:45:12,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:12,760 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:45:12,760 INFO L185 omatonBuilderFactory]: Interpolants [2112#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2113#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2114#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2115#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2116#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 2117#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2118#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2119#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 2100#true, 2101#false, 2102#(<= ULTIMATE.start_main_~i~5 0), 2103#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2104#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2105#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2106#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2107#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2108#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2109#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2110#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2111#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:12,761 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:45:12,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:45:12,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:45:12,763 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-23 13:45:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:13,108 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 13:45:13,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:45:13,108 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-23 13:45:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:13,109 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:45:13,109 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:45:13,110 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:45:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:45:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 13:45:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 13:45:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 13:45:13,118 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-23 13:45:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:13,118 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 13:45:13,119 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:45:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 13:45:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:45:13,119 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:13,120 INFO L357 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-23 13:45:13,120 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-23 13:45:13,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:13,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:13,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:45:13,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:13,245 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:45:13,245 INFO L185 omatonBuilderFactory]: Interpolants [2336#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2337#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2338#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 2339#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2340#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2341#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 2342#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 2322#true, 2323#false, 2324#(<= ULTIMATE.start_main_~i~5 0), 2325#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2326#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2327#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2328#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2329#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2330#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2331#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2332#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2333#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2334#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2335#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:13,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:45:13,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:45:13,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:45:13,247 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-23 13:45:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:13,605 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 13:45:13,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:45:13,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-23 13:45:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:13,606 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:45:13,606 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:45:13,607 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:45:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:45:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 13:45:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:45:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 13:45:13,614 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-23 13:45:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:13,614 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 13:45:13,615 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:45:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 13:45:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:45:13,615 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:13,616 INFO L357 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-23 13:45:13,616 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-23 13:45:13,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:13,744 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:13,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:45:13,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:13,745 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:45:13,745 INFO L185 omatonBuilderFactory]: Interpolants [2560#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2561#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2562#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2563#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2564#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2565#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2566#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2567#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2568#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2569#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2570#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2571#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 2572#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2573#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2574#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 2575#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 2576#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 2555#true, 2556#false, 2557#(<= ULTIMATE.start_main_~i~5 0), 2558#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2559#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:13,746 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:45:13,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:45:13,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:45:13,746 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-23 13:45:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:14,119 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 13:45:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:45:14,120 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-23 13:45:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:14,120 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:45:14,121 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 13:45:14,122 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:45:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 13:45:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 13:45:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 13:45:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 13:45:14,138 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-23 13:45:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:14,138 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 13:45:14,138 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:45:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 13:45:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:45:14,139 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:14,141 INFO L357 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-23 13:45:14,142 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-23 13:45:14,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:14,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:14,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:45:14,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:14,302 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:45:14,303 INFO L185 omatonBuilderFactory]: Interpolants [2816#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 2817#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 2818#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 2819#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 2820#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 2821#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 2799#true, 2800#false, 2801#(<= ULTIMATE.start_main_~i~5 0), 2802#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 2803#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 2804#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 2805#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 2806#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 2807#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 2808#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 2809#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 2810#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 2811#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 2812#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 2813#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 2814#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 2815#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:14,303 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:45:14,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:45:14,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:45:14,304 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-23 13:45:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:14,815 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 13:45:14,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:45:14,815 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-23 13:45:14,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:14,816 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:45:14,816 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:45:14,818 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:45:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:45:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 13:45:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:45:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 13:45:14,824 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-23 13:45:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:14,825 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 13:45:14,825 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:45:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 13:45:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:45:14,826 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:14,826 INFO L357 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-23 13:45:14,826 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-23 13:45:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:14,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:14,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:45:14,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:14,976 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:45:14,976 INFO L185 omatonBuilderFactory]: Interpolants [3072#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 3073#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3074#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3075#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3076#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 3077#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 3054#true, 3055#false, 3056#(<= ULTIMATE.start_main_~i~5 0), 3057#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 3058#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 3059#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 3060#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 3061#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 3062#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 3063#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 3064#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 3065#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 3066#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 3067#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 3068#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 3069#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3070#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3071#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:14,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:45:14,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:45:14,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:45:14,978 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-23 13:45:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:15,425 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 13:45:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:45:15,425 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-23 13:45:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:15,426 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:45:15,426 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 13:45:15,428 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:45:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 13:45:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 13:45:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:45:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 13:45:15,437 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-23 13:45:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:15,438 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 13:45:15,438 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:45:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 13:45:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:45:15,438 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:15,439 INFO L357 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-23 13:45:15,439 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-23 13:45:15,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:15,599 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:15,599 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:45:15,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:15,600 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:45:15,600 INFO L185 omatonBuilderFactory]: Interpolants [3328#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 3329#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 3330#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 3331#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 3332#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 3333#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 3334#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 3335#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3336#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3337#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 3338#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 3339#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3340#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3341#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3342#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 3343#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 3344#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 3320#true, 3321#false, 3322#(<= ULTIMATE.start_main_~i~5 0), 3323#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 3324#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 3325#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 3326#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 3327#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:15,601 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:45:15,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:45:15,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:45:15,602 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-23 13:45:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:16,118 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 13:45:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:45:16,119 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-23 13:45:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:16,119 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:45:16,120 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:45:16,121 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:45:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:45:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 13:45:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:45:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 13:45:16,128 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-23 13:45:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 13:45:16,129 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:45:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 13:45:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:45:16,129 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:16,129 INFO L357 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-23 13:45:16,129 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-23 13:45:16,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:16,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:16,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:45:16,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:16,303 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:45:16,303 INFO L185 omatonBuilderFactory]: Interpolants [3597#true, 3598#false, 3599#(<= ULTIMATE.start_main_~i~5 0), 3600#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 3601#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 3602#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 3603#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 3604#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 3605#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 3606#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 3607#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 3608#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 3609#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 3610#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 3611#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 3612#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3613#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3614#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 3615#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 3616#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3617#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3618#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3619#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 3620#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 3621#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 3622#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:16,304 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:45:16,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:45:16,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:45:16,305 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-23 13:45:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:16,854 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 13:45:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:45:16,855 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-23 13:45:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:16,856 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:45:16,856 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:45:16,857 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:45:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:45:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:45:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:45:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 13:45:16,866 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-23 13:45:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:16,866 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 13:45:16,866 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:45:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 13:45:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:45:16,867 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:16,867 INFO L357 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-23 13:45:16,867 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-23 13:45:16,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:17,084 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:17,084 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:45:17,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:17,085 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:45:17,085 INFO L185 omatonBuilderFactory]: Interpolants [3904#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 3905#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 3906#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 3907#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 3908#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 3909#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 3910#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 3911#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 3885#true, 3886#false, 3887#(<= ULTIMATE.start_main_~i~5 0), 3888#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 3889#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 3890#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 3891#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 3892#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 3893#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 3894#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 3895#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 3896#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 3897#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 3898#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 3899#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 3900#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 3901#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 3902#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 3903#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:17,087 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:45:17,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:45:17,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:45:17,088 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-23 13:45:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:17,820 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 13:45:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:45:17,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-23 13:45:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:17,821 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:45:17,822 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 13:45:17,823 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:45:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 13:45:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 13:45:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 13:45:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 13:45:17,834 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-23 13:45:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:17,834 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 13:45:17,834 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:45:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 13:45:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 13:45:17,835 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:17,835 INFO L357 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-23 13:45:17,835 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-23 13:45:17,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:18,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:18,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:45:18,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:18,064 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:45:18,064 INFO L185 omatonBuilderFactory]: Interpolants [4184#true, 4185#false, 4186#(<= ULTIMATE.start_main_~i~5 0), 4187#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 4188#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 4189#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 4190#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 4191#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 4192#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 4193#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 4194#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 4195#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 4196#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 4197#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 4198#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 4199#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 4200#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 4201#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 4202#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 4203#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 4204#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 4205#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 4206#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 4207#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 4208#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 4209#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 4210#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 4211#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:18,065 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:45:18,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:45:18,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:45:18,068 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-23 13:45:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:18,709 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 13:45:18,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:45:18,710 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-23 13:45:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:18,711 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:45:18,711 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:45:18,713 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:45:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:45:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 13:45:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:45:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 13:45:18,728 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-23 13:45:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:18,728 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 13:45:18,728 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:45:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 13:45:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 13:45:18,729 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:18,729 INFO L357 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-23 13:45:18,729 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-23 13:45:18,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:18,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:18,944 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:45:18,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:18,945 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:45:18,945 INFO L185 omatonBuilderFactory]: Interpolants [4494#true, 4495#false, 4496#(<= ULTIMATE.start_main_~i~5 0), 4497#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 4498#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 4499#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 4500#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 4501#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 4502#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 4503#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 4504#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 4505#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 4506#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 4507#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 4508#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 4509#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 4510#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 4511#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 4512#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 4513#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 4514#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 4515#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 4516#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 4517#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 4518#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 4519#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 4520#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 4521#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 4522#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:18,946 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:45:18,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:45:18,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:45:18,947 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-23 13:45:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:19,626 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 13:45:19,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:45:19,626 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-23 13:45:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:19,627 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:45:19,627 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:45:19,629 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:45:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:45:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 13:45:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 13:45:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 13:45:19,639 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-23 13:45:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 13:45:19,639 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:45:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 13:45:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:45:19,640 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:19,640 INFO L357 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-23 13:45:19,640 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:19,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-23 13:45:19,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:19,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:19,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:45:19,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:19,886 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:45:19,887 INFO L185 omatonBuilderFactory]: Interpolants [4815#true, 4816#false, 4817#(<= ULTIMATE.start_main_~i~5 0), 4818#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 4819#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 4820#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 4821#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 4822#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 4823#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 4824#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 4825#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 4826#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 4827#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 4828#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 4829#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 4830#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 4831#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 4832#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 4833#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 4834#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 4835#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 4836#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 4837#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 4838#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 4839#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 4840#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 4841#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 4842#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 4843#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 4844#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:19,888 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:45:19,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:45:19,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:45:19,889 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-23 13:45:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:20,676 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 13:45:20,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:45:20,676 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-23 13:45:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:20,677 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:45:20,677 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 13:45:20,679 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:45:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 13:45:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 13:45:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 13:45:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 13:45:20,687 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-23 13:45:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:20,688 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 13:45:20,688 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:45:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 13:45:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:45:20,689 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:20,689 INFO L357 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-23 13:45:20,689 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:20,689 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-23 13:45:20,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:20,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:20,915 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:45:20,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:20,915 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:45:20,915 INFO L185 omatonBuilderFactory]: Interpolants [5147#true, 5148#false, 5149#(<= ULTIMATE.start_main_~i~5 0), 5150#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 5151#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 5152#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 5153#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 5154#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 5155#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 5156#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 5157#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 5158#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 5159#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 5160#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 5161#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 5162#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 5163#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 5164#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 5165#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 5166#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 5167#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 5168#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 5169#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 5170#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 5171#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 5172#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 5173#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 5174#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 5175#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 5176#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 5177#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:20,917 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:45:20,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:45:20,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:45:20,918 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-23 13:45:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:21,638 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 13:45:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:45:21,638 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-23 13:45:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:21,639 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:45:21,639 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 13:45:21,641 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:45:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 13:45:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 13:45:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 13:45:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 13:45:21,649 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-23 13:45:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:21,649 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 13:45:21,649 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:45:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 13:45:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 13:45:21,651 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:21,651 INFO L357 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-23 13:45:21,651 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:21,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-23 13:45:21,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:21,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:21,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:45:21,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:21,890 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:45:21,890 INFO L185 omatonBuilderFactory]: Interpolants [5504#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 5505#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 5506#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 5507#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 5508#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 5509#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 5510#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 5511#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 5512#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 5513#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 5514#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 5515#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 5516#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 5517#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 5518#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 5519#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 5520#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 5521#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 5490#true, 5491#false, 5492#(<= ULTIMATE.start_main_~i~5 0), 5493#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 5494#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 5495#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 5496#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 5497#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 5498#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 5499#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 5500#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 5501#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 5502#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 5503#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:21,891 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:45:21,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:45:21,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:45:21,892 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-23 13:45:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:22,699 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 13:45:22,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:45:22,699 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-23 13:45:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:22,700 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:45:22,700 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:45:22,703 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:45:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:45:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 13:45:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:45:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 13:45:22,710 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-23 13:45:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:22,711 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 13:45:22,711 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:45:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 13:45:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 13:45:22,712 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:22,712 INFO L357 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-23 13:45:22,712 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-23 13:45:22,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:22,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:23,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:45:23,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:23,000 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:45:23,000 INFO L185 omatonBuilderFactory]: Interpolants [5844#true, 5845#false, 5846#(<= ULTIMATE.start_main_~i~5 0), 5847#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 5848#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 5849#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 5850#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 5851#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 5852#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 5853#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 5854#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 5855#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 5856#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 5857#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 5858#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 5859#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 5860#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 5861#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 5862#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 5863#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 5864#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 5865#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 5866#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 5867#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 5868#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 5869#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 5870#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 5871#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 5872#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 5873#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 5874#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 5875#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 5876#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:23,002 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:45:23,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:45:23,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:45:23,003 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-23 13:45:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:23,810 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 13:45:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:45:23,810 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-23 13:45:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:23,811 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:45:23,811 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:45:23,813 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:45:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:45:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 13:45:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:45:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 13:45:23,820 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-23 13:45:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:23,820 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 13:45:23,821 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:45:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 13:45:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:45:23,821 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:23,821 INFO L357 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-23 13:45:23,822 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-23 13:45:23,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:24,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:24,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:45:24,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:24,067 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:45:24,067 INFO L185 omatonBuilderFactory]: Interpolants [6209#true, 6210#false, 6211#(<= ULTIMATE.start_main_~i~5 0), 6212#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 6213#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 6214#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 6215#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 6216#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 6217#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 6218#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 6219#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 6220#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 6221#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 6222#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 6223#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 6224#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 6225#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 6226#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 6227#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 6228#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 6229#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 6230#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 6231#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 6232#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 6233#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 6234#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 6235#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 6236#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 6237#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 6238#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 6239#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 6240#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 6241#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 6242#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:24,068 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:45:24,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:45:24,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:45:24,069 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-23 13:45:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:24,933 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 13:45:24,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:45:24,933 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-23 13:45:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:24,934 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:45:24,934 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 13:45:24,936 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:45:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 13:45:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 13:45:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 13:45:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 13:45:24,945 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-23 13:45:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:24,945 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 13:45:24,946 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:45:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 13:45:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:45:24,946 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:24,946 INFO L357 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-23 13:45:24,947 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-23 13:45:24,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:25,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:25,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:45:25,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:25,208 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:45:25,208 INFO L185 omatonBuilderFactory]: Interpolants [6592#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 6593#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 6594#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 6595#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 6596#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 6597#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 6598#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 6599#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 6600#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 6601#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 6602#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 6603#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 6604#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 6605#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 6606#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 6607#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 6608#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 6609#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 6610#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 6611#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 6612#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 6613#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 6614#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 6615#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 6616#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 6617#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 6618#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 6619#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 6585#true, 6586#false, 6587#(<= ULTIMATE.start_main_~i~5 0), 6588#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 6589#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 6590#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 6591#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:25,209 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:45:25,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:45:25,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:45:25,213 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-23 13:45:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:26,212 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 13:45:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:45:26,213 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-23 13:45:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:26,213 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:45:26,214 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 13:45:26,216 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:45:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 13:45:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 13:45:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 13:45:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 13:45:26,224 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-23 13:45:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:26,224 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 13:45:26,224 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:45:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 13:45:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 13:45:26,225 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:26,225 INFO L357 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-23 13:45:26,225 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-23 13:45:26,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:26,472 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:26,472 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:45:26,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:26,473 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:45:26,473 INFO L185 omatonBuilderFactory]: Interpolants [6976#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 6977#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 6978#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 6979#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 6980#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 6981#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 6982#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 6983#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 6984#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 6985#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 6986#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 6987#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 6988#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 6989#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 6990#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 6991#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 6992#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 6993#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 6994#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 6995#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 6996#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 6997#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 6998#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 6999#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 7000#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 7001#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 7002#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 7003#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 7004#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 7005#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 7006#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 7007#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 6972#true, 6973#false, 6974#(<= ULTIMATE.start_main_~i~5 0), 6975#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5)] [2018-07-23 13:45:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:26,475 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:45:26,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:45:26,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:45:26,478 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-23 13:45:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:27,441 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 13:45:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:45:27,442 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-23 13:45:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:27,443 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:45:27,443 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 13:45:27,444 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:45:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 13:45:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 13:45:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 13:45:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 13:45:27,453 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-23 13:45:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:27,453 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 13:45:27,454 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:45:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 13:45:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 13:45:27,454 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:27,455 INFO L357 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-23 13:45:27,455 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-23 13:45:27,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:27,729 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:27,729 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:45:27,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:27,730 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:45:27,730 INFO L185 omatonBuilderFactory]: Interpolants [7370#true, 7371#false, 7372#(<= ULTIMATE.start_main_~i~5 0), 7373#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 7374#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 7375#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 7376#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 7377#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 7378#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 7379#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 7380#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 7381#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 7382#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 7383#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 7384#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 7385#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 7386#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 7387#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 7388#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 7389#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 7390#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 7391#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 7392#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 7393#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 7394#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 7395#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 7396#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 7397#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 7398#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 7399#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 7400#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 7401#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 7402#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 7403#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 7404#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 7405#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 7406#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:27,731 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:45:27,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:45:27,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:45:27,732 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-23 13:45:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:28,767 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 13:45:28,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:45:28,767 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-23 13:45:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:28,768 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:45:28,768 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:45:28,770 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:45:28,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:45:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 13:45:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 13:45:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 13:45:28,779 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-23 13:45:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:28,780 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 13:45:28,780 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:45:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 13:45:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 13:45:28,781 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:28,781 INFO L357 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-23 13:45:28,781 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-23 13:45:28,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:29,046 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:29,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:45:29,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:29,047 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:45:29,047 INFO L185 omatonBuilderFactory]: Interpolants [7808#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 7809#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 7810#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 7811#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 7812#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 7813#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 7814#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 7815#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 7816#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 7779#true, 7780#false, 7781#(<= ULTIMATE.start_main_~i~5 0), 7782#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 7783#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 7784#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 7785#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 7786#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 7787#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 7788#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 7789#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 7790#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 7791#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 7792#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 7793#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 7794#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 7795#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 7796#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 7797#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 7798#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 7799#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 7800#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 7801#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 7802#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 7803#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 7804#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 7805#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 7806#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 7807#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:29,050 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:45:29,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:45:29,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:45:29,051 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-23 13:45:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:30,063 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 13:45:30,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:45:30,063 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-23 13:45:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:30,064 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:45:30,064 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:45:30,065 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:45:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:45:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 13:45:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 13:45:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 13:45:30,073 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-23 13:45:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:30,074 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 13:45:30,074 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:45:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 13:45:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:45:30,075 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:30,075 INFO L357 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-23 13:45:30,075 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:30,075 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-23 13:45:30,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:30,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:30,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:45:30,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:30,341 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:45:30,341 INFO L185 omatonBuilderFactory]: Interpolants [8199#true, 8200#false, 8201#(<= ULTIMATE.start_main_~i~5 0), 8202#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 8203#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 8204#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 8205#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 8206#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 8207#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 8208#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 8209#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 8210#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 8211#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 8212#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 8213#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 8214#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 8215#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 8216#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 8217#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 8218#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 8219#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 8220#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 8221#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 8222#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 8223#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 8224#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 8225#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 8226#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 8227#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 8228#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 8229#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 8230#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 8231#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 8232#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 8233#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 8234#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 8235#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 8236#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 8237#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:30,342 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:45:30,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:45:30,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:45:30,344 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-23 13:45:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:31,525 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 13:45:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:45:31,526 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-23 13:45:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:31,526 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:45:31,526 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:45:31,528 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:45:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:45:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 13:45:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 13:45:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 13:45:31,536 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-23 13:45:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:31,536 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 13:45:31,536 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:45:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 13:45:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:45:31,540 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:31,540 INFO L357 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-23 13:45:31,540 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:31,541 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-23 13:45:31,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:31,802 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:31,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:45:31,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:31,803 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:45:31,803 INFO L185 omatonBuilderFactory]: Interpolants [8640#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 8641#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 8642#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 8643#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 8644#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 8645#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 8646#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 8647#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 8648#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 8649#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 8650#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 8651#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 8652#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 8653#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 8654#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 8655#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 8656#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 8657#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 8658#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 8659#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 8660#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 8661#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 8662#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 8663#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 8664#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 8665#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 8666#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 8667#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 8668#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 8669#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 8630#true, 8631#false, 8632#(<= ULTIMATE.start_main_~i~5 0), 8633#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 8634#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 8635#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 8636#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 8637#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 8638#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 8639#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:31,804 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:45:31,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:45:31,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:45:31,805 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-23 13:45:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:32,903 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 13:45:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:45:32,903 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-23 13:45:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:32,904 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:45:32,904 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 13:45:32,906 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:45:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 13:45:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 13:45:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 13:45:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 13:45:32,915 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-23 13:45:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:32,915 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 13:45:32,915 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:45:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 13:45:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 13:45:32,916 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:32,916 INFO L357 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-23 13:45:32,917 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-23 13:45:32,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:33,180 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:33,180 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:45:33,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:33,180 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:45:33,180 INFO L185 omatonBuilderFactory]: Interpolants [9088#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 9089#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 9090#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 9091#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 9092#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 9093#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 9094#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 9095#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 9096#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 9097#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 9098#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 9099#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 9100#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 9101#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 9102#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 9103#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 9104#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 9105#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 9106#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 9107#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 9108#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 9109#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 9110#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 9111#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 9112#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 9072#true, 9073#false, 9074#(<= ULTIMATE.start_main_~i~5 0), 9075#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 9076#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 9077#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 9078#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 9079#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 9080#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 9081#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 9082#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 9083#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 9084#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 9085#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 9086#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 9087#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:33,181 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:45:33,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:45:33,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:45:33,182 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-23 13:45:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:34,343 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 13:45:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:45:34,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-23 13:45:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:34,345 INFO L225 Difference]: With dead ends: 85 [2018-07-23 13:45:34,345 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:45:34,346 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:45:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:45:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 13:45:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:45:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 13:45:34,354 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-23 13:45:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:34,355 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 13:45:34,355 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:45:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 13:45:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 13:45:34,356 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:34,356 INFO L357 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-23 13:45:34,356 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-23 13:45:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:34,613 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:34,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:45:34,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:34,613 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:45:34,614 INFO L185 omatonBuilderFactory]: Interpolants [9536#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 9537#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 9538#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 9539#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 9540#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 9541#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 9542#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 9543#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 9544#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 9545#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 9546#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 9547#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 9548#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 9549#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 9550#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 9551#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 9552#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 9553#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 9554#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 9555#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 9556#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 9557#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 9558#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 9559#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 9560#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 9561#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 9562#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 9563#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 9564#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 9565#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 9566#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 9525#true, 9526#false, 9527#(<= ULTIMATE.start_main_~i~5 0), 9528#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 9529#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 9530#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 9531#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 9532#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 9533#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 9534#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 9535#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:34,614 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:45:34,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:45:34,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:45:34,615 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-23 13:45:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:35,787 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 13:45:35,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:45:35,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-23 13:45:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:35,788 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:45:35,788 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 13:45:35,789 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:45:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 13:45:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 13:45:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:45:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 13:45:35,796 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-23 13:45:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:35,797 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 13:45:35,797 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:45:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 13:45:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 13:45:35,799 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:35,799 INFO L357 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-23 13:45:35,799 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-23 13:45:35,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:36,143 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:36,144 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:45:36,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:36,147 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:45:36,148 INFO L185 omatonBuilderFactory]: Interpolants [9989#true, 9990#false, 9991#(<= ULTIMATE.start_main_~i~5 0), 9992#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 9993#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 9994#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 9995#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 9996#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 9997#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 9998#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 9999#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 10000#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 10001#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 10002#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 10003#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 10004#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 10005#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 10006#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 10007#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 10008#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 10009#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 10010#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 10011#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 10012#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 10013#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 10014#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 10015#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 10016#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 10017#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 10018#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 10019#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 10020#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 10021#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 10022#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 10023#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 10024#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 10025#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 10026#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 10027#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 10028#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 10029#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 10030#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 10031#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:36,148 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:45:36,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:45:36,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:45:36,149 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-23 13:45:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:37,401 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 13:45:37,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:45:37,402 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-23 13:45:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:37,402 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:45:37,403 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:45:37,404 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:45:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:45:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 13:45:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:45:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 13:45:37,410 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-23 13:45:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:37,411 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 13:45:37,411 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:45:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 13:45:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:45:37,412 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:37,412 INFO L357 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-23 13:45:37,412 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-23 13:45:37,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:37,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:37,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:45:37,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:37,716 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:45:37,717 INFO L185 omatonBuilderFactory]: Interpolants [10496#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 10497#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 10498#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 10499#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 10500#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 10501#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 10502#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 10503#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 10504#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 10505#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 10506#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 10507#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 10464#true, 10465#false, 10466#(<= ULTIMATE.start_main_~i~5 0), 10467#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 10468#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 10469#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 10470#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 10471#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 10472#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 10473#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 10474#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 10475#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 10476#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 10477#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 10478#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 10479#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 10480#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 10481#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 10482#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 10483#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 10484#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 10485#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 10486#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 10487#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 10488#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 10489#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 10490#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 10491#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 10492#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 10493#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 10494#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 10495#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:37,718 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:45:37,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:45:37,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:45:37,718 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-23 13:45:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:38,774 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 13:45:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:45:38,774 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-23 13:45:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:38,775 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:45:38,775 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 13:45:38,776 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:45:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 13:45:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 13:45:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 13:45:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 13:45:38,784 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-23 13:45:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:38,784 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 13:45:38,784 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:45:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 13:45:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:45:38,785 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:38,785 INFO L357 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-23 13:45:38,785 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:38,785 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-23 13:45:38,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:39,070 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:39,070 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:45:39,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:39,071 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:45:39,071 INFO L185 omatonBuilderFactory]: Interpolants [10950#true, 10951#false, 10952#(<= ULTIMATE.start_main_~i~5 0), 10953#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 10954#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 10955#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 10956#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 10957#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 10958#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 10959#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 10960#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 10961#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 10962#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 10963#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 10964#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 10965#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 10966#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 10967#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 10968#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 10969#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 10970#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 10971#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 10972#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 10973#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 10974#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 10975#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 10976#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 10977#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 10978#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 10979#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 10980#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 10981#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 10982#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 10983#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 10984#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 10985#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 10986#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 10987#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 10988#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 10989#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 10990#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 10991#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 10992#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 10993#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 10994#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:39,072 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:45:39,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:45:39,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:45:39,072 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-23 13:45:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:40,081 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 13:45:40,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:45:40,081 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-23 13:45:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:40,082 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:45:40,082 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 13:45:40,083 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:45:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 13:45:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 13:45:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 13:45:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 13:45:40,091 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-23 13:45:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:40,091 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 13:45:40,091 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:45:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 13:45:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 13:45:40,092 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:40,092 INFO L357 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-23 13:45:40,092 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-23 13:45:40,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:40,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:40,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:45:40,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:40,374 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:45:40,375 INFO L185 omatonBuilderFactory]: Interpolants [11456#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 11457#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 11458#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 11459#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 11460#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 11461#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 11462#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 11463#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 11464#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 11465#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 11466#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 11467#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 11468#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 11469#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 11470#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 11471#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 11472#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 11473#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 11474#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 11475#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 11476#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 11477#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 11478#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 11479#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 11480#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 11481#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 11482#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 11483#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 11484#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 11485#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 11486#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 11487#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 11488#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 11489#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 11490#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 11491#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 11492#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 11447#true, 11448#false, 11449#(<= ULTIMATE.start_main_~i~5 0), 11450#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 11451#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 11452#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 11453#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 11454#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 11455#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:40,375 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:45:40,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:45:40,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:45:40,376 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-23 13:45:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:41,480 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 13:45:41,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:45:41,480 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-23 13:45:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:41,481 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:45:41,481 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 13:45:41,482 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:45:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 13:45:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 13:45:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 13:45:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 13:45:41,492 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-23 13:45:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:41,493 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 13:45:41,493 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:45:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 13:45:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 13:45:41,494 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:41,494 INFO L357 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-23 13:45:41,494 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-23 13:45:41,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:41,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:41,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:45:41,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:41,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:45:41,747 INFO L185 omatonBuilderFactory]: Interpolants [11968#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 11969#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 11970#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 11971#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 11972#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 11973#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 11974#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 11975#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 11976#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 11977#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 11978#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 11979#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 11980#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 11981#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 11982#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 11983#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 11984#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 11985#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 11986#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 11987#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 11988#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 11989#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 11990#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 11991#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 11992#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 11993#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 11994#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 11995#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 11996#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 11997#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 11998#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 11999#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 12000#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 12001#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 11955#true, 11956#false, 11957#(<= ULTIMATE.start_main_~i~5 0), 11958#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 11959#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 11960#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 11961#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 11962#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 11963#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 11964#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 11965#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 11966#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 11967#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:41,748 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:45:41,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:45:41,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:45:41,749 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-23 13:45:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:42,907 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 13:45:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:45:42,907 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-23 13:45:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:42,908 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:45:42,908 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 13:45:42,909 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:45:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 13:45:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 13:45:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:45:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 13:45:42,916 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-23 13:45:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:42,917 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 13:45:42,917 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:45:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 13:45:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 13:45:42,918 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:42,918 INFO L357 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-23 13:45:42,918 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:42,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-23 13:45:42,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:43,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:43,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:45:43,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:43,259 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:45:43,260 INFO L185 omatonBuilderFactory]: Interpolants [12480#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 12481#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 12482#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 12483#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 12484#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 12485#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 12486#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 12487#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 12488#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 12489#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 12490#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 12491#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 12492#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 12493#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 12494#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 12495#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 12496#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 12497#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 12498#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 12499#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 12500#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 12501#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 12502#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 12503#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 12504#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 12505#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 12506#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 12507#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 12508#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 12509#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 12510#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 12511#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 12512#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 12513#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 12514#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 12515#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 12516#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 12517#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 12518#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 12519#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 12520#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 12521#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 12474#true, 12475#false, 12476#(<= ULTIMATE.start_main_~i~5 0), 12477#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 12478#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 12479#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:43,260 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:45:43,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:45:43,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:45:43,261 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-23 13:45:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:44,377 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 13:45:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:45:44,377 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-23 13:45:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:44,378 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:45:44,378 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 13:45:44,380 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:45:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 13:45:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 13:45:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 13:45:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 13:45:44,388 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-23 13:45:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:44,388 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 13:45:44,388 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:45:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 13:45:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:45:44,389 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:44,389 INFO L357 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-23 13:45:44,389 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-23 13:45:44,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:44,698 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:44,698 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:45:44,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:44,698 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:45:44,699 INFO L185 omatonBuilderFactory]: Interpolants [13004#true, 13005#false, 13006#(<= ULTIMATE.start_main_~i~5 0), 13007#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 13008#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 13009#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 13010#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 13011#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 13012#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 13013#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 13014#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 13015#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 13016#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 13017#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 13018#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 13019#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 13020#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 13021#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 13022#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 13023#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 13024#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 13025#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 13026#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 13027#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 13028#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 13029#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 13030#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 13031#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 13032#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 13033#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 13034#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 13035#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 13036#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 13037#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 13038#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 13039#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 13040#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 13041#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 13042#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 13043#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 13044#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 13045#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 13046#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 13047#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 13048#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 13049#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 13050#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 13051#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 13052#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:44,699 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:45:44,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:45:44,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:45:44,700 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-23 13:45:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:45,949 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 13:45:45,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:45:45,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-23 13:45:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:45,950 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:45:45,950 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 13:45:45,951 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:45:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 13:45:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 13:45:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 13:45:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 13:45:45,956 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-23 13:45:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:45,957 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 13:45:45,957 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:45:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 13:45:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 13:45:45,957 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:45,957 INFO L357 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-23 13:45:45,958 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-23 13:45:45,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:46,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:46,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:45:46,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:46,266 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:45:46,266 INFO L185 omatonBuilderFactory]: Interpolants [13568#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 13569#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 13570#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 13571#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 13572#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 13573#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 13574#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 13575#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 13576#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 13577#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 13578#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 13579#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 13580#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 13581#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 13582#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 13583#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 13584#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 13585#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 13586#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 13587#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 13588#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 13589#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 13590#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 13591#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 13592#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 13593#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 13594#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 13545#true, 13546#false, 13547#(<= ULTIMATE.start_main_~i~5 0), 13548#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 13549#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 13550#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 13551#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 13552#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 13553#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 13554#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 13555#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 13556#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 13557#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 13558#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 13559#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 13560#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 13561#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 13562#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 13563#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 13564#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 13565#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 13566#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 13567#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:46,267 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:45:46,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:45:46,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:45:46,267 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-23 13:45:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:47,504 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 13:45:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:45:47,504 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-23 13:45:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:47,505 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:45:47,505 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:45:47,506 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:45:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:45:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 13:45:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 13:45:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 13:45:47,512 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-23 13:45:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:47,512 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 13:45:47,512 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:45:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 13:45:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 13:45:47,513 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:47,513 INFO L357 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-23 13:45:47,513 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-23 13:45:47,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:47,823 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:47,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:45:47,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:47,823 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:45:47,824 INFO L185 omatonBuilderFactory]: Interpolants [14097#true, 14098#false, 14099#(<= ULTIMATE.start_main_~i~5 0), 14100#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 14101#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 14102#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 14103#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 14104#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 14105#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 14106#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 14107#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 14108#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 14109#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 14110#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 14111#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 14112#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 14113#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 14114#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 14115#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 14116#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 14117#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 14118#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 14119#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 14120#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 14121#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 14122#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 14123#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 14124#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 14125#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 14126#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 14127#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 14128#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 14129#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 14130#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 14131#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 14132#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 14133#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 14134#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 14135#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 14136#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 14137#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 14138#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 14139#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 14140#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 14141#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 14142#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 14143#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 14144#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 14145#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 14146#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 14147#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:47,824 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:45:47,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:45:47,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:45:47,825 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-23 13:45:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:49,200 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 13:45:49,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:45:49,200 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-23 13:45:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:49,201 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:45:49,201 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 13:45:49,202 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:45:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 13:45:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 13:45:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 13:45:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 13:45:49,209 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-23 13:45:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:49,209 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 13:45:49,209 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:45:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 13:45:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 13:45:49,210 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:49,210 INFO L357 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-23 13:45:49,210 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-23 13:45:49,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:49,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:49,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:45:49,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:49,502 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:45:49,502 INFO L185 omatonBuilderFactory]: Interpolants [14660#true, 14661#false, 14662#(<= ULTIMATE.start_main_~i~5 0), 14663#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 14664#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 14665#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 14666#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 14667#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 14668#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 14669#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 14670#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 14671#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 14672#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 14673#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 14674#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 14675#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 14676#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 14677#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 14678#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 14679#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 14680#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 14681#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 14682#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 14683#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 14684#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 14685#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 14686#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 14687#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 14688#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 14689#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 14690#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 14691#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 14692#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 14693#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 14694#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 14695#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 14696#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 14697#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 14698#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 14699#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 14700#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 14701#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 14702#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 14703#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 14704#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 14705#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 14706#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 14707#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 14708#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 14709#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 14710#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 14711#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:49,502 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:45:49,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:45:49,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:45:49,503 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-23 13:45:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:50,936 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 13:45:50,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:45:50,936 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-23 13:45:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:50,937 INFO L225 Difference]: With dead ends: 107 [2018-07-23 13:45:50,937 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 13:45:50,938 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:45:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 13:45:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 13:45:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 13:45:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 13:45:50,943 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-23 13:45:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:50,944 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 13:45:50,944 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:45:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 13:45:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 13:45:50,944 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:50,944 INFO L357 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-23 13:45:50,944 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-23 13:45:50,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:51,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:51,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:45:51,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:51,257 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:45:51,258 INFO L185 omatonBuilderFactory]: Interpolants [15234#true, 15235#false, 15236#(<= ULTIMATE.start_main_~i~5 0), 15237#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 15238#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 15239#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 15240#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 15241#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 15242#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 15243#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 15244#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 15245#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 15246#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 15247#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 15248#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 15249#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 15250#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 15251#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 15252#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 15253#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 15254#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 15255#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 15256#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 15257#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 15258#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 15259#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 15260#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 15261#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 15262#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 15263#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 15264#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 15265#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 15266#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 15267#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 15268#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 15269#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 15270#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 15271#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 15272#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 15273#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 15274#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 15275#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 15276#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 15277#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 15278#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 15279#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 15280#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 15281#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 15282#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 15283#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 15284#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 15285#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 15286#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:51,258 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:45:51,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:45:51,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:45:51,259 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-23 13:45:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:52,974 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-23 13:45:52,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:45:52,975 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-23 13:45:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:52,975 INFO L225 Difference]: With dead ends: 109 [2018-07-23 13:45:52,976 INFO L226 Difference]: Without dead ends: 107 [2018-07-23 13:45:52,977 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:45:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-23 13:45:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-23 13:45:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-23 13:45:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-23 13:45:52,985 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-23 13:45:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:52,986 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-23 13:45:52,986 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:45:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-23 13:45:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 13:45:52,986 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:52,987 INFO L357 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-23 13:45:52,987 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-23 13:45:52,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:53,299 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:53,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:45:53,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:53,299 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:45:53,300 INFO L185 omatonBuilderFactory]: Interpolants [15872#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 15819#true, 15820#false, 15821#(<= ULTIMATE.start_main_~i~5 0), 15822#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 15823#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 15824#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 15825#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 15826#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 15827#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 15828#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 15829#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 15830#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 15831#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 15832#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 15833#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 15834#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 15835#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 15836#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 15837#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 15838#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 15839#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 15840#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 15841#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 15842#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 15843#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 15844#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 15845#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 15846#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 15847#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 15848#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 15849#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 15850#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 15851#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 15852#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 15853#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 15854#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 15855#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 15856#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 15857#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 15858#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 15859#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 15860#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 15861#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 15862#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 15863#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 15864#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 15865#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 15866#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 15867#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 15868#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 15869#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 15870#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 15871#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:53,301 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:45:53,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:45:53,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:45:53,301 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-23 13:45:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:54,997 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-23 13:45:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:45:54,998 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-23 13:45:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:54,999 INFO L225 Difference]: With dead ends: 111 [2018-07-23 13:45:54,999 INFO L226 Difference]: Without dead ends: 109 [2018-07-23 13:45:55,000 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:45:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-23 13:45:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-23 13:45:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 13:45:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-23 13:45:55,006 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-23 13:45:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:55,006 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-23 13:45:55,007 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:45:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-23 13:45:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 13:45:55,007 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:55,007 INFO L357 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-23 13:45:55,007 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-23 13:45:55,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:55,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:55,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:45:55,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:55,319 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:45:55,319 INFO L185 omatonBuilderFactory]: Interpolants [16415#true, 16416#false, 16417#(<= ULTIMATE.start_main_~i~5 0), 16418#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 16419#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 16420#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 16421#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 16422#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 16423#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 16424#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 16425#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 16426#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 16427#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 16428#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 16429#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 16430#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 16431#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 16432#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 16433#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 16434#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 16435#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 16436#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 16437#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 16438#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 16439#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 16440#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 16441#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 16442#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 16443#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 16444#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 16445#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 16446#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 16447#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 16448#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 16449#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 16450#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 16451#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 16452#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 16453#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 16454#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 16455#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 16456#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 16457#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 16458#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 16459#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 16460#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 16461#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 16462#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 16463#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 16464#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 16465#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 16466#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 16467#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 16468#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 16469#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:55,320 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:45:55,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:45:55,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:45:55,320 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-23 13:45:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:56,930 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-23 13:45:56,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:45:56,931 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-23 13:45:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:56,931 INFO L225 Difference]: With dead ends: 113 [2018-07-23 13:45:56,931 INFO L226 Difference]: Without dead ends: 111 [2018-07-23 13:45:56,932 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:45:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-23 13:45:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-23 13:45:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-23 13:45:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-23 13:45:56,938 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-23 13:45:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:56,938 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-23 13:45:56,938 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:45:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-23 13:45:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-23 13:45:56,939 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:56,939 INFO L357 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-23 13:45:56,939 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-23 13:45:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:57,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:57,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:45:57,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:57,247 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:45:57,247 INFO L185 omatonBuilderFactory]: Interpolants [17024#(<= ULTIMATE.start_main_~i~5 0), 17025#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 17026#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 17027#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 17028#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 17029#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 17030#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 17031#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 17032#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 17033#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 17034#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 17035#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 17036#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 17037#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 17038#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 17039#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 17040#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 17041#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 17042#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 17043#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 17044#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 17045#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 17046#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 17047#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 17048#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 17049#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 17050#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 17051#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 17052#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 17053#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 17054#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 17055#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 17056#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 17057#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 17058#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 17059#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 17060#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 17061#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 17062#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 17063#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 17064#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 17065#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 17066#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 17067#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 17068#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 17069#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 17070#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 17071#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 17072#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 17073#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 17074#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 17075#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 17076#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 17077#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 17022#true, 17023#false] [2018-07-23 13:45:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:57,248 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:45:57,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:45:57,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:45:57,249 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-23 13:45:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:59,137 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-23 13:45:59,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:45:59,137 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-23 13:45:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:59,138 INFO L225 Difference]: With dead ends: 115 [2018-07-23 13:45:59,138 INFO L226 Difference]: Without dead ends: 113 [2018-07-23 13:45:59,139 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:45:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-23 13:45:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-23 13:45:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 13:45:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-23 13:45:59,144 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-23 13:45:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:59,145 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-23 13:45:59,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:45:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-23 13:45:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 13:45:59,145 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:59,145 INFO L357 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-23 13:45:59,145 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-23 13:45:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:59,486 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:59,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:45:59,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:59,487 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:45:59,487 INFO L185 omatonBuilderFactory]: Interpolants [17664#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 17665#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 17666#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 17667#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 17668#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 17669#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 17670#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 17671#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 17672#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 17673#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 17674#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 17675#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 17676#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 17677#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 17678#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 17679#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 17680#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 17681#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 17682#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 17683#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 17684#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 17685#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 17686#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 17687#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 17688#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 17689#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 17690#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 17691#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 17692#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 17693#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 17694#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 17695#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 17696#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 17640#true, 17641#false, 17642#(<= ULTIMATE.start_main_~i~5 0), 17643#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 17644#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 17645#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 17646#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 17647#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 17648#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 17649#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 17650#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 17651#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 17652#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 17653#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 17654#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 17655#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 17656#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 17657#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 17658#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 17659#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 17660#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 17661#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 17662#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 17663#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5))] [2018-07-23 13:45:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:59,488 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:45:59,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:45:59,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:45:59,489 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-23 13:46:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:01,277 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-23 13:46:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:46:01,277 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-23 13:46:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:01,278 INFO L225 Difference]: With dead ends: 117 [2018-07-23 13:46:01,278 INFO L226 Difference]: Without dead ends: 115 [2018-07-23 13:46:01,279 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:46:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-23 13:46:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-23 13:46:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-23 13:46:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-23 13:46:01,287 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-23 13:46:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:01,287 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-23 13:46:01,287 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:46:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-23 13:46:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-23 13:46:01,288 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:01,288 INFO L357 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-23 13:46:01,288 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-23 13:46:01,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:01,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:01,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:46:01,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:01,757 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:46:01,757 INFO L185 omatonBuilderFactory]: Interpolants [18304#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 18305#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 18306#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 18307#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 18308#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 18309#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 18310#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 18311#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 18312#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 18313#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 18314#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 18315#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 18316#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 18317#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 18318#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 18319#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 18320#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 18321#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 18322#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 18323#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 18324#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 18325#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 18326#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 18269#true, 18270#false, 18271#(<= ULTIMATE.start_main_~i~5 0), 18272#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 18273#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 18274#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 18275#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 18276#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 18277#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 18278#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 18279#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 18280#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 18281#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 18282#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 18283#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 18284#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 18285#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 18286#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 18287#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 18288#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 18289#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 18290#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 18291#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 18292#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 18293#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 18294#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 18295#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 18296#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 18297#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 18298#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 18299#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 18300#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 18301#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 18302#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 18303#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:01,758 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:46:01,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:46:01,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:46:01,759 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-23 13:46:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:04,108 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-23 13:46:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:46:04,108 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-23 13:46:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:04,109 INFO L225 Difference]: With dead ends: 119 [2018-07-23 13:46:04,110 INFO L226 Difference]: Without dead ends: 117 [2018-07-23 13:46:04,111 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:46:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-23 13:46:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-23 13:46:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-23 13:46:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-23 13:46:04,116 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-23 13:46:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:04,117 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-23 13:46:04,117 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:46:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-23 13:46:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 13:46:04,118 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:04,118 INFO L357 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-23 13:46:04,118 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-23 13:46:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:04,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:04,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:46:04,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:04,587 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:46:04,588 INFO L185 omatonBuilderFactory]: Interpolants [18944#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 18945#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 18946#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 18947#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 18948#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 18949#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 18950#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 18951#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 18952#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 18953#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 18954#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 18955#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 18956#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 18957#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 18958#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 18959#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 18960#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 18961#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 18962#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 18963#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 18964#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 18965#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 18966#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 18967#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 18909#true, 18910#false, 18911#(<= ULTIMATE.start_main_~i~5 0), 18912#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 18913#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 18914#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 18915#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 18916#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 18917#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 18918#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 18919#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 18920#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 18921#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 18922#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 18923#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 18924#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 18925#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 18926#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 18927#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 18928#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 18929#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 18930#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 18931#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 18932#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 18933#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 18934#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 18935#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 18936#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 18937#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 18938#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 18939#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 18940#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 18941#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 18942#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 18943#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:04,588 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:46:04,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:46:04,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:46:04,589 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-23 13:46:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:06,439 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-23 13:46:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:46:06,439 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-23 13:46:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:06,440 INFO L225 Difference]: With dead ends: 121 [2018-07-23 13:46:06,440 INFO L226 Difference]: Without dead ends: 119 [2018-07-23 13:46:06,442 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:46:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-23 13:46:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-23 13:46:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 13:46:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-23 13:46:06,449 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-23 13:46:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:06,449 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-23 13:46:06,449 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:46:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-23 13:46:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-23 13:46:06,450 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:06,450 INFO L357 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-23 13:46:06,450 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-23 13:46:06,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:06,800 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:06,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:46:06,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:06,800 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:46:06,801 INFO L185 omatonBuilderFactory]: Interpolants [19584#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 19585#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 19586#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 19587#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 19588#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 19589#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 19590#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 19591#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 19592#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 19593#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 19594#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 19595#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 19596#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 19597#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 19598#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 19599#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 19600#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 19601#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 19602#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 19603#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 19604#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 19605#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 19606#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 19607#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 19608#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 19609#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 19610#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 19611#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 19612#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 19613#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 19614#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 19615#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 19616#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 19617#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 19618#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 19619#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 19560#true, 19561#false, 19562#(<= ULTIMATE.start_main_~i~5 0), 19563#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 19564#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 19565#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 19566#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 19567#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 19568#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 19569#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 19570#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 19571#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 19572#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 19573#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 19574#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 19575#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 19576#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 19577#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 19578#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 19579#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 19580#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 19581#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 19582#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 19583#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:06,801 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:46:06,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:46:06,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:46:06,802 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-23 13:46:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:09,010 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-23 13:46:09,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:46:09,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-23 13:46:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:09,011 INFO L225 Difference]: With dead ends: 123 [2018-07-23 13:46:09,011 INFO L226 Difference]: Without dead ends: 121 [2018-07-23 13:46:09,012 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 13:46:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-23 13:46:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-23 13:46:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 13:46:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-23 13:46:09,019 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-23 13:46:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:09,019 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-23 13:46:09,019 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:46:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-23 13:46:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 13:46:09,019 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:09,020 INFO L357 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-23 13:46:09,020 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-23 13:46:09,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:09,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:09,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:46:09,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:09,588 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:46:09,588 INFO L185 omatonBuilderFactory]: Interpolants [20224#(<= ULTIMATE.start_main_~i~5 0), 20225#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 20226#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 20227#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 20228#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 20229#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 20230#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 20231#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 20232#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 20233#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 20234#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 20235#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 20236#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 20237#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 20238#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 20239#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 20240#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 20241#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 20242#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 20243#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 20244#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 20245#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 20246#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 20247#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 20248#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 20249#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 20250#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 20251#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 20252#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 20253#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 20254#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 20255#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 20256#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 20257#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 20258#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 20259#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 20260#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 20261#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 20262#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 20263#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 20264#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 20265#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 20266#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 20267#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 20268#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 20269#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 20270#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 20271#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 20272#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 20273#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 20274#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 20275#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 20276#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 20277#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 20278#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 20279#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 20280#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 20281#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 20282#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 20222#true, 20223#false] [2018-07-23 13:46:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:09,589 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:46:09,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:46:09,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:46:09,590 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-23 13:46:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:11,817 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-23 13:46:11,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:46:11,817 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-23 13:46:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:11,818 INFO L225 Difference]: With dead ends: 125 [2018-07-23 13:46:11,818 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 13:46:11,820 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 13:46:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 13:46:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-23 13:46:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-23 13:46:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-23 13:46:11,827 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-23 13:46:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:11,827 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-23 13:46:11,828 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:46:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-23 13:46:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-23 13:46:11,828 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:11,829 INFO L357 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-23 13:46:11,829 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:11,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-23 13:46:11,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:12,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:12,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:46:12,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:12,289 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:46:12,289 INFO L185 omatonBuilderFactory]: Interpolants [20895#true, 20896#false, 20897#(<= ULTIMATE.start_main_~i~5 0), 20898#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 20899#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 20900#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 20901#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 20902#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 20903#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 20904#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 20905#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 20906#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 20907#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 20908#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 20909#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 20910#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 20911#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 20912#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 20913#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 20914#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 20915#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 20916#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 20917#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 20918#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 20919#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 20920#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 20921#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 20922#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 20923#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 20924#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 20925#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 20926#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 20927#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 20928#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 20929#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 20930#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 20931#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 20932#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 20933#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 20934#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 20935#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 20936#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 20937#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 20938#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 20939#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 20940#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 20941#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 20942#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 20943#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 20944#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 20945#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 20946#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 20947#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 20948#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 20949#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 20950#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 20951#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 20952#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 20953#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 20954#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 20955#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 20956#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:12,289 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:46:12,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:46:12,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:46:12,290 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-23 13:46:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:14,824 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-23 13:46:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:46:14,824 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-23 13:46:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:14,825 INFO L225 Difference]: With dead ends: 127 [2018-07-23 13:46:14,825 INFO L226 Difference]: Without dead ends: 125 [2018-07-23 13:46:14,827 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 13:46:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-23 13:46:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-23 13:46:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 13:46:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-23 13:46:14,835 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-23 13:46:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:14,836 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-23 13:46:14,836 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:46:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-23 13:46:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 13:46:14,836 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:14,837 INFO L357 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-23 13:46:14,837 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:14,837 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-23 13:46:14,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:15,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:15,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:46:15,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:15,350 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:46:15,351 INFO L185 omatonBuilderFactory]: Interpolants [21632#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 21633#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 21634#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 21635#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 21636#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 21637#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 21638#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 21639#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 21640#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 21641#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 21579#true, 21580#false, 21581#(<= ULTIMATE.start_main_~i~5 0), 21582#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 21583#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 21584#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 21585#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 21586#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 21587#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 21588#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 21589#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 21590#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 21591#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 21592#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 21593#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 21594#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 21595#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 21596#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 21597#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 21598#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 21599#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 21600#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 21601#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 21602#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 21603#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 21604#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 21605#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 21606#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 21607#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 21608#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 21609#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 21610#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 21611#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 21612#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 21613#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 21614#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 21615#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 21616#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 21617#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 21618#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 21619#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 21620#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 21621#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 21622#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 21623#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 21624#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 21625#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 21626#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 21627#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 21628#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 21629#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 21630#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 21631#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:15,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:46:15,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:46:15,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:46:15,352 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-23 13:46:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:18,158 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-23 13:46:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:46:18,158 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-23 13:46:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:18,159 INFO L225 Difference]: With dead ends: 129 [2018-07-23 13:46:18,159 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 13:46:18,160 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 13:46:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 13:46:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-23 13:46:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 13:46:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-23 13:46:18,167 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-23 13:46:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:18,167 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-23 13:46:18,167 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:46:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-23 13:46:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-23 13:46:18,168 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:18,168 INFO L357 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-23 13:46:18,168 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:18,169 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-23 13:46:18,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:18,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:18,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:46:18,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:18,679 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:46:18,679 INFO L185 omatonBuilderFactory]: Interpolants [22274#true, 22275#false, 22276#(<= ULTIMATE.start_main_~i~5 0), 22277#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 22278#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 22279#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 22280#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 22281#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 22282#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 22283#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 22284#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 22285#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 22286#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 22287#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 22288#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 22289#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 22290#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 22291#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 22292#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 22293#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 22294#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 22295#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 22296#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 22297#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 22298#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 22299#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 22300#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 22301#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 22302#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 22303#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 22304#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 22305#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 22306#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 22307#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 22308#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 22309#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 22310#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 22311#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 22312#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 22313#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 22314#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 22315#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 22316#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 22317#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 22318#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 22319#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 22320#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 22321#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 22322#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 22323#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 22324#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 22325#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 22326#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 22327#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 22328#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 22329#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 22330#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 22331#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 22332#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 22333#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 22334#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 22335#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 22336#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 22337#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:18,680 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:46:18,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:46:18,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:46:18,681 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-23 13:46:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:21,367 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-23 13:46:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:46:21,367 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-23 13:46:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:21,368 INFO L225 Difference]: With dead ends: 131 [2018-07-23 13:46:21,368 INFO L226 Difference]: Without dead ends: 129 [2018-07-23 13:46:21,369 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 13:46:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-23 13:46:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-23 13:46:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 13:46:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-23 13:46:21,379 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-23 13:46:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:21,379 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-23 13:46:21,379 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:46:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-23 13:46:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 13:46:21,383 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:21,383 INFO L357 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-23 13:46:21,383 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:21,383 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-23 13:46:21,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:22,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:46:22,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:22,016 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:46:22,017 INFO L185 omatonBuilderFactory]: Interpolants [23040#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 23041#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 23042#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 23043#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 23044#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 22980#true, 22981#false, 22982#(<= ULTIMATE.start_main_~i~5 0), 22983#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 22984#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 22985#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 22986#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 22987#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 22988#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 22989#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 22990#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 22991#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 22992#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 22993#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 22994#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 22995#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 22996#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 22997#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 22998#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 22999#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 23000#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 23001#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 23002#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 23003#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 23004#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 23005#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 23006#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 23007#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 23008#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 23009#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 23010#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 23011#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 23012#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 23013#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 23014#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 23015#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 23016#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 23017#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 23018#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 23019#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 23020#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 23021#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 23022#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 23023#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 23024#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 23025#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 23026#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 23027#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 23028#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 23029#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 23030#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 23031#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 23032#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 23033#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 23034#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 23035#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 23036#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 23037#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 23038#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 23039#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,017 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:46:22,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:46:22,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:46:22,018 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-23 13:46:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:24,824 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-23 13:46:24,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:46:24,825 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-23 13:46:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:24,826 INFO L225 Difference]: With dead ends: 133 [2018-07-23 13:46:24,826 INFO L226 Difference]: Without dead ends: 131 [2018-07-23 13:46:24,827 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 13:46:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-23 13:46:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-23 13:46:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-23 13:46:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-23 13:46:24,836 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-23 13:46:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:24,837 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-23 13:46:24,837 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:46:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-23 13:46:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 13:46:24,838 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:24,838 INFO L357 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-23 13:46:24,840 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-23 13:46:24,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:25,394 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:25,394 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:46:25,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:25,395 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:46:25,395 INFO L185 omatonBuilderFactory]: Interpolants [23697#true, 23698#false, 23699#(<= ULTIMATE.start_main_~i~5 0), 23700#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 23701#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 23702#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 23703#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 23704#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 23705#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 23706#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 23707#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 23708#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 23709#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 23710#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 23711#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 23712#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 23713#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 23714#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 23715#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 23716#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 23717#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 23718#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 23719#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 23720#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 23721#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 23722#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 23723#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 23724#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 23725#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 23726#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 23727#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 23728#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 23729#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 23730#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 23731#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 23732#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 23733#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 23734#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 23735#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 23736#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 23737#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 23738#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 23739#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 23740#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 23741#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 23742#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 23743#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 23744#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 23745#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 23746#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 23747#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 23748#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 23749#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 23750#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 23751#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 23752#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 23753#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 23754#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 23755#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 23756#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 23757#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 23758#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 23759#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 23760#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 23761#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 23762#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:25,396 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:46:25,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:46:25,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:46:25,397 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-23 13:46:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:28,095 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-23 13:46:28,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:46:28,096 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-23 13:46:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:28,097 INFO L225 Difference]: With dead ends: 135 [2018-07-23 13:46:28,097 INFO L226 Difference]: Without dead ends: 133 [2018-07-23 13:46:28,099 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:46:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-23 13:46:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-23 13:46:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 13:46:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-23 13:46:28,110 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-23 13:46:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:28,110 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-23 13:46:28,110 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:46:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-23 13:46:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 13:46:28,111 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:28,111 INFO L357 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-23 13:46:28,112 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-23 13:46:28,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:28,719 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:28,719 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:46:28,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:28,720 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:46:28,720 INFO L185 omatonBuilderFactory]: Interpolants [24448#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 24449#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 24450#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 24451#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 24452#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 24453#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 24454#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 24455#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 24456#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 24457#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 24458#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 24459#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 24460#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 24461#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 24462#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 24463#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 24464#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 24465#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 24466#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 24467#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 24468#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 24469#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 24470#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 24471#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 24472#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 24473#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 24474#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 24475#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 24476#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 24477#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 24478#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 24479#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 24480#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 24481#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 24482#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 24483#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 24484#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 24485#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 24486#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 24487#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 24488#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 24489#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 24490#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 24491#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 24425#true, 24426#false, 24427#(<= ULTIMATE.start_main_~i~5 0), 24428#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 24429#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 24430#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 24431#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 24432#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 24433#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 24434#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 24435#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 24436#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 24437#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 24438#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 24439#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 24440#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 24441#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 24442#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 24443#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 24444#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 24445#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 24446#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 24447#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:28,721 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:46:28,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:46:28,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:46:28,722 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-23 13:46:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:31,481 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-23 13:46:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:46:31,482 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-23 13:46:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:31,482 INFO L225 Difference]: With dead ends: 137 [2018-07-23 13:46:31,483 INFO L226 Difference]: Without dead ends: 135 [2018-07-23 13:46:31,484 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 13:46:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-23 13:46:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-23 13:46:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-23 13:46:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-23 13:46:31,493 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-23 13:46:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:31,494 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-23 13:46:31,494 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:46:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-23 13:46:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-23 13:46:31,494 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:31,495 INFO L357 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-23 13:46:31,495 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:31,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-23 13:46:31,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:32,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:32,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:46:32,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:32,039 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:46:32,040 INFO L185 omatonBuilderFactory]: Interpolants [25216#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 25217#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 25218#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 25219#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 25220#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 25221#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 25222#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 25223#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 25224#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 25225#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 25226#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 25227#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 25228#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 25229#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 25230#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 25231#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 25164#true, 25165#false, 25166#(<= ULTIMATE.start_main_~i~5 0), 25167#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 25168#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 25169#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 25170#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 25171#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 25172#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 25173#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 25174#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 25175#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 25176#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 25177#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 25178#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 25179#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 25180#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 25181#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 25182#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 25183#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 25184#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 25185#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 25186#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 25187#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 25188#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 25189#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 25190#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 25191#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 25192#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 25193#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 25194#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 25195#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 25196#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 25197#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 25198#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 25199#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 25200#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 25201#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 25202#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 25203#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 25204#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 25205#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 25206#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 25207#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 25208#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 25209#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 25210#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 25211#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 25212#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 25213#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 25214#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 25215#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:32,040 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:46:32,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:46:32,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:46:32,041 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-23 13:46:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:35,170 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-23 13:46:35,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:46:35,170 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-23 13:46:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:35,171 INFO L225 Difference]: With dead ends: 139 [2018-07-23 13:46:35,172 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 13:46:35,173 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 13:46:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 13:46:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-23 13:46:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 13:46:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-23 13:46:35,182 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-23 13:46:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:35,183 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-23 13:46:35,183 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:46:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-23 13:46:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 13:46:35,184 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:35,184 INFO L357 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-23 13:46:35,184 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:35,184 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-23 13:46:35,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:35,785 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:35,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:46:35,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:35,785 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:46:35,786 INFO L185 omatonBuilderFactory]: Interpolants [25914#true, 25915#false, 25916#(<= ULTIMATE.start_main_~i~5 0), 25917#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 25918#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 25919#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 25920#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 25921#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 25922#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 25923#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 25924#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 25925#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 25926#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 25927#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 25928#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 25929#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 25930#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 25931#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 25932#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 25933#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 25934#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 25935#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 25936#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 25937#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 25938#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 25939#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 25940#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 25941#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 25942#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 25943#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 25944#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 25945#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 25946#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 25947#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 25948#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 25949#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 25950#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 25951#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 25952#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 25953#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 25954#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 25955#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 25956#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 25957#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 25958#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 25959#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 25960#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 25961#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 25962#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 25963#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 25964#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 25965#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 25966#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 25967#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 25968#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 25969#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 25970#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 25971#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 25972#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 25973#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 25974#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 25975#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 25976#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 25977#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 25978#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 25979#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 25980#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 25981#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 25982#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:35,786 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:46:35,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:46:35,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:46:35,787 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-23 13:46:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:38,698 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-23 13:46:38,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:46:38,699 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-23 13:46:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:38,699 INFO L225 Difference]: With dead ends: 141 [2018-07-23 13:46:38,700 INFO L226 Difference]: Without dead ends: 139 [2018-07-23 13:46:38,701 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-07-23 13:46:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-23 13:46:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-23 13:46:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-23 13:46:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-23 13:46:38,710 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-23 13:46:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:38,710 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-23 13:46:38,710 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:46:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-23 13:46:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-23 13:46:38,711 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:38,711 INFO L357 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-23 13:46:38,712 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:38,712 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-23 13:46:38,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:39,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:39,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:46:39,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:39,267 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:46:39,268 INFO L185 omatonBuilderFactory]: Interpolants [26675#true, 26676#false, 26677#(<= ULTIMATE.start_main_~i~5 0), 26678#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 26679#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 26680#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 26681#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 26682#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 26683#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 26684#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 26685#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 26686#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 26687#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 26688#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 26689#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 26690#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 26691#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 26692#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 26693#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 26694#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 26695#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 26696#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 26697#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 26698#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 26699#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 26700#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 26701#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 26702#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 26703#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 26704#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 26705#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 26706#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 26707#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 26708#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 26709#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 26710#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 26711#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 26712#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 26713#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 26714#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 26715#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 26716#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 26717#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 26718#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 26719#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 26720#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 26721#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 26722#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 26723#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 26724#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 26725#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 26726#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 26727#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 26728#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 26729#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 26730#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 26731#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 26732#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 26733#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 26734#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 26735#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 26736#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 26737#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 26738#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 26739#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 26740#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 26741#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 26742#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 26743#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 26744#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:39,268 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:46:39,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:46:39,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:46:39,269 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-23 13:46:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:42,407 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-23 13:46:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:46:42,408 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-23 13:46:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:42,409 INFO L225 Difference]: With dead ends: 143 [2018-07-23 13:46:42,409 INFO L226 Difference]: Without dead ends: 141 [2018-07-23 13:46:42,411 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-07-23 13:46:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-23 13:46:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-23 13:46:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-23 13:46:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-23 13:46:42,421 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-23 13:46:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:42,421 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-23 13:46:42,421 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:46:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-23 13:46:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 13:46:42,422 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:42,422 INFO L357 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-23 13:46:42,422 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-23 13:46:42,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:43,082 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:43,083 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:46:43,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:43,083 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:46:43,083 INFO L185 omatonBuilderFactory]: Interpolants [27447#true, 27448#false, 27449#(<= ULTIMATE.start_main_~i~5 0), 27450#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 27451#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 27452#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 27453#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 27454#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 27455#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 27456#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 27457#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 27458#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 27459#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 27460#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 27461#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 27462#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 27463#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 27464#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 27465#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 27466#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 27467#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 27468#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 27469#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 27470#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 27471#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 27472#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 27473#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 27474#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 27475#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 27476#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 27477#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 27478#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 27479#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 27480#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 27481#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 27482#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 27483#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 27484#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 27485#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 27486#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 27487#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 27488#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 27489#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 27490#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 27491#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 27492#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 27493#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 27494#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 27495#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 27496#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 27497#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 27498#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 27499#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 27500#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 27501#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 27502#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 27503#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 27504#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 27505#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 27506#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 27507#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 27508#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 27509#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 27510#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 27511#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 27512#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 27513#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 27514#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 27515#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 27516#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 27517#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:43,084 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:46:43,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:46:43,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:46:43,084 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-23 13:46:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:46,230 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-23 13:46:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:46:46,231 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-23 13:46:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:46,231 INFO L225 Difference]: With dead ends: 145 [2018-07-23 13:46:46,232 INFO L226 Difference]: Without dead ends: 143 [2018-07-23 13:46:46,233 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-07-23 13:46:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-23 13:46:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-23 13:46:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-23 13:46:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-23 13:46:46,239 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-23 13:46:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:46,240 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-23 13:46:46,240 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:46:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-23 13:46:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-23 13:46:46,240 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:46,240 INFO L357 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-23 13:46:46,241 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:46,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-23 13:46:46,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:46,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:46,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:46:46,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:46,863 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:46:46,863 INFO L185 omatonBuilderFactory]: Interpolants [28288#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 28289#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 28290#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 28291#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 28292#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 28293#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 28294#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 28295#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 28296#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 28297#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 28298#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 28299#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 28300#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 28301#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 28230#true, 28231#false, 28232#(<= ULTIMATE.start_main_~i~5 0), 28233#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 28234#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 28235#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 28236#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 28237#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 28238#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 28239#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 28240#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 28241#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 28242#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 28243#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 28244#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 28245#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 28246#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 28247#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 28248#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 28249#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 28250#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 28251#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 28252#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 28253#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 28254#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 28255#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 28256#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 28257#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 28258#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 28259#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 28260#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 28261#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 28262#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 28263#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 28264#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 28265#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 28266#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 28267#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 28268#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 28269#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 28270#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 28271#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 28272#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 28273#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 28274#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 28275#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 28276#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 28277#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 28278#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 28279#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 28280#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 28281#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 28282#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 28283#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 28284#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 28285#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 28286#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 28287#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:46,864 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:46:46,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:46:46,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:46:46,864 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-23 13:46:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:50,374 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-23 13:46:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:46:50,374 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-23 13:46:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:50,375 INFO L225 Difference]: With dead ends: 147 [2018-07-23 13:46:50,375 INFO L226 Difference]: Without dead ends: 145 [2018-07-23 13:46:50,377 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-07-23 13:46:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-23 13:46:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-23 13:46:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-23 13:46:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-23 13:46:50,387 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-23 13:46:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:50,387 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-23 13:46:50,387 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:46:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-23 13:46:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 13:46:50,388 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:50,388 INFO L357 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-23 13:46:50,388 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-23 13:46:50,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:51,176 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:51,176 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:46:51,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:51,176 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:46:51,176 INFO L185 omatonBuilderFactory]: Interpolants [29056#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 29057#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 29058#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 29059#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 29060#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 29061#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 29062#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 29063#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 29064#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 29065#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 29066#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 29067#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 29068#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 29069#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 29070#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 29071#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 29072#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 29073#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 29074#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 29075#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 29076#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 29077#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 29078#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 29079#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 29080#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 29081#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 29082#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 29083#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 29084#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 29085#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 29086#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 29087#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 29088#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 29089#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 29090#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 29091#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 29092#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 29093#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 29094#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 29095#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 29096#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 29024#true, 29025#false, 29026#(<= ULTIMATE.start_main_~i~5 0), 29027#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 29028#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 29029#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 29030#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 29031#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 29032#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 29033#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 29034#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 29035#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 29036#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 29037#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 29038#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 29039#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 29040#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 29041#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 29042#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 29043#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 29044#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 29045#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 29046#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 29047#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 29048#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 29049#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 29050#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 29051#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 29052#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 29053#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 29054#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 29055#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:51,177 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:46:51,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:46:51,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:46:51,177 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-23 13:46:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:54,548 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-23 13:46:54,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:46:54,548 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-23 13:46:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:54,550 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:46:54,550 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 13:46:54,551 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:46:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 13:46:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-23 13:46:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-23 13:46:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-23 13:46:54,559 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-23 13:46:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:54,560 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-23 13:46:54,560 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:46:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-23 13:46:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-23 13:46:54,561 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:54,561 INFO L357 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-23 13:46:54,561 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-23 13:46:54,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:55,242 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:55,242 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:46:55,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:55,242 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:46:55,242 INFO L185 omatonBuilderFactory]: Interpolants [29829#true, 29830#false, 29831#(<= ULTIMATE.start_main_~i~5 0), 29832#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 29833#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 29834#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 29835#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 29836#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 29837#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 29838#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 29839#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 29840#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 29841#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 29842#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 29843#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 29844#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 29845#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 29846#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 29847#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 29848#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 29849#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 29850#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 29851#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 29852#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 29853#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 29854#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 29855#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 29856#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 29857#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 29858#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 29859#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 29860#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 29861#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 29862#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 29863#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 29864#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 29865#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 29866#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 29867#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 29868#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 29869#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 29870#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 29871#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 29872#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 29873#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 29874#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 29875#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 29876#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 29877#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 29878#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 29879#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 29880#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 29881#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 29882#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 29883#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 29884#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 29885#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 29886#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 29887#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 29888#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 29889#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 29890#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 29891#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 29892#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 29893#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 29894#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 29895#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 29896#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 29897#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 29898#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 29899#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 29900#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 29901#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 29902#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:55,243 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:46:55,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:46:55,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:46:55,244 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-23 13:46:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:59,343 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-23 13:46:59,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:46:59,343 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-23 13:46:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:59,344 INFO L225 Difference]: With dead ends: 151 [2018-07-23 13:46:59,344 INFO L226 Difference]: Without dead ends: 149 [2018-07-23 13:46:59,345 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-07-23 13:46:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-23 13:46:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-23 13:46:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 13:46:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-23 13:46:59,354 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-23 13:46:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:59,354 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-23 13:46:59,354 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:46:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-23 13:46:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 13:46:59,355 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:59,355 INFO L357 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-23 13:46:59,355 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-23 13:46:59,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:59,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:59,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:46:59,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:59,981 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:46:59,981 INFO L185 omatonBuilderFactory]: Interpolants [30645#true, 30646#false, 30647#(<= ULTIMATE.start_main_~i~5 0), 30648#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 30649#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 30650#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 30651#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 30652#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 30653#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 30654#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 30655#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 30656#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 30657#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 30658#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 30659#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 30660#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 30661#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 30662#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 30663#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 30664#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 30665#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 30666#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 30667#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 30668#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 30669#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 30670#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 30671#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 30672#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 30673#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 30674#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 30675#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 30676#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 30677#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 30678#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 30679#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 30680#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 30681#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 30682#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 30683#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 30684#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 30685#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 30686#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 30687#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 30688#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 30689#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 30690#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 30691#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 30692#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 30693#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 30694#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 30695#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 30696#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 30697#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 30698#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 30699#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 30700#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 30701#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 30702#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 30703#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 30704#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 30705#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 30706#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 30707#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 30708#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 30709#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 30710#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 30711#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 30712#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 30713#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 30714#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 30715#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 30716#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 30717#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 30718#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 30719#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:46:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:59,982 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:46:59,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:46:59,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:46:59,983 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-23 13:47:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:03,651 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-23 13:47:03,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:47:03,652 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-23 13:47:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:03,653 INFO L225 Difference]: With dead ends: 153 [2018-07-23 13:47:03,653 INFO L226 Difference]: Without dead ends: 151 [2018-07-23 13:47:03,654 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-07-23 13:47:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-23 13:47:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-23 13:47:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 13:47:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-23 13:47:03,663 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-23 13:47:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:03,664 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-23 13:47:03,664 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:47:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-23 13:47:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-23 13:47:03,665 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:03,665 INFO L357 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-23 13:47:03,665 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-23 13:47:03,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:04,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:04,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:47:04,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:04,323 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:47:04,323 INFO L185 omatonBuilderFactory]: Interpolants [31488#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 31489#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 31490#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 31491#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 31492#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 31493#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 31494#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 31495#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 31496#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 31497#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 31498#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 31499#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 31500#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 31501#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 31502#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 31503#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 31504#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 31505#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 31506#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 31507#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 31508#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 31509#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 31510#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 31511#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 31512#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 31513#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 31514#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 31515#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 31516#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 31517#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 31518#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 31519#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 31520#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 31521#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 31522#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 31523#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 31524#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 31525#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 31526#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 31527#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 31528#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 31529#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 31530#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 31531#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 31532#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 31533#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 31534#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 31535#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 31536#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 31537#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 31538#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 31539#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 31540#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 31541#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 31542#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 31543#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 31544#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 31545#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 31546#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 31547#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 31472#true, 31473#false, 31474#(<= ULTIMATE.start_main_~i~5 0), 31475#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 31476#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 31477#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 31478#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 31479#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 31480#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 31481#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 31482#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 31483#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 31484#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 31485#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 31486#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 31487#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:04,324 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:47:04,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:47:04,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:47:04,325 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-23 13:47:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:08,171 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-23 13:47:08,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:47:08,171 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-23 13:47:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:08,172 INFO L225 Difference]: With dead ends: 155 [2018-07-23 13:47:08,172 INFO L226 Difference]: Without dead ends: 153 [2018-07-23 13:47:08,173 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-07-23 13:47:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-23 13:47:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-23 13:47:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-23 13:47:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-23 13:47:08,183 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-23 13:47:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:08,183 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-23 13:47:08,183 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:47:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-23 13:47:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 13:47:08,184 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:08,184 INFO L357 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-23 13:47:08,185 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-23 13:47:08,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:08,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:08,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:47:08,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:08,877 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:47:08,877 INFO L185 omatonBuilderFactory]: Interpolants [32384#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 32385#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 32386#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 32310#true, 32311#false, 32312#(<= ULTIMATE.start_main_~i~5 0), 32313#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 32314#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 32315#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 32316#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 32317#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 32318#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 32319#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 32320#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 32321#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 32322#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 32323#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 32324#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 32325#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 32326#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 32327#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 32328#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 32329#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 32330#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 32331#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 32332#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 32333#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 32334#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 32335#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 32336#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 32337#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 32338#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 32339#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 32340#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 32341#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 32342#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 32343#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 32344#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 32345#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 32346#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 32347#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 32348#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 32349#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 32350#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 32351#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 32352#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 32353#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 32354#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 32355#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 32356#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 32357#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 32358#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 32359#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 32360#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 32361#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 32362#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 32363#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 32364#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 32365#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 32366#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 32367#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 32368#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 32369#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 32370#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 32371#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 32372#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 32373#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 32374#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 32375#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 32376#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 32377#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 32378#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 32379#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 32380#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 32381#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 32382#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 32383#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:08,878 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:47:08,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:47:08,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:47:08,879 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-23 13:47:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:12,874 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-23 13:47:12,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:47:12,874 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-23 13:47:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:12,875 INFO L225 Difference]: With dead ends: 157 [2018-07-23 13:47:12,875 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 13:47:12,876 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2018-07-23 13:47:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 13:47:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-23 13:47:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 13:47:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-23 13:47:12,885 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-23 13:47:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:12,886 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-23 13:47:12,886 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:47:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-23 13:47:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-23 13:47:12,887 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:12,887 INFO L357 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-23 13:47:12,887 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-23 13:47:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:13,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:13,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:47:13,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:13,577 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:47:13,578 INFO L185 omatonBuilderFactory]: Interpolants [33159#true, 33160#false, 33161#(<= ULTIMATE.start_main_~i~5 0), 33162#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 33163#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 33164#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 33165#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 33166#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 33167#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 33168#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 33169#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 33170#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 33171#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 33172#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 33173#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 33174#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 33175#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 33176#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 33177#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 33178#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 33179#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 33180#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 33181#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 33182#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 33183#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 33184#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 33185#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 33186#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 33187#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 33188#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 33189#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 33190#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 33191#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 33192#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 33193#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 33194#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 33195#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 33196#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 33197#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 33198#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 33199#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 33200#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 33201#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 33202#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 33203#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 33204#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 33205#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 33206#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 33207#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 33208#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 33209#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 33210#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 33211#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 33212#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 33213#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 33214#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 33215#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 33216#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 33217#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 33218#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 33219#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 33220#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 33221#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 33222#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 33223#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 33224#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 33225#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 33226#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 33227#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 33228#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 33229#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 33230#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 33231#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 33232#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 33233#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 33234#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 33235#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 33236#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:13,578 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:47:13,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:47:13,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:47:13,579 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-23 13:47:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:17,758 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-23 13:47:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:47:17,758 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-23 13:47:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:17,759 INFO L225 Difference]: With dead ends: 159 [2018-07-23 13:47:17,759 INFO L226 Difference]: Without dead ends: 157 [2018-07-23 13:47:17,760 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2018-07-23 13:47:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-23 13:47:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-23 13:47:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-23 13:47:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-23 13:47:17,771 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-23 13:47:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:17,771 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-23 13:47:17,771 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:47:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-23 13:47:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 13:47:17,772 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:17,772 INFO L357 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-23 13:47:17,772 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-23 13:47:17,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:18,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:18,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:47:18,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:18,639 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:47:18,639 INFO L185 omatonBuilderFactory]: Interpolants [34048#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 34049#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 34050#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 34051#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 34052#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 34053#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 34054#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 34055#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 34056#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 34057#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 34058#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 34059#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 34060#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 34061#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 34062#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 34063#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 34064#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 34065#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 34066#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 34067#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 34068#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 34069#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 34070#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 34071#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 34072#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 34073#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 34074#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 34075#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 34076#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 34077#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 34078#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 34079#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 34080#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 34081#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 34082#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 34083#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 34084#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 34085#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 34086#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 34087#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 34088#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 34089#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 34090#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 34091#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 34092#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 34093#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 34094#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 34095#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 34096#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 34097#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 34019#true, 34020#false, 34021#(<= ULTIMATE.start_main_~i~5 0), 34022#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 34023#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 34024#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 34025#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 34026#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 34027#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 34028#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 34029#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 34030#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 34031#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 34032#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 34033#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 34034#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 34035#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 34036#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 34037#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 34038#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 34039#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 34040#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 34041#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 34042#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 34043#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 34044#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 34045#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 34046#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 34047#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:18,640 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:47:18,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:47:18,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:47:18,641 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-23 13:47:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:23,093 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-23 13:47:23,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:47:23,094 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-23 13:47:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:23,094 INFO L225 Difference]: With dead ends: 161 [2018-07-23 13:47:23,094 INFO L226 Difference]: Without dead ends: 159 [2018-07-23 13:47:23,096 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:47:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-23 13:47:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-23 13:47:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-23 13:47:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-23 13:47:23,103 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-23 13:47:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:23,103 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-23 13:47:23,103 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:47:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-23 13:47:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-23 13:47:23,104 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:23,104 INFO L357 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-23 13:47:23,104 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-23 13:47:23,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:23,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:23,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:47:23,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:23,880 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:47:23,880 INFO L185 omatonBuilderFactory]: Interpolants [34944#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 34945#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 34946#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 34947#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 34948#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 34949#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 34950#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 34951#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 34952#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 34953#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 34954#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 34955#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 34956#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 34957#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 34958#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 34959#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 34960#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 34961#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 34962#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 34963#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 34964#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 34965#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 34966#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 34967#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 34968#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 34969#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 34890#true, 34891#false, 34892#(<= ULTIMATE.start_main_~i~5 0), 34893#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 34894#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 34895#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 34896#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 34897#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 34898#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 34899#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 34900#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 34901#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 34902#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 34903#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 34904#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 34905#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 34906#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 34907#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 34908#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 34909#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 34910#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 34911#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 34912#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 34913#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 34914#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 34915#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 34916#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 34917#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 34918#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 34919#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 34920#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 34921#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 34922#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 34923#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 34924#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 34925#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 34926#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 34927#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 34928#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 34929#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 34930#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 34931#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 34932#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 34933#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 34934#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 34935#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 34936#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 34937#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 34938#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 34939#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 34940#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 34941#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 34942#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 34943#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:23,881 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:47:23,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:47:23,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:47:23,882 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-23 13:47:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:28,785 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-23 13:47:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:47:28,785 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-23 13:47:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:28,786 INFO L225 Difference]: With dead ends: 163 [2018-07-23 13:47:28,786 INFO L226 Difference]: Without dead ends: 161 [2018-07-23 13:47:28,787 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:47:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-23 13:47:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-23 13:47:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 13:47:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-23 13:47:28,793 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-23 13:47:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:28,794 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-23 13:47:28,794 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:47:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-23 13:47:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 13:47:28,794 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:28,794 INFO L357 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-23 13:47:28,794 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-07-23 13:47:28,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:29,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:29,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:47:29,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:29,565 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:47:29,566 INFO L185 omatonBuilderFactory]: Interpolants [35840#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 35841#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 35842#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 35843#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 35844#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 35845#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 35846#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 35847#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 35848#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 35849#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 35850#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 35851#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 35852#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 35772#true, 35773#false, 35774#(<= ULTIMATE.start_main_~i~5 0), 35775#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 35776#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 35777#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 35778#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 35779#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 35780#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 35781#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 35782#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 35783#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 35784#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 35785#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 35786#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 35787#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 35788#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 35789#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 35790#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 35791#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 35792#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 35793#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 35794#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 35795#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 35796#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 35797#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 35798#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 35799#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 35800#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 35801#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 35802#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 35803#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 35804#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 35805#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 35806#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 35807#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 35808#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 35809#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 35810#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 35811#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 35812#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 35813#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 35814#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 35815#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 35816#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 35817#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 35818#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 35819#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 35820#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 35821#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 35822#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 35823#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 35824#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 35825#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 35826#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 35827#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 35828#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 35829#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 35830#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 35831#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 35832#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 35833#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 35834#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 35835#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 35836#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 35837#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 35838#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 35839#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:29,566 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:47:29,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:47:29,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:47:29,567 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-23 13:47:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:34,350 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-23 13:47:34,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:47:34,350 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-23 13:47:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:34,351 INFO L225 Difference]: With dead ends: 165 [2018-07-23 13:47:34,351 INFO L226 Difference]: Without dead ends: 163 [2018-07-23 13:47:34,353 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2018-07-23 13:47:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-23 13:47:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-23 13:47:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-23 13:47:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-23 13:47:34,376 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-23 13:47:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:34,376 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-23 13:47:34,376 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:47:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-23 13:47:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-23 13:47:34,377 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:34,377 INFO L357 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-23 13:47:34,378 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:34,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-07-23 13:47:34,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:35,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:35,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:47:35,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:35,211 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:47:35,212 INFO L185 omatonBuilderFactory]: Interpolants [36736#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 36737#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 36738#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 36739#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 36740#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 36741#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 36742#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 36743#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 36744#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 36745#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 36746#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 36665#true, 36666#false, 36667#(<= ULTIMATE.start_main_~i~5 0), 36668#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 36669#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 36670#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 36671#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 36672#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 36673#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 36674#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 36675#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 36676#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 36677#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 36678#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 36679#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 36680#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 36681#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 36682#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 36683#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 36684#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 36685#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 36686#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 36687#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 36688#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 36689#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 36690#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 36691#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 36692#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 36693#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 36694#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 36695#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 36696#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 36697#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 36698#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 36699#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 36700#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 36701#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 36702#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 36703#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 36704#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 36705#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 36706#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 36707#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 36708#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 36709#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 36710#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 36711#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 36712#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 36713#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 36714#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 36715#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 36716#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 36717#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 36718#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 36719#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 36720#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 36721#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 36722#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 36723#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 36724#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 36725#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 36726#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 36727#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 36728#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 36729#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 36730#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 36731#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 36732#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 36733#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 36734#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 36735#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:35,212 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:47:35,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:47:35,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:47:35,213 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-23 13:47:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:40,162 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-23 13:47:40,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:47:40,162 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-23 13:47:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:40,163 INFO L225 Difference]: With dead ends: 167 [2018-07-23 13:47:40,163 INFO L226 Difference]: Without dead ends: 165 [2018-07-23 13:47:40,164 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2018-07-23 13:47:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-23 13:47:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-23 13:47:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-23 13:47:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-23 13:47:40,172 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-23 13:47:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:40,172 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-23 13:47:40,172 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:47:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-23 13:47:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 13:47:40,173 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:40,173 INFO L357 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-23 13:47:40,173 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-07-23 13:47:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:41,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:41,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:47:41,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:41,016 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:47:41,016 INFO L185 omatonBuilderFactory]: Interpolants [37632#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 37633#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 37634#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 37635#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 37636#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 37637#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 37638#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 37639#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 37640#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 37641#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 37642#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 37643#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 37644#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 37645#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 37646#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 37647#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 37648#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 37649#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 37650#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 37651#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 37569#true, 37570#false, 37571#(<= ULTIMATE.start_main_~i~5 0), 37572#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 37573#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 37574#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 37575#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 37576#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 37577#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 37578#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 37579#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 37580#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 37581#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 37582#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 37583#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 37584#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 37585#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 37586#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 37587#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 37588#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 37589#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 37590#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 37591#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 37592#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 37593#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 37594#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 37595#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 37596#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 37597#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 37598#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 37599#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 37600#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 37601#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 37602#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 37603#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 37604#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 37605#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 37606#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 37607#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 37608#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 37609#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 37610#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 37611#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 37612#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 37613#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 37614#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 37615#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 37616#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 37617#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 37618#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 37619#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 37620#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 37621#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 37622#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 37623#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 37624#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 37625#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 37626#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 37627#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 37628#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 37629#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 37630#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 37631#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:41,017 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:47:41,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:47:41,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:47:41,017 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-23 13:47:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:46,143 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-23 13:47:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:47:46,143 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-23 13:47:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:46,144 INFO L225 Difference]: With dead ends: 169 [2018-07-23 13:47:46,144 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 13:47:46,146 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6723, Invalid=19683, Unknown=0, NotChecked=0, Total=26406 [2018-07-23 13:47:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 13:47:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-23 13:47:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-23 13:47:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-23 13:47:46,155 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-23 13:47:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:46,155 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-23 13:47:46,155 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:47:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-23 13:47:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-23 13:47:46,156 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:46,157 INFO L357 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-23 13:47:46,157 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:46,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-07-23 13:47:46,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:47,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:47,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:47:47,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:47,093 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:47:47,094 INFO L185 omatonBuilderFactory]: Interpolants [38528#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 38529#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 38530#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 38531#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 38532#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 38533#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 38534#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 38535#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 38536#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 38537#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 38538#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 38539#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 38540#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 38541#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 38542#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 38543#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 38544#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 38545#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 38546#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 38547#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 38548#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 38549#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 38550#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 38551#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 38552#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 38553#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 38554#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 38555#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 38556#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 38557#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 38558#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 38559#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 38560#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 38561#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 38562#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 38563#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 38564#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 38565#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 38566#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 38567#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 38484#true, 38485#false, 38486#(<= ULTIMATE.start_main_~i~5 0), 38487#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 38488#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 38489#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 38490#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 38491#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 38492#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 38493#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 38494#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 38495#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 38496#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 38497#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 38498#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 38499#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 38500#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 38501#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 38502#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 38503#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 38504#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 38505#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 38506#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 38507#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 38508#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 38509#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 38510#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 38511#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 38512#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 38513#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 38514#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 38515#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 38516#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 38517#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 38518#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 38519#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 38520#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 38521#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 38522#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 38523#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 38524#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 38525#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 38526#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 38527#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:47,094 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:47:47,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:47:47,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:47:47,095 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-23 13:47:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:52,495 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-23 13:47:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:47:52,496 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-23 13:47:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:52,497 INFO L225 Difference]: With dead ends: 171 [2018-07-23 13:47:52,497 INFO L226 Difference]: Without dead ends: 169 [2018-07-23 13:47:52,499 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2018-07-23 13:47:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-23 13:47:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-23 13:47:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-23 13:47:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-23 13:47:52,507 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-23 13:47:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:52,507 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-23 13:47:52,507 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:47:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-23 13:47:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 13:47:52,508 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:52,508 INFO L357 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-23 13:47:52,509 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-07-23 13:47:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:53,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:53,423 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:47:53,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:53,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:47:53,423 INFO L185 omatonBuilderFactory]: Interpolants [39424#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 39425#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 39426#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 39427#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 39428#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 39429#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 39430#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 39431#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 39432#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 39433#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 39434#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 39435#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 39436#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 39437#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 39438#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 39439#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 39440#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 39441#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 39442#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 39443#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 39444#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 39445#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 39446#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 39447#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 39448#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 39449#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 39450#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 39451#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 39452#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 39453#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 39454#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 39455#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 39456#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 39457#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 39458#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 39459#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 39460#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 39461#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 39462#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 39463#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 39464#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 39465#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 39466#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 39467#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 39468#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 39469#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 39470#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 39471#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 39472#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 39473#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 39474#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 39475#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 39476#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 39477#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 39478#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 39479#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 39480#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 39481#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 39482#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 39483#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 39484#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 39485#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 39486#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 39487#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 39488#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 39489#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 39490#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 39491#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 39492#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 39493#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 39494#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 39410#true, 39411#false, 39412#(<= ULTIMATE.start_main_~i~5 0), 39413#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 39414#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 39415#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 39416#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 39417#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 39418#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 39419#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 39420#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 39421#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 39422#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 39423#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5))] [2018-07-23 13:47:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:53,424 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:47:53,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:47:53,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:47:53,425 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-23 13:47:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:59,169 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-23 13:47:59,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:47:59,169 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-23 13:47:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:59,170 INFO L225 Difference]: With dead ends: 173 [2018-07-23 13:47:59,170 INFO L226 Difference]: Without dead ends: 171 [2018-07-23 13:47:59,171 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2018-07-23 13:47:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-23 13:47:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-23 13:47:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-23 13:47:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-23 13:47:59,183 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-23 13:47:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:59,183 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-23 13:47:59,183 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:47:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-23 13:47:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-23 13:47:59,184 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:59,184 INFO L357 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-23 13:47:59,184 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-07-23 13:47:59,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:00,197 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:00,198 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:48:00,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:00,198 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:48:00,198 INFO L185 omatonBuilderFactory]: Interpolants [40347#true, 40348#false, 40349#(<= ULTIMATE.start_main_~i~5 0), 40350#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 40351#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 40352#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 40353#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 40354#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 40355#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 40356#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 40357#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 40358#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 40359#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 40360#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 40361#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 40362#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 40363#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 40364#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 40365#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 40366#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 40367#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 40368#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 40369#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 40370#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 40371#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 40372#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 40373#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 40374#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 40375#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 40376#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 40377#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 40378#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 40379#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 40380#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 40381#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 40382#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 40383#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 40384#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 40385#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 40386#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 40387#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 40388#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 40389#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 40390#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 40391#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 40392#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 40393#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 40394#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 40395#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 40396#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 40397#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 40398#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 40399#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 40400#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 40401#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 40402#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 40403#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 40404#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 40405#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 40406#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 40407#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 40408#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 40409#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 40410#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 40411#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 40412#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 40413#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 40414#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 40415#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 40416#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 40417#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 40418#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 40419#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 40420#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 40421#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 40422#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 40423#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 40424#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 40425#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 40426#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 40427#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 40428#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 40429#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 40430#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 40431#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 40432#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:48:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:00,199 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:48:00,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:48:00,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:48:00,199 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-23 13:48:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:05,870 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-23 13:48:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:48:05,871 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-23 13:48:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:05,872 INFO L225 Difference]: With dead ends: 175 [2018-07-23 13:48:05,872 INFO L226 Difference]: Without dead ends: 173 [2018-07-23 13:48:05,874 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2018-07-23 13:48:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-23 13:48:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-23 13:48:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 13:48:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-23 13:48:05,884 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-23 13:48:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:05,884 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-23 13:48:05,884 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:48:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-23 13:48:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 13:48:05,885 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:05,886 INFO L357 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-23 13:48:05,886 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:05,886 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-07-23 13:48:05,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:06,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:06,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:48:06,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:06,957 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:48:06,957 INFO L185 omatonBuilderFactory]: Interpolants [41344#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 41345#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 41346#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 41347#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 41348#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 41349#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 41350#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 41351#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 41352#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 41353#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 41354#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 41355#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 41356#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 41357#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 41358#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 41359#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 41360#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 41361#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 41362#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 41363#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 41364#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 41365#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 41366#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 41367#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 41368#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 41369#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 41370#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 41371#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 41372#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 41373#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 41374#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 41375#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 41376#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 41377#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 41378#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 41379#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 41380#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 41381#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 41295#true, 41296#false, 41297#(<= ULTIMATE.start_main_~i~5 0), 41298#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 41299#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 41300#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 41301#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 41302#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 41303#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 41304#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 41305#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 41306#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 41307#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 41308#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 41309#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 41310#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 41311#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 41312#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 41313#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 41314#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 41315#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 41316#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 41317#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 41318#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 41319#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 41320#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 41321#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 41322#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 41323#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 41324#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 41325#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 41326#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 41327#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 41328#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 41329#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 41330#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 41331#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 41332#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 41333#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 41334#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 41335#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 41336#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 41337#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 41338#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 41339#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 41340#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 41341#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 41342#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 41343#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5))] [2018-07-23 13:48:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:06,957 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:48:06,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:48:06,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:48:06,958 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-23 13:48:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:13,342 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-23 13:48:13,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:48:13,342 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-23 13:48:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:13,343 INFO L225 Difference]: With dead ends: 177 [2018-07-23 13:48:13,343 INFO L226 Difference]: Without dead ends: 175 [2018-07-23 13:48:13,344 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2018-07-23 13:48:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-23 13:48:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-23 13:48:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-23 13:48:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-23 13:48:13,353 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-23 13:48:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:13,353 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-23 13:48:13,353 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:48:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-23 13:48:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-23 13:48:13,354 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:13,354 INFO L357 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-23 13:48:13,355 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-07-23 13:48:13,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:14,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:14,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:48:14,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:14,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:48:14,387 INFO L185 omatonBuilderFactory]: Interpolants [42254#true, 42255#false, 42256#(<= ULTIMATE.start_main_~i~5 0), 42257#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 42258#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 42259#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 42260#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 42261#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 42262#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 42263#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 42264#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 42265#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 42266#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 42267#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 42268#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 42269#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 42270#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 42271#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 42272#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 42273#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 42274#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 42275#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 42276#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 42277#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 42278#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 42279#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 42280#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 42281#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 42282#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 42283#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 42284#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 42285#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 42286#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 42287#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 42288#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 42289#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 42290#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 42291#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 42292#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 42293#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 42294#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 42295#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 42296#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 42297#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 42298#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 42299#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 42300#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 42301#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 42302#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 42303#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 42304#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 42305#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 42306#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 42307#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 42308#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 42309#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 42310#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 42311#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 42312#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 42313#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 42314#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 42315#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 42316#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 42317#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 42318#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 42319#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 42320#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 42321#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 42322#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 42323#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 42324#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 42325#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 42326#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 42327#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 42328#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 42329#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 42330#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 42331#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 42332#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 42333#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 42334#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 42335#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 42336#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 42337#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 42338#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 42339#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 42340#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 42341#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:48:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:14,388 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:48:14,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:48:14,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:48:14,389 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-23 13:48:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:20,543 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-23 13:48:20,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:48:20,543 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-23 13:48:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:20,544 INFO L225 Difference]: With dead ends: 179 [2018-07-23 13:48:20,544 INFO L226 Difference]: Without dead ends: 177 [2018-07-23 13:48:20,546 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2018-07-23 13:48:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-23 13:48:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-23 13:48:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 13:48:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-23 13:48:20,554 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-23 13:48:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:20,554 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-23 13:48:20,554 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:48:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-23 13:48:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 13:48:20,555 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:20,555 INFO L357 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-23 13:48:20,555 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-07-23 13:48:20,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:21,550 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:21,550 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:48:21,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:21,551 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:48:21,551 INFO L185 omatonBuilderFactory]: Interpolants [43264#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 43265#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 43266#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 43267#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 43268#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 43269#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 43270#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 43271#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 43272#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 43273#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 43274#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 43275#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 43276#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 43277#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 43278#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 43279#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 43280#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 43281#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 43282#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 43283#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 43284#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 43285#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 43286#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 43287#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 43288#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 43289#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 43290#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 43291#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 43292#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 43293#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 43294#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 43295#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 43296#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 43297#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 43298#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 43299#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 43300#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 43301#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 43302#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 43303#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 43304#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 43305#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 43306#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 43307#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 43308#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 43309#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 43310#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 43311#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 43312#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 43224#true, 43225#false, 43226#(<= ULTIMATE.start_main_~i~5 0), 43227#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 43228#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 43229#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 43230#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 43231#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 43232#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 43233#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 43234#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 43235#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 43236#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 43237#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 43238#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 43239#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 43240#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 43241#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 43242#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 43243#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 43244#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 43245#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 43246#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 43247#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 43248#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 43249#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 43250#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 43251#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 43252#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 43253#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 43254#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 43255#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 43256#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 43257#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 43258#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 43259#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 43260#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 43261#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 43262#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 43263#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5))] [2018-07-23 13:48:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:21,552 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:48:21,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:48:21,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:48:21,553 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-23 13:48:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:27,799 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-23 13:48:27,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:48:27,799 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-23 13:48:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:27,800 INFO L225 Difference]: With dead ends: 181 [2018-07-23 13:48:27,800 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 13:48:27,801 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7743, Invalid=22707, Unknown=0, NotChecked=0, Total=30450 [2018-07-23 13:48:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 13:48:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-23 13:48:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-23 13:48:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-23 13:48:27,807 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-23 13:48:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:27,807 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-23 13:48:27,808 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:48:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-23 13:48:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-23 13:48:27,808 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:27,808 INFO L357 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-23 13:48:27,808 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-07-23 13:48:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:28,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:28,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:48:28,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:28,876 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:48:28,876 INFO L185 omatonBuilderFactory]: Interpolants [44288#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 44289#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 44290#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 44291#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 44292#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 44293#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 44294#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 44205#true, 44206#false, 44207#(<= ULTIMATE.start_main_~i~5 0), 44208#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 44209#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 44210#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 44211#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 44212#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 44213#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 44214#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 44215#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 44216#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 44217#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 44218#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 44219#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 44220#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 44221#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 44222#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 44223#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 44224#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 44225#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 44226#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 44227#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 44228#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 44229#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 44230#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 44231#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 44232#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 44233#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 44234#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 44235#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 44236#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 44237#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 44238#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 44239#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 44240#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 44241#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 44242#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 44243#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 44244#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 44245#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 44246#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 44247#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 44248#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 44249#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 44250#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 44251#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 44252#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 44253#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 44254#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 44255#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 44256#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 44257#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 44258#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 44259#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 44260#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 44261#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 44262#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 44263#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 44264#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 44265#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 44266#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 44267#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 44268#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 44269#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 44270#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 44271#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 44272#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 44273#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 44274#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 44275#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 44276#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 44277#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 44278#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 44279#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 44280#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 44281#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 44282#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 44283#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 44284#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 44285#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 44286#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 44287#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5))] [2018-07-23 13:48:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:28,877 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:48:28,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:48:28,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:48:28,878 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-23 13:48:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:35,643 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-23 13:48:35,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:48:35,643 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-23 13:48:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:35,644 INFO L225 Difference]: With dead ends: 183 [2018-07-23 13:48:35,644 INFO L226 Difference]: Without dead ends: 181 [2018-07-23 13:48:35,646 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2018-07-23 13:48:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-23 13:48:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-23 13:48:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 13:48:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-23 13:48:35,657 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-23 13:48:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:35,657 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-23 13:48:35,657 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:48:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-23 13:48:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 13:48:35,658 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:35,658 INFO L357 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-23 13:48:35,659 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:35,659 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-07-23 13:48:35,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:36,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:36,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:48:36,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:36,806 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:48:36,806 INFO L185 omatonBuilderFactory]: Interpolants [45197#true, 45198#false, 45199#(<= ULTIMATE.start_main_~i~5 0), 45200#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 45201#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 45202#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 45203#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 45204#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 45205#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 45206#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 45207#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 45208#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 45209#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 45210#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 45211#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 45212#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 45213#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 45214#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 45215#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 45216#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 45217#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 45218#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 45219#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 45220#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 45221#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 45222#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 45223#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 45224#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 45225#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 45226#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 45227#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 45228#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 45229#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 45230#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 45231#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 45232#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 45233#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 45234#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 45235#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 45236#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 45237#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 45238#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 45239#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 45240#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 45241#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 45242#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 45243#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 45244#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 45245#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 45246#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 45247#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 45248#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 45249#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 45250#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 45251#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 45252#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 45253#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 45254#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 45255#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 45256#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 45257#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 45258#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 45259#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 45260#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 45261#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 45262#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 45263#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 45264#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 45265#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 45266#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 45267#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 45268#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 45269#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 45270#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 45271#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 45272#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 45273#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 45274#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 45275#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 45276#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 45277#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 45278#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 45279#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 45280#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 45281#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 45282#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 45283#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 45284#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 45285#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 45286#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 45287#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:48:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:36,807 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:48:36,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:48:36,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:48:36,807 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-23 13:48:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:43,604 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-23 13:48:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:48:43,604 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-23 13:48:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:43,605 INFO L225 Difference]: With dead ends: 185 [2018-07-23 13:48:43,605 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 13:48:43,606 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2018-07-23 13:48:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 13:48:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-23 13:48:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-23 13:48:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-23 13:48:43,614 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-23 13:48:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:43,614 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-23 13:48:43,614 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:48:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-23 13:48:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-23 13:48:43,615 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:43,615 INFO L357 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-23 13:48:43,615 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-07-23 13:48:43,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:44,739 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:44,739 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:48:44,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:44,739 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:48:44,739 INFO L185 omatonBuilderFactory]: Interpolants [46208#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 46209#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 46210#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 46211#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 46212#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 46213#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 46214#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 46215#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 46216#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 46217#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 46218#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 46219#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 46220#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 46221#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 46222#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 46223#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 46224#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 46225#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 46226#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 46227#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 46228#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 46229#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 46230#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 46231#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 46232#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 46233#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 46234#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 46235#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 46236#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 46237#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 46238#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 46239#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 46240#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 46241#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 46242#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 46243#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 46244#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 46245#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 46246#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 46247#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 46248#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 46249#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 46250#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 46251#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 46252#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 46253#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 46254#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 46255#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 46256#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 46257#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 46258#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 46259#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 46260#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 46261#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 46262#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 46263#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 46264#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 46265#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 46266#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 46267#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 46268#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 46269#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 46270#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 46271#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 46272#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 46273#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 46274#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 46275#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 46276#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 46277#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 46278#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 46279#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 46280#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 46281#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 46282#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 46283#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 46284#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 46285#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 46286#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 46287#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 46288#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 46289#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 46290#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 46291#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 46200#true, 46201#false, 46202#(<= ULTIMATE.start_main_~i~5 0), 46203#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 46204#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 46205#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 46206#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 46207#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5))] [2018-07-23 13:48:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:44,740 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:48:44,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:48:44,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:48:44,741 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-23 13:48:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:51,527 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-23 13:48:51,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:48:51,527 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-23 13:48:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:51,528 INFO L225 Difference]: With dead ends: 187 [2018-07-23 13:48:51,528 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 13:48:51,529 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8280, Invalid=24300, Unknown=0, NotChecked=0, Total=32580 [2018-07-23 13:48:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 13:48:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-23 13:48:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 13:48:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-23 13:48:51,535 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-23 13:48:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:51,536 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-23 13:48:51,536 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:48:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-23 13:48:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 13:48:51,536 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:51,536 INFO L357 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-23 13:48:51,537 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-07-23 13:48:51,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:52,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:52,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:48:52,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:52,637 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:48:52,637 INFO L185 omatonBuilderFactory]: Interpolants [47232#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 47233#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 47234#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 47235#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 47236#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 47237#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 47238#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 47239#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 47240#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 47241#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 47242#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 47243#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 47244#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 47245#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 47246#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 47247#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 47248#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 47249#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 47250#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 47251#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 47252#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 47253#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 47254#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 47255#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 47256#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 47257#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 47258#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 47259#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 47260#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 47261#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 47262#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 47263#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 47264#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 47265#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 47266#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 47267#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 47268#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 47269#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 47270#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 47271#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 47272#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 47273#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 47274#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 47275#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 47276#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 47277#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 47278#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 47279#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 47280#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 47281#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 47282#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 47283#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 47284#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 47285#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 47286#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 47287#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 47288#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 47289#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 47290#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 47291#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 47292#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 47293#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 47294#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 47295#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 47296#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 47297#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 47298#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 47299#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 47300#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 47301#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 47302#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 47303#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 47304#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 47305#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 47306#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 47214#true, 47215#false, 47216#(<= ULTIMATE.start_main_~i~5 0), 47217#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 47218#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 47219#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 47220#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 47221#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 47222#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 47223#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 47224#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 47225#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 47226#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 47227#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 47228#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 47229#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 47230#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 47231#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5))] [2018-07-23 13:48:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:52,638 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:48:52,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:48:52,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:48:52,639 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-23 13:48:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:59,641 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-23 13:48:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:48:59,641 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-23 13:48:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:59,641 INFO L225 Difference]: With dead ends: 189 [2018-07-23 13:48:59,642 INFO L226 Difference]: Without dead ends: 187 [2018-07-23 13:48:59,643 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8463, Invalid=24843, Unknown=0, NotChecked=0, Total=33306 [2018-07-23 13:48:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-23 13:48:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-23 13:48:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-23 13:48:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-23 13:48:59,649 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-23 13:48:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:59,649 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-23 13:48:59,649 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:48:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-23 13:48:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-23 13:48:59,650 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:59,650 INFO L357 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-23 13:48:59,651 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-07-23 13:48:59,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:00,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:00,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:49:00,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:00,780 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:49:00,780 INFO L185 omatonBuilderFactory]: Interpolants [48256#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 48257#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 48258#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 48259#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 48260#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 48261#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 48262#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 48263#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 48264#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 48265#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 48266#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 48267#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 48268#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 48269#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 48270#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 48271#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 48272#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 48273#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 48274#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 48275#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 48276#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 48277#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 48278#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 48279#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 48280#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 48281#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 48282#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 48283#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 48284#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 48285#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 48286#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 48287#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 48288#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 48289#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 48290#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 48291#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 48292#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 48293#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 48294#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 48295#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 48296#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 48297#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 48298#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 48299#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 48300#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 48301#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 48302#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 48303#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 48304#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 48305#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 48306#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 48307#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 48308#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 48309#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 48310#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 48311#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 48312#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 48313#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 48314#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 48315#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 48316#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 48317#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 48318#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 48319#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 48320#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 48321#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 48322#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 48323#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 48324#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 48325#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 48326#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 48327#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 48328#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 48329#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 48330#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 48331#(<= ULTIMATE.start_main_~i~5 (* 90 ULTIMATE.start_main_~k~5)), 48332#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 48239#true, 48240#false, 48241#(<= ULTIMATE.start_main_~i~5 0), 48242#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 48243#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 48244#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 48245#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 48246#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 48247#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 48248#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 48249#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 48250#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 48251#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 48252#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 48253#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 48254#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 48255#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5))] [2018-07-23 13:49:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:00,781 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:49:00,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:49:00,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:49:00,782 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-23 13:49:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:08,009 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-23 13:49:08,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:49:08,009 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-23 13:49:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:08,010 INFO L225 Difference]: With dead ends: 191 [2018-07-23 13:49:08,010 INFO L226 Difference]: Without dead ends: 189 [2018-07-23 13:49:08,011 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8648, Invalid=25392, Unknown=0, NotChecked=0, Total=34040 [2018-07-23 13:49:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-23 13:49:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-23 13:49:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 13:49:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-23 13:49:08,017 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-23 13:49:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:08,017 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-23 13:49:08,017 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:49:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-23 13:49:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 13:49:08,018 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:08,018 INFO L357 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-23 13:49:08,018 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-07-23 13:49:08,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:09,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:09,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:49:09,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:09,204 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:49:09,204 INFO L185 omatonBuilderFactory]: Interpolants [49280#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 49281#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 49282#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 49283#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 49284#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 49285#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 49286#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 49287#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 49288#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 49289#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 49290#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 49291#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 49292#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 49293#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 49294#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 49295#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 49296#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 49297#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 49298#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 49299#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 49300#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 49301#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 49302#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 49303#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 49304#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 49305#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 49306#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 49307#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 49308#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 49309#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 49310#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 49311#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 49312#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 49313#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 49314#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 49315#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 49316#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 49317#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 49318#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 49319#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 49320#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 49321#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 49322#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 49323#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 49324#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 49325#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 49326#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 49327#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 49328#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 49329#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 49330#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 49331#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 49332#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 49333#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 49334#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 49335#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 49336#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 49337#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 49338#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 49339#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 49340#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 49341#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 49342#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 49343#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 49344#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 49345#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 49346#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 49347#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 49348#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 49349#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 49350#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 49351#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 49352#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 49353#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 49354#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 49355#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 49356#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 49357#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 49358#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 49359#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 49360#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 49361#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 49362#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 49363#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 49364#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 49365#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 49366#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 49367#(<= ULTIMATE.start_main_~i~5 (* 90 ULTIMATE.start_main_~k~5)), 49368#(<= ULTIMATE.start_main_~i~5 (* 91 ULTIMATE.start_main_~k~5)), 49369#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5)), 49275#true, 49276#false, 49277#(<= ULTIMATE.start_main_~i~5 0), 49278#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 49279#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5))] [2018-07-23 13:49:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:09,205 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:49:09,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:49:09,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:49:09,206 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-23 13:49:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:16,704 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-23 13:49:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:49:16,704 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-23 13:49:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:16,705 INFO L225 Difference]: With dead ends: 193 [2018-07-23 13:49:16,705 INFO L226 Difference]: Without dead ends: 191 [2018-07-23 13:49:16,706 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=8835, Invalid=25947, Unknown=0, NotChecked=0, Total=34782 [2018-07-23 13:49:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-23 13:49:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-23 13:49:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-23 13:49:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-23 13:49:16,713 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-23 13:49:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:16,714 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-23 13:49:16,714 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:49:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-23 13:49:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-23 13:49:16,715 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:16,715 INFO L357 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-23 13:49:16,715 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:16,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-07-23 13:49:16,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:17,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:17,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:49:17,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:17,877 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:49:17,877 INFO L185 omatonBuilderFactory]: Interpolants [50322#true, 50323#false, 50324#(<= ULTIMATE.start_main_~i~5 0), 50325#(<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5), 50326#(<= ULTIMATE.start_main_~i~5 (* 2 ULTIMATE.start_main_~k~5)), 50327#(<= ULTIMATE.start_main_~i~5 (* 3 ULTIMATE.start_main_~k~5)), 50328#(<= ULTIMATE.start_main_~i~5 (* 4 ULTIMATE.start_main_~k~5)), 50329#(<= ULTIMATE.start_main_~i~5 (* 5 ULTIMATE.start_main_~k~5)), 50330#(<= ULTIMATE.start_main_~i~5 (* 6 ULTIMATE.start_main_~k~5)), 50331#(<= ULTIMATE.start_main_~i~5 (* 7 ULTIMATE.start_main_~k~5)), 50332#(<= ULTIMATE.start_main_~i~5 (* 8 ULTIMATE.start_main_~k~5)), 50333#(<= ULTIMATE.start_main_~i~5 (* 9 ULTIMATE.start_main_~k~5)), 50334#(<= ULTIMATE.start_main_~i~5 (* 10 ULTIMATE.start_main_~k~5)), 50335#(<= ULTIMATE.start_main_~i~5 (* 11 ULTIMATE.start_main_~k~5)), 50336#(<= ULTIMATE.start_main_~i~5 (* 12 ULTIMATE.start_main_~k~5)), 50337#(<= ULTIMATE.start_main_~i~5 (* 13 ULTIMATE.start_main_~k~5)), 50338#(<= ULTIMATE.start_main_~i~5 (* 14 ULTIMATE.start_main_~k~5)), 50339#(<= ULTIMATE.start_main_~i~5 (* 15 ULTIMATE.start_main_~k~5)), 50340#(<= ULTIMATE.start_main_~i~5 (* 16 ULTIMATE.start_main_~k~5)), 50341#(<= ULTIMATE.start_main_~i~5 (* 17 ULTIMATE.start_main_~k~5)), 50342#(<= ULTIMATE.start_main_~i~5 (* 18 ULTIMATE.start_main_~k~5)), 50343#(<= ULTIMATE.start_main_~i~5 (* 19 ULTIMATE.start_main_~k~5)), 50344#(<= ULTIMATE.start_main_~i~5 (* 20 ULTIMATE.start_main_~k~5)), 50345#(<= ULTIMATE.start_main_~i~5 (* 21 ULTIMATE.start_main_~k~5)), 50346#(<= ULTIMATE.start_main_~i~5 (* 22 ULTIMATE.start_main_~k~5)), 50347#(<= ULTIMATE.start_main_~i~5 (* 23 ULTIMATE.start_main_~k~5)), 50348#(<= ULTIMATE.start_main_~i~5 (* 24 ULTIMATE.start_main_~k~5)), 50349#(<= ULTIMATE.start_main_~i~5 (* 25 ULTIMATE.start_main_~k~5)), 50350#(<= ULTIMATE.start_main_~i~5 (* 26 ULTIMATE.start_main_~k~5)), 50351#(<= ULTIMATE.start_main_~i~5 (* 27 ULTIMATE.start_main_~k~5)), 50352#(<= ULTIMATE.start_main_~i~5 (* 28 ULTIMATE.start_main_~k~5)), 50353#(<= ULTIMATE.start_main_~i~5 (* 29 ULTIMATE.start_main_~k~5)), 50354#(<= ULTIMATE.start_main_~i~5 (* 30 ULTIMATE.start_main_~k~5)), 50355#(<= ULTIMATE.start_main_~i~5 (* 31 ULTIMATE.start_main_~k~5)), 50356#(<= ULTIMATE.start_main_~i~5 (* 32 ULTIMATE.start_main_~k~5)), 50357#(<= ULTIMATE.start_main_~i~5 (* 33 ULTIMATE.start_main_~k~5)), 50358#(<= ULTIMATE.start_main_~i~5 (* 34 ULTIMATE.start_main_~k~5)), 50359#(<= ULTIMATE.start_main_~i~5 (* 35 ULTIMATE.start_main_~k~5)), 50360#(<= ULTIMATE.start_main_~i~5 (* 36 ULTIMATE.start_main_~k~5)), 50361#(<= ULTIMATE.start_main_~i~5 (* 37 ULTIMATE.start_main_~k~5)), 50362#(<= ULTIMATE.start_main_~i~5 (* 38 ULTIMATE.start_main_~k~5)), 50363#(<= ULTIMATE.start_main_~i~5 (* 39 ULTIMATE.start_main_~k~5)), 50364#(<= ULTIMATE.start_main_~i~5 (* 40 ULTIMATE.start_main_~k~5)), 50365#(<= ULTIMATE.start_main_~i~5 (* 41 ULTIMATE.start_main_~k~5)), 50366#(<= ULTIMATE.start_main_~i~5 (* 42 ULTIMATE.start_main_~k~5)), 50367#(<= ULTIMATE.start_main_~i~5 (* 43 ULTIMATE.start_main_~k~5)), 50368#(<= ULTIMATE.start_main_~i~5 (* 44 ULTIMATE.start_main_~k~5)), 50369#(<= ULTIMATE.start_main_~i~5 (* 45 ULTIMATE.start_main_~k~5)), 50370#(<= ULTIMATE.start_main_~i~5 (* 46 ULTIMATE.start_main_~k~5)), 50371#(<= ULTIMATE.start_main_~i~5 (* 47 ULTIMATE.start_main_~k~5)), 50372#(<= ULTIMATE.start_main_~i~5 (* 48 ULTIMATE.start_main_~k~5)), 50373#(<= ULTIMATE.start_main_~i~5 (* 49 ULTIMATE.start_main_~k~5)), 50374#(<= ULTIMATE.start_main_~i~5 (* 50 ULTIMATE.start_main_~k~5)), 50375#(<= ULTIMATE.start_main_~i~5 (* 51 ULTIMATE.start_main_~k~5)), 50376#(<= ULTIMATE.start_main_~i~5 (* 52 ULTIMATE.start_main_~k~5)), 50377#(<= ULTIMATE.start_main_~i~5 (* 53 ULTIMATE.start_main_~k~5)), 50378#(<= ULTIMATE.start_main_~i~5 (* 54 ULTIMATE.start_main_~k~5)), 50379#(<= ULTIMATE.start_main_~i~5 (* 55 ULTIMATE.start_main_~k~5)), 50380#(<= ULTIMATE.start_main_~i~5 (* 56 ULTIMATE.start_main_~k~5)), 50381#(<= ULTIMATE.start_main_~i~5 (* 57 ULTIMATE.start_main_~k~5)), 50382#(<= ULTIMATE.start_main_~i~5 (* 58 ULTIMATE.start_main_~k~5)), 50383#(<= ULTIMATE.start_main_~i~5 (* 59 ULTIMATE.start_main_~k~5)), 50384#(<= ULTIMATE.start_main_~i~5 (* 60 ULTIMATE.start_main_~k~5)), 50385#(<= ULTIMATE.start_main_~i~5 (* 61 ULTIMATE.start_main_~k~5)), 50386#(<= ULTIMATE.start_main_~i~5 (* 62 ULTIMATE.start_main_~k~5)), 50387#(<= ULTIMATE.start_main_~i~5 (* 63 ULTIMATE.start_main_~k~5)), 50388#(<= ULTIMATE.start_main_~i~5 (* 64 ULTIMATE.start_main_~k~5)), 50389#(<= ULTIMATE.start_main_~i~5 (* 65 ULTIMATE.start_main_~k~5)), 50390#(<= ULTIMATE.start_main_~i~5 (* 66 ULTIMATE.start_main_~k~5)), 50391#(<= ULTIMATE.start_main_~i~5 (* 67 ULTIMATE.start_main_~k~5)), 50392#(<= ULTIMATE.start_main_~i~5 (* 68 ULTIMATE.start_main_~k~5)), 50393#(<= ULTIMATE.start_main_~i~5 (* 69 ULTIMATE.start_main_~k~5)), 50394#(<= ULTIMATE.start_main_~i~5 (* 70 ULTIMATE.start_main_~k~5)), 50395#(<= ULTIMATE.start_main_~i~5 (* 71 ULTIMATE.start_main_~k~5)), 50396#(<= ULTIMATE.start_main_~i~5 (* 72 ULTIMATE.start_main_~k~5)), 50397#(<= ULTIMATE.start_main_~i~5 (* 73 ULTIMATE.start_main_~k~5)), 50398#(<= ULTIMATE.start_main_~i~5 (* 74 ULTIMATE.start_main_~k~5)), 50399#(<= ULTIMATE.start_main_~i~5 (* 75 ULTIMATE.start_main_~k~5)), 50400#(<= ULTIMATE.start_main_~i~5 (* 76 ULTIMATE.start_main_~k~5)), 50401#(<= ULTIMATE.start_main_~i~5 (* 77 ULTIMATE.start_main_~k~5)), 50402#(<= ULTIMATE.start_main_~i~5 (* 78 ULTIMATE.start_main_~k~5)), 50403#(<= ULTIMATE.start_main_~i~5 (* 79 ULTIMATE.start_main_~k~5)), 50404#(<= ULTIMATE.start_main_~i~5 (* 80 ULTIMATE.start_main_~k~5)), 50405#(<= ULTIMATE.start_main_~i~5 (* 81 ULTIMATE.start_main_~k~5)), 50406#(<= ULTIMATE.start_main_~i~5 (* 82 ULTIMATE.start_main_~k~5)), 50407#(<= ULTIMATE.start_main_~i~5 (* 83 ULTIMATE.start_main_~k~5)), 50408#(<= ULTIMATE.start_main_~i~5 (* 84 ULTIMATE.start_main_~k~5)), 50409#(<= ULTIMATE.start_main_~i~5 (* 85 ULTIMATE.start_main_~k~5)), 50410#(<= ULTIMATE.start_main_~i~5 (* 86 ULTIMATE.start_main_~k~5)), 50411#(<= ULTIMATE.start_main_~i~5 (* 87 ULTIMATE.start_main_~k~5)), 50412#(<= ULTIMATE.start_main_~i~5 (* 88 ULTIMATE.start_main_~k~5)), 50413#(<= ULTIMATE.start_main_~i~5 (* 89 ULTIMATE.start_main_~k~5)), 50414#(<= ULTIMATE.start_main_~i~5 (* 90 ULTIMATE.start_main_~k~5)), 50415#(<= ULTIMATE.start_main_~i~5 (* 91 ULTIMATE.start_main_~k~5)), 50416#(<= ULTIMATE.start_main_~i~5 (* 92 ULTIMATE.start_main_~k~5)), 50417#(<= (+ ULTIMATE.start_main_~i~5 1) (* 1000000 ULTIMATE.start_main_~k~5))] [2018-07-23 13:49:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:17,878 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:49:17,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:49:17,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:49:17,879 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. Received shutdown request... [2018-07-23 13:49:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:49:20,215 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:49:20,224 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:49:20,224 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:20 BoogieIcfgContainer [2018-07-23 13:49:20,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:20,229 INFO L168 Benchmark]: Toolchain (without parser) took 252429.24 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 533.7 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 317.6 MB). Peak memory consumption was 851.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:20,231 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:49:20,231 INFO L168 Benchmark]: Boogie Preprocessor took 48.84 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:49:20,232 INFO L168 Benchmark]: RCFGBuilder took 216.43 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:49:20,232 INFO L168 Benchmark]: TraceAbstraction took 252159.98 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 533.7 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 307.0 MB). Peak memory consumption was 840.8 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:20,238 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.20 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 48.84 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 216.43 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 252159.98 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 533.7 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 307.0 MB). Peak memory consumption was 840.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 38). Cancelled while BasicCegarLoop was constructing difference of abstraction (191states) and interpolant automaton (currently 33 states, 96 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 127 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 252.0s OverallTime, 94 OverallIterations, 94 TraceHistogramMax, 209.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 467 SDtfs, 0 SDslu, 8773 SDs, 0 SdLazy, 9146 SolverSat, 4277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8868 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8773 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130233 ImplicationChecksByTransitivity, 221.4s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/276830 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 93 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 18.1s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 9118 NumberOfCodeBlocks, 9118 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 9024 ConstructedInterpolants, 0 QuantifiedInterpolants, 5643522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 94 InterpolantComputations, 1 PerfectInterpolantSequences, 0/276830 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.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-20-250.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-20-250.csv Completed graceful shutdown