java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:40:22,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:40:22,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:40:22,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:40:22,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:40:22,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:40:22,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:40:22,550 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:40:22,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:40:22,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:40:22,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:40:22,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:40:22,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:40:22,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:40:22,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:40:22,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:40:22,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:40:22,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:40:22,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:40:22,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:40:22,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:40:22,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:40:22,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:40:22,586 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:40:22,586 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:40:22,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:40:22,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:40:22,590 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:40:22,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:40:22,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:40:22,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:40:22,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:40:22,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:40:22,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:40:22,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:40:22,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:40:22,595 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:40:22,608 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:40:22,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:40:22,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:40:22,610 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:40:22,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:40:22,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:40:22,610 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:40:22,610 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:40:22,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:40:22,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:40:22,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:40:22,699 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:40:22,700 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:40:22,701 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-07-25 08:40:22,702 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-07-25 08:40:22,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:40:22,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:40:22,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:40:22,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:40:22,765 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:40:22,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:40:22,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:40:22,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:40:22,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:40:22,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:40:22,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:40:22,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:40:22,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:40:22,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/1) ... [2018-07-25 08:40:22,905 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-25 08:40:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:40:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:40:23,027 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:40:23,028 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:40:23 BoogieIcfgContainer [2018-07-25 08:40:23,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:40:23,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:40:23,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:40:23,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:40:23,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:40:22" (1/2) ... [2018-07-25 08:40:23,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2021e2b8 and model type count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:40:23, skipping insertion in model container [2018-07-25 08:40:23,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:40:23" (2/2) ... [2018-07-25 08:40:23,038 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-07-25 08:40:23,048 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:40:23,056 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:40:23,104 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:40:23,105 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:40:23,105 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:40:23,105 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:40:23,105 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:40:23,106 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:40:23,106 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:40:23,106 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:40:23,106 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:40:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 08:40:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:40:23,130 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:23,131 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:40:23,132 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-07-25 08:40:23,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:23,227 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-25 08:40:23,229 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:40:23,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:40:23,233 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:40:23,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:40:23,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:40:23,247 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-25 08:40:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:23,274 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-25 08:40:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:40:23,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 08:40:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:23,287 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:40:23,287 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:40:23,292 INFO L574 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-25 08:40:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:40:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:40:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:40:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:40:23,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:40:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:23,335 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:40:23,335 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:40:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:40:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:40:23,336 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:23,336 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:40:23,336 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-07-25 08:40:23,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:23,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:23,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:40:23,366 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:40:23,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:40:23,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:40:23,367 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 08:40:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:23,384 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:40:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:40:23,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 08:40:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:23,385 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:40:23,385 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:40:23,387 INFO L574 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-25 08:40:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:40:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:40:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:40:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:40:23,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:40:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:23,393 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:40:23,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:40:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:40:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:40:23,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:23,394 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 08:40:23,395 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:23,395 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-07-25 08:40:23,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:23,463 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:23,463 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:40:23,464 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:40:23,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:40:23,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:40:23,465 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 08:40:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:23,507 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:40:23,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:40:23,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 08:40:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:23,508 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:40:23,508 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:40:23,509 INFO L574 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-25 08:40:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:40:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:40:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:40:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:40:23,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:40:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:23,513 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:40:23,513 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:40:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:40:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:40:23,514 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:23,514 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 08:40:23,514 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-07-25 08:40:23,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:23,571 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-25 08:40:23,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:23,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:40:23,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:40:23,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:40:23,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:40:23,575 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 08:40:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:23,647 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:40:23,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:40:23,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:40:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:23,648 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:40:23,649 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:40:23,654 INFO L574 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-25 08:40:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:40:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:40:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:40:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:40:23,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:40:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:23,661 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:40:23,661 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:40:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:40:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:40:23,662 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:23,662 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 08:40:23,662 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:23,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-07-25 08:40:23,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:23,707 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:23,707 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:40:23,707 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:40:23,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:40:23,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:40:23,708 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 08:40:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:23,814 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:40:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:40:23,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 08:40:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:23,815 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:40:23,815 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:40:23,816 INFO L574 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-25 08:40:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:40:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:40:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:40:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:40:23,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:40:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:23,820 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:40:23,820 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:40:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:40:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:40:23,821 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:23,821 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 08:40:23,822 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-07-25 08:40:23,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:23,868 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:23,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:40:23,869 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:40:23,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:40:23,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:40:23,870 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 08:40:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:23,950 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:40:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:40:23,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:40:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:23,952 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:40:23,952 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:40:23,953 INFO L574 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-25 08:40:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:40:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:40:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:40:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:40:23,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:40:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:23,958 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:40:23,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:40:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:40:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:40:23,959 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:23,959 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 08:40:23,960 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-07-25 08:40:23,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:24,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:24,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:40:24,024 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:40:24,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:40:24,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:40:24,026 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 08:40:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:24,170 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:40:24,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:40:24,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 08:40:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:24,171 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:40:24,172 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:40:24,174 INFO L574 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-25 08:40:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:40:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:40:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:40:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:40:24,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:40:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:24,188 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:40:24,188 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:40:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:40:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:40:24,189 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:24,189 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 08:40:24,190 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:24,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-07-25 08:40:24,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:24,269 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:24,269 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:40:24,270 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:40:24,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:40:24,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:40:24,271 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 08:40:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:24,371 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:40:24,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:40:24,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 08:40:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:24,372 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:40:24,372 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:40:24,373 INFO L574 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-25 08:40:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:40:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:40:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:40:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:40:24,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:40:24,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:24,378 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:40:24,378 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:40:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:40:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:40:24,379 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:24,379 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 08:40:24,380 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-07-25 08:40:24,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:24,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:24,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:40:24,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:40:24,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:40:24,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:40:24,430 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 08:40:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:24,550 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:40:24,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:40:24,551 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 08:40:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:24,552 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:40:24,552 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:40:24,554 INFO L574 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-25 08:40:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:40:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:40:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:40:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:40:24,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:40:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:24,563 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:40:24,563 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:40:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:40:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:40:24,564 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:24,564 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 08:40:24,566 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-07-25 08:40:24,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:24,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:24,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:40:24,633 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:40:24,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:40:24,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:40:24,634 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 08:40:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:24,766 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:40:24,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:40:24,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 08:40:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:24,767 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:40:24,768 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:40:24,770 INFO L574 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-25 08:40:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:40:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:40:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:40:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:40:24,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:40:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:24,778 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:40:24,779 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:40:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:40:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:40:24,780 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:24,781 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 08:40:24,781 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-07-25 08:40:24,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:24,867 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:24,867 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:40:24,868 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:40:24,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:40:24,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:40:24,869 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 08:40:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:25,022 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:40:25,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:40:25,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 08:40:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:25,023 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:40:25,023 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:40:25,024 INFO L574 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-25 08:40:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:40:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:40:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:40:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:40:25,033 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:40:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:25,034 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:40:25,034 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:40:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:40:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:40:25,035 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:25,035 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 08:40:25,035 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-07-25 08:40:25,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:25,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:25,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:40:25,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:40:25,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:40:25,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:40:25,112 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 08:40:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:25,271 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 08:40:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:40:25,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 08:40:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:25,272 INFO L225 Difference]: With dead ends: 18 [2018-07-25 08:40:25,272 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 08:40:25,273 INFO L574 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-25 08:40:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 08:40:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 08:40:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 08:40:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 08:40:25,277 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 08:40:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:25,278 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 08:40:25,278 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:40:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 08:40:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:40:25,281 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:25,282 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 08:40:25,282 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-07-25 08:40:25,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:25,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:25,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:40:25,374 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:40:25,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:40:25,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:40:25,375 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 08:40:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:25,565 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:40:25,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:40:25,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 08:40:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:25,567 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:40:25,567 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:40:25,568 INFO L574 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-25 08:40:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:40:25,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:40:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:40:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:40:25,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 08:40:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:25,577 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:40:25,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:40:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:40:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:40:25,578 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:25,578 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 08:40:25,579 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-07-25 08:40:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:25,680 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:25,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:40:25,685 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:40:25,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:40:25,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:40:25,686 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 08:40:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:25,945 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 08:40:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:40:25,945 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 08:40:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:25,946 INFO L225 Difference]: With dead ends: 20 [2018-07-25 08:40:25,946 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 08:40:25,947 INFO L574 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-25 08:40:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 08:40:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 08:40:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 08:40:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 08:40:25,953 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 08:40:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:25,954 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 08:40:25,954 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:40:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 08:40:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:40:25,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:25,955 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 08:40:25,955 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:25,955 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-07-25 08:40:25,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:26,057 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:26,057 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:40:26,057 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:40:26,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:40:26,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:40:26,058 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 08:40:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:26,326 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:40:26,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:40:26,327 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 08:40:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:26,328 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:40:26,328 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:40:26,330 INFO L574 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-25 08:40:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:40:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:40:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:40:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:40:26,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 08:40:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:26,338 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:40:26,338 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:40:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:40:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:40:26,339 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:26,339 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 08:40:26,340 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-07-25 08:40:26,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:26,451 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:26,451 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:40:26,452 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:40:26,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:40:26,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:40:26,456 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 08:40:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:26,723 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 08:40:26,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:40:26,723 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 08:40:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:26,724 INFO L225 Difference]: With dead ends: 22 [2018-07-25 08:40:26,724 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 08:40:26,727 INFO L574 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-25 08:40:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 08:40:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 08:40:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 08:40:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 08:40:26,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 08:40:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:26,734 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 08:40:26,734 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:40:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 08:40:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:40:26,736 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:26,736 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 08:40:26,737 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-07-25 08:40:26,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:26,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:26,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:40:26,883 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:40:26,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:40:26,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:40:26,884 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 08:40:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:27,194 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:40:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:40:27,195 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 08:40:27,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:27,196 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:40:27,196 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:40:27,197 INFO L574 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-25 08:40:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:40:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:40:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:40:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:40:27,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 08:40:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:27,203 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:40:27,203 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:40:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:40:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:40:27,205 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:27,205 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 08:40:27,205 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-07-25 08:40:27,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:27,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:27,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:40:27,302 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:40:27,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:40:27,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:40:27,303 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 08:40:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:27,577 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 08:40:27,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:40:27,577 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 08:40:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:27,578 INFO L225 Difference]: With dead ends: 24 [2018-07-25 08:40:27,578 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 08:40:27,579 INFO L574 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-25 08:40:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 08:40:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 08:40:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 08:40:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 08:40:27,584 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 08:40:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:27,585 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 08:40:27,585 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:40:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 08:40:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:40:27,586 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:27,586 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 08:40:27,586 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-07-25 08:40:27,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:27,700 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:27,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:40:27,700 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:40:27,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:40:27,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:40:27,702 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 08:40:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:28,030 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:40:28,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:40:28,030 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 08:40:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:28,031 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:40:28,031 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:40:28,033 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:40:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:40:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:40:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:40:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:40:28,037 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 08:40:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:28,038 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:40:28,038 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:40:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:40:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:40:28,039 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:28,039 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 08:40:28,039 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-07-25 08:40:28,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:28,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:28,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:40:28,162 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:40:28,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:40:28,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:40:28,163 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 08:40:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:28,510 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 08:40:28,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:40:28,510 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 08:40:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:28,511 INFO L225 Difference]: With dead ends: 26 [2018-07-25 08:40:28,511 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 08:40:28,512 INFO L574 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-25 08:40:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 08:40:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 08:40:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 08:40:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 08:40:28,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 08:40:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:28,517 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 08:40:28,517 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:40:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 08:40:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:40:28,518 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:28,518 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 08:40:28,519 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:28,519 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-07-25 08:40:28,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:28,643 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-25 08:40:28,644 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:28,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:40:28,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:40:28,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:40:28,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:40:28,645 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 08:40:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:29,055 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:40:29,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:40:29,055 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 08:40:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:29,056 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:40:29,056 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:40:29,057 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:40:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:40:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:40:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:40:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:40:29,062 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 08:40:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:29,063 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:40:29,063 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:40:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:40:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:40:29,064 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:29,064 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 08:40:29,064 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:29,065 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-07-25 08:40:29,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:29,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:29,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:40:29,244 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:40:29,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:40:29,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:40:29,245 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 08:40:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:29,672 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 08:40:29,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:40:29,674 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 08:40:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:29,677 INFO L225 Difference]: With dead ends: 28 [2018-07-25 08:40:29,677 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 08:40:29,679 INFO L574 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-25 08:40:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 08:40:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 08:40:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 08:40:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 08:40:29,689 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 08:40:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:29,690 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 08:40:29,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:40:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 08:40:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:29,691 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:29,691 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 08:40:29,692 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-07-25 08:40:29,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:29,837 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:29,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:40:29,837 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:40:29,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:40:29,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:40:29,838 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 08:40:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:30,314 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:40:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:40:30,315 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 08:40:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:30,315 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:40:30,315 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:40:30,317 INFO L574 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-25 08:40:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:40:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:40:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:40:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:40:30,323 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 08:40:30,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:30,324 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:40:30,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:40:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:40:30,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:40:30,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:30,325 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 08:40:30,325 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-07-25 08:40:30,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:30,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:30,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:40:30,490 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:40:30,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:40:30,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:40:30,491 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 08:40:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:30,975 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 08:40:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:40:30,975 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 08:40:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:30,976 INFO L225 Difference]: With dead ends: 30 [2018-07-25 08:40:30,976 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 08:40:30,977 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:40:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 08:40:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 08:40:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 08:40:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 08:40:30,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 08:40:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:30,985 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 08:40:30,985 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:40:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 08:40:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 08:40:30,986 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:30,986 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 08:40:30,987 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:30,987 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-07-25 08:40:30,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:31,137 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:31,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:40:31,138 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:40:31,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:40:31,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:40:31,139 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 08:40:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:31,716 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:40:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:40:31,717 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 08:40:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:31,717 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:40:31,718 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:40:31,719 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:40:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:40:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:40:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:40:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:40:31,725 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 08:40:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:31,725 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:40:31,725 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:40:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:40:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:40:31,726 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:31,726 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 08:40:31,726 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-07-25 08:40:31,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:31,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:31,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:40:31,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:40:31,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:40:31,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:40:31,904 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 08:40:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:32,387 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 08:40:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:40:32,387 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 08:40:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:32,387 INFO L225 Difference]: With dead ends: 32 [2018-07-25 08:40:32,388 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:40:32,389 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:40:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:40:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 08:40:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:40:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 08:40:32,395 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 08:40:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:32,395 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 08:40:32,395 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:40:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 08:40:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 08:40:32,396 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:32,396 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 08:40:32,396 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-07-25 08:40:32,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:32,569 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:32,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:40:32,570 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:40:32,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:40:32,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:40:32,571 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 08:40:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:33,098 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:40:33,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:40:33,098 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 08:40:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:33,099 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:40:33,099 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:40:33,101 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:40:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:40:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:40:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:40:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:40:33,105 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 08:40:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:33,106 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:40:33,106 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:40:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:40:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:40:33,107 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:33,107 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 08:40:33,107 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-07-25 08:40:33,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:33,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:33,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:40:33,279 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:40:33,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:40:33,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:40:33,280 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 08:40:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:33,908 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 08:40:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:40:33,909 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 08:40:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:33,910 INFO L225 Difference]: With dead ends: 34 [2018-07-25 08:40:33,910 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 08:40:33,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:40:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 08:40:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 08:40:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 08:40:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 08:40:33,918 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 08:40:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:33,918 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 08:40:33,919 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:40:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 08:40:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 08:40:33,919 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:33,920 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 08:40:33,920 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-07-25 08:40:33,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:34,129 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:34,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:40:34,130 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:40:34,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:40:34,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:40:34,131 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 08:40:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:34,809 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:40:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:40:34,809 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 08:40:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:34,810 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:40:34,810 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:40:34,811 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:40:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:40:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:40:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:40:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:40:34,817 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 08:40:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:34,817 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:40:34,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:40:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:40:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:40:34,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:34,818 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 08:40:34,818 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:34,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-07-25 08:40:34,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:34,987 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:34,987 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:40:34,987 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:40:34,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:40:34,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:40:34,988 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 08:40:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:35,644 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 08:40:35,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:40:35,645 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 08:40:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:35,645 INFO L225 Difference]: With dead ends: 36 [2018-07-25 08:40:35,645 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 08:40:35,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:40:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 08:40:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 08:40:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 08:40:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 08:40:35,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 08:40:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:35,653 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 08:40:35,653 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:40:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 08:40:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 08:40:35,654 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:35,654 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 08:40:35,654 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:35,654 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-07-25 08:40:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:35,837 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:35,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:40:35,837 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:40:35,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:40:35,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:40:35,838 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 08:40:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:36,586 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:40:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:40:36,586 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 08:40:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:36,587 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:40:36,587 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:40:36,589 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:40:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:40:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:40:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:40:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:40:36,594 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 08:40:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:36,594 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:40:36,594 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:40:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:40:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:40:36,595 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:36,595 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 08:40:36,595 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-07-25 08:40:36,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:36,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:36,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:40:36,810 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:40:36,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:40:36,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:40:36,812 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 08:40:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:37,672 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 08:40:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:40:37,672 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 08:40:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:37,673 INFO L225 Difference]: With dead ends: 38 [2018-07-25 08:40:37,673 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 08:40:37,676 INFO L574 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-25 08:40:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 08:40:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 08:40:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 08:40:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 08:40:37,688 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 08:40:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:37,688 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 08:40:37,689 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:40:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 08:40:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 08:40:37,689 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:37,689 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 08:40:37,690 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-07-25 08:40:37,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:37,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:37,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:40:37,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:40:37,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:40:37,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:40:37,906 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 08:40:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:38,889 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:40:38,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:40:38,890 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 08:40:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:38,890 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:40:38,891 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:40:38,893 INFO L574 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-25 08:40:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:40:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:40:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:40:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:40:38,900 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 08:40:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:38,902 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:40:38,902 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:40:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:40:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:40:38,903 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:38,903 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 08:40:38,903 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-07-25 08:40:38,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:39,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:39,200 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:40:39,200 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:40:39,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:40:39,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:40:39,201 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 08:40:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:40,020 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 08:40:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:40:40,021 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 08:40:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:40,021 INFO L225 Difference]: With dead ends: 40 [2018-07-25 08:40:40,021 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 08:40:40,023 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:40:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 08:40:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 08:40:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 08:40:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 08:40:40,028 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 08:40:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:40,028 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 08:40:40,028 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:40:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 08:40:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 08:40:40,029 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:40,029 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 08:40:40,029 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-07-25 08:40:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:40,250 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:40,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:40:40,251 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:40:40,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:40:40,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:40:40,252 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 08:40:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:41,134 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:40:41,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:40:41,135 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 08:40:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:41,136 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:40:41,136 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:40:41,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:40:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:40:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:40:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:40:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:40:41,147 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 08:40:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:41,148 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:40:41,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:40:41,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:40:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:40:41,148 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:41,148 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 08:40:41,149 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-07-25 08:40:41,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:41,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:41,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:40:41,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:40:41,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:40:41,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:40:41,369 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 08:40:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:42,413 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 08:40:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:40:42,413 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 08:40:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:42,414 INFO L225 Difference]: With dead ends: 42 [2018-07-25 08:40:42,414 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 08:40:42,415 INFO L574 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-25 08:40:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 08:40:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 08:40:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 08:40:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 08:40:42,420 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 08:40:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:42,420 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 08:40:42,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:40:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 08:40:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 08:40:42,421 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:42,421 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 08:40:42,422 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-07-25 08:40:42,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:42,660 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:42,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:40:42,660 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:40:42,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:40:42,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:40:42,661 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 08:40:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:43,707 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:40:43,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:40:43,708 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 08:40:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:43,709 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:40:43,709 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:40:43,710 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:40:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:40:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:40:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:40:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:40:43,717 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 08:40:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:43,717 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:40:43,717 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:40:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:40:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:40:43,719 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:43,720 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 08:40:43,720 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-07-25 08:40:43,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:44,041 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:44,041 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:40:44,041 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:40:44,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:40:44,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:40:44,042 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 08:40:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:45,224 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 08:40:45,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:40:45,224 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 08:40:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:45,224 INFO L225 Difference]: With dead ends: 44 [2018-07-25 08:40:45,225 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 08:40:45,227 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:40:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 08:40:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 08:40:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 08:40:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 08:40:45,235 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 08:40:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:45,235 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 08:40:45,235 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:40:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 08:40:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:40:45,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:45,236 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 08:40:45,236 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-07-25 08:40:45,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:45,470 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:45,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:40:45,471 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:40:45,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:40:45,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:40:45,472 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 08:40:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:46,561 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:40:46,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:40:46,561 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 08:40:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:46,562 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:40:46,562 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:40:46,563 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:40:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:40:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:40:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:40:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:40:46,568 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 08:40:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:46,568 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:40:46,569 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:40:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:40:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:40:46,569 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:46,569 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 08:40:46,569 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-07-25 08:40:46,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:46,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:46,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:40:46,834 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:40:46,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:40:46,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:40:46,837 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 08:40:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:47,710 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 08:40:47,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:40:47,710 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 08:40:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:47,711 INFO L225 Difference]: With dead ends: 46 [2018-07-25 08:40:47,711 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 08:40:47,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:40:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 08:40:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 08:40:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 08:40:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 08:40:47,716 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 08:40:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:47,717 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 08:40:47,717 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:40:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 08:40:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 08:40:47,717 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:47,717 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 08:40:47,718 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-07-25 08:40:47,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:47,911 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:47,911 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:40:47,911 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:40:47,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:40:47,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:40:47,912 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 08:40:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:48,928 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:40:48,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:40:48,928 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 08:40:48,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:48,928 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:40:48,929 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:40:48,929 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:40:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:40:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:40:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:40:48,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:40:48,934 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 08:40:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:48,935 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:40:48,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:40:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:40:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:40:48,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:48,936 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 08:40:48,936 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:48,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-07-25 08:40:48,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:49,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:49,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:40:49,142 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:40:49,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:40:49,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:40:49,142 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 08:40:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:50,042 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 08:40:50,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:40:50,042 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 08:40:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:50,043 INFO L225 Difference]: With dead ends: 48 [2018-07-25 08:40:50,043 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:40:50,044 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:40:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:40:50,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 08:40:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 08:40:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 08:40:50,051 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 08:40:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:50,052 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 08:40:50,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:40:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 08:40:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 08:40:50,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:50,052 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 08:40:50,053 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-07-25 08:40:50,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:50,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:50,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:40:50,261 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:40:50,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:40:50,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:40:50,262 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 08:40:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:51,305 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:40:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:40:51,305 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 08:40:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:51,306 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:40:51,306 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:40:51,307 INFO L574 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-25 08:40:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:40:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:40:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:40:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:40:51,311 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 08:40:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:51,312 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:40:51,312 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:40:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:40:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:40:51,312 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:51,312 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 08:40:51,313 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-07-25 08:40:51,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:51,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:51,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:40:51,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:40:51,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:40:51,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:40:51,541 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 08:40:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:52,635 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 08:40:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:40:52,635 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 08:40:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:52,636 INFO L225 Difference]: With dead ends: 50 [2018-07-25 08:40:52,636 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 08:40:52,637 INFO L574 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-25 08:40:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 08:40:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 08:40:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 08:40:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 08:40:52,640 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 08:40:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:52,641 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 08:40:52,641 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:40:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 08:40:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 08:40:52,641 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:52,641 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 08:40:52,641 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-07-25 08:40:52,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:52,853 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:52,853 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:40:52,854 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:40:52,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:40:52,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:40:52,854 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 08:40:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:54,083 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:40:54,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:40:54,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 08:40:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:54,084 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:40:54,084 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:40:54,084 INFO L574 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-25 08:40:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:40:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:40:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:40:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:40:54,089 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 08:40:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:54,089 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:40:54,089 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:40:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:40:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:40:54,089 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:54,090 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 08:40:54,090 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-07-25 08:40:54,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:54,339 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:54,339 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:40:54,339 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:40:54,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:40:54,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:40:54,340 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 08:40:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:55,524 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 08:40:55,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:40:55,524 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 08:40:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:55,525 INFO L225 Difference]: With dead ends: 52 [2018-07-25 08:40:55,525 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 08:40:55,526 INFO L574 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-25 08:40:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 08:40:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 08:40:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 08:40:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 08:40:55,530 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 08:40:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:55,530 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 08:40:55,530 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:40:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 08:40:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 08:40:55,531 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:55,531 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 08:40:55,531 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-07-25 08:40:55,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:55,774 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:55,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:40:55,774 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:40:55,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:40:55,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:40:55,775 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 08:40:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:57,020 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:40:57,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:40:57,020 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 08:40:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:57,021 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:40:57,021 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:40:57,022 INFO L574 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-25 08:40:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:40:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:40:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:40:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:40:57,025 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 08:40:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:57,026 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:40:57,026 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:40:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:40:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:40:57,026 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:57,026 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 08:40:57,026 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:57,027 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-07-25 08:40:57,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:57,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:57,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:40:57,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:40:57,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:40:57,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:40:57,291 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 08:40:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:58,785 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 08:40:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:40:58,786 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 08:40:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:58,786 INFO L225 Difference]: With dead ends: 54 [2018-07-25 08:40:58,786 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 08:40:58,787 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:40:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 08:40:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 08:40:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 08:40:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 08:40:58,792 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 08:40:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:58,792 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 08:40:58,792 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:40:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 08:40:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 08:40:58,792 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:58,793 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 08:40:58,793 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-07-25 08:40:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:59,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:59,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:40:59,068 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:40:59,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:40:59,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:40:59,069 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 08:41:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:00,544 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:41:00,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:41:00,545 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 08:41:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:00,545 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:41:00,545 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:41:00,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:41:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:41:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:41:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:41:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:41:00,551 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 08:41:00,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:00,551 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:41:00,551 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:41:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:41:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:41:00,552 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:00,552 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 08:41:00,552 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:00,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-07-25 08:41:00,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:00,836 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:00,836 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:41:00,836 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:41:00,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:41:00,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:41:00,837 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 08:41:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:02,300 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 08:41:02,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:41:02,300 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 08:41:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:02,301 INFO L225 Difference]: With dead ends: 56 [2018-07-25 08:41:02,301 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 08:41:02,302 INFO L574 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-25 08:41:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 08:41:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 08:41:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 08:41:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 08:41:02,307 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 08:41:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:02,307 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 08:41:02,307 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:41:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 08:41:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 08:41:02,308 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:02,308 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 08:41:02,308 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:02,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-07-25 08:41:02,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:02,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:02,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:41:02,722 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:41:02,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:41:02,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:41:02,723 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 08:41:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:04,684 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:41:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:41:04,685 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 08:41:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:04,685 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:41:04,685 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:41:04,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:41:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:41:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:41:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:41:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:41:04,698 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 08:41:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:04,698 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:41:04,698 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:41:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:41:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:41:04,699 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:04,699 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 08:41:04,699 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-07-25 08:41:04,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:05,164 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:05,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:41:05,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:41:05,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:41:05,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:41:05,166 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 08:41:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:06,875 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 08:41:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:41:06,875 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 08:41:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:06,876 INFO L225 Difference]: With dead ends: 58 [2018-07-25 08:41:06,876 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 08:41:06,877 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:41:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 08:41:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 08:41:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 08:41:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 08:41:06,880 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 08:41:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:06,880 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 08:41:06,880 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:41:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 08:41:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 08:41:06,881 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:06,881 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 08:41:06,881 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-07-25 08:41:06,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:07,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:07,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:41:07,188 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:41:07,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:41:07,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:41:07,189 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 08:41:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:08,999 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:41:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:41:08,999 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 08:41:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:08,999 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:41:09,000 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:41:09,000 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:41:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:41:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:41:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:41:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:41:09,004 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 08:41:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:09,004 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:41:09,004 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:41:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:41:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:41:09,004 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:09,004 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 08:41:09,005 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-07-25 08:41:09,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:09,338 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:09,338 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:41:09,338 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:41:09,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:41:09,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:41:09,339 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 08:41:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:11,143 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 08:41:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:41:11,143 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 08:41:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:11,144 INFO L225 Difference]: With dead ends: 60 [2018-07-25 08:41:11,144 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 08:41:11,145 INFO L574 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-25 08:41:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 08:41:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 08:41:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 08:41:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 08:41:11,150 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 08:41:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:11,151 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 08:41:11,151 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:41:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 08:41:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 08:41:11,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:11,152 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 08:41:11,152 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-07-25 08:41:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:11,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:11,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:41:11,503 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:41:11,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:41:11,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:41:11,504 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 08:41:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:13,388 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:41:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:41:13,388 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 08:41:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:13,389 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:41:13,389 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:41:13,390 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:41:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:41:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:41:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:41:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:41:13,393 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 08:41:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:13,393 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:41:13,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:41:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:41:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:41:13,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:13,394 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 08:41:13,395 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:13,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-07-25 08:41:13,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:13,780 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:13,780 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:41:13,781 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:41:13,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:41:13,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:41:13,781 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 08:41:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:15,870 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 08:41:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:41:15,870 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 08:41:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:15,871 INFO L225 Difference]: With dead ends: 62 [2018-07-25 08:41:15,871 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 08:41:15,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:41:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 08:41:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 08:41:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 08:41:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 08:41:15,875 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 08:41:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:15,876 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 08:41:15,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:41:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 08:41:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 08:41:15,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:15,876 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 08:41:15,876 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-07-25 08:41:15,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:16,253 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:16,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:41:16,254 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:41:16,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:41:16,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:41:16,255 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 08:41:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:18,445 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:41:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:41:18,446 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 08:41:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:18,446 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:41:18,446 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:41:18,447 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:41:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:41:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:41:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:41:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:41:18,451 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 08:41:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:18,451 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:41:18,451 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:41:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:41:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:41:18,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:18,452 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 08:41:18,452 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:18,452 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-07-25 08:41:18,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:18,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:18,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:41:18,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:41:18,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:41:18,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:41:18,897 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 08:41:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:21,103 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 08:41:21,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:41:21,103 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 08:41:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:21,104 INFO L225 Difference]: With dead ends: 64 [2018-07-25 08:41:21,104 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 08:41:21,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:41:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 08:41:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 08:41:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 08:41:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 08:41:21,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 08:41:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:21,110 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 08:41:21,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:41:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 08:41:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 08:41:21,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:21,111 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 08:41:21,111 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-07-25 08:41:21,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:21,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:21,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:41:21,542 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:41:21,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:41:21,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:41:21,543 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 08:41:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,913 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:41:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:41:23,914 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 08:41:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,914 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:41:23,914 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:41:23,915 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:41:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:41:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:41:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:41:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:41:23,919 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 08:41:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,919 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:41:23,919 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:41:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:41:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:41:23,920 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,920 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 08:41:23,920 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-07-25 08:41:23,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:24,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:24,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:41:24,395 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:41:24,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:41:24,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:41:24,396 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 08:41:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:26,893 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 08:41:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:41:26,894 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 08:41:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:26,894 INFO L225 Difference]: With dead ends: 66 [2018-07-25 08:41:26,894 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 08:41:26,895 INFO L574 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-25 08:41:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 08:41:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 08:41:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 08:41:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 08:41:26,901 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 08:41:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:26,901 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 08:41:26,901 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:41:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 08:41:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 08:41:26,902 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:26,902 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 08:41:26,902 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-07-25 08:41:26,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:27,310 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:27,310 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:41:27,311 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:41:27,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:41:27,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:41:27,311 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 08:41:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:29,664 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:41:29,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:41:29,664 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 08:41:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:29,665 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:41:29,665 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:41:29,666 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:41:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:41:29,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:41:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:41:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:41:29,672 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 08:41:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:29,672 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:41:29,672 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:41:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:41:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:41:29,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:29,676 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 08:41:29,676 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-07-25 08:41:29,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:30,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:30,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:41:30,205 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:41:30,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:41:30,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:41:30,206 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 08:41:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:32,997 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 08:41:32,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:41:32,997 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 08:41:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:32,998 INFO L225 Difference]: With dead ends: 68 [2018-07-25 08:41:32,998 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 08:41:32,999 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:41:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 08:41:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 08:41:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 08:41:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 08:41:33,004 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 08:41:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:33,004 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 08:41:33,004 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:41:33,004 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 08:41:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 08:41:33,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:33,005 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 08:41:33,006 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-07-25 08:41:33,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:33,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:33,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:41:33,506 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:41:33,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:41:33,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:41:33,507 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 08:41:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:36,042 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:41:36,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:41:36,042 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 08:41:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:36,043 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:41:36,043 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:41:36,044 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:41:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:41:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:41:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:41:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:41:36,049 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 08:41:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:36,050 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:41:36,050 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:41:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:41:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:41:36,050 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:36,051 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 08:41:36,051 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-07-25 08:41:36,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:36,521 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:36,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:41:36,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:41:36,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:41:36,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:41:36,522 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 08:41:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:39,347 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 08:41:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:41:39,347 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 08:41:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:39,348 INFO L225 Difference]: With dead ends: 70 [2018-07-25 08:41:39,348 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 08:41:39,349 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:41:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 08:41:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 08:41:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 08:41:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 08:41:39,355 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 08:41:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:39,355 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 08:41:39,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:41:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 08:41:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 08:41:39,356 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:39,356 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 08:41:39,357 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-07-25 08:41:39,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:39,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:39,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:41:39,858 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:41:39,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:41:39,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:41:39,859 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 08:41:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:42,806 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:41:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:41:42,806 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 08:41:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:42,807 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:41:42,807 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:41:42,808 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:41:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:41:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:41:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:41:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:41:42,814 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 08:41:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:42,814 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:41:42,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:41:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:41:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:41:42,815 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:42,815 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 08:41:42,815 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-07-25 08:41:42,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:43,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:43,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:41:43,327 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:41:43,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:41:43,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:41:43,328 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 08:41:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:46,082 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 08:41:46,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:41:46,082 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 08:41:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:46,082 INFO L225 Difference]: With dead ends: 72 [2018-07-25 08:41:46,082 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 08:41:46,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:41:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 08:41:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 08:41:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:41:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 08:41:46,089 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 08:41:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:46,090 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 08:41:46,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:41:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 08:41:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 08:41:46,090 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:46,091 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 08:41:46,091 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-07-25 08:41:46,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:46,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:46,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:41:46,554 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:41:46,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:41:46,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:41:46,555 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 08:41:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:49,464 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:41:49,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:41:49,464 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 08:41:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:49,464 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:41:49,465 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:41:49,466 INFO L574 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-25 08:41:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:41:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:41:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:41:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:41:49,471 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 08:41:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:49,471 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:41:49,472 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:41:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:41:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:41:49,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:49,472 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 08:41:49,473 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:49,473 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-07-25 08:41:49,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:50,029 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:50,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:41:50,030 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:41:50,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:41:50,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:41:50,030 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 08:41:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:53,180 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 08:41:53,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:41:53,180 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 08:41:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:53,181 INFO L225 Difference]: With dead ends: 74 [2018-07-25 08:41:53,181 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 08:41:53,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:41:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 08:41:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 08:41:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:41:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 08:41:53,188 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 08:41:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:53,188 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 08:41:53,188 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:41:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 08:41:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 08:41:53,189 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:53,189 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 08:41:53,189 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-07-25 08:41:53,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:53,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:53,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:41:53,727 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:41:53,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:41:53,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:41:53,728 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 08:41:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:56,911 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:41:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:41:56,911 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 08:41:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:56,912 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:41:56,912 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:41:56,912 INFO L574 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-25 08:41:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:41:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:41:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:41:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:41:56,916 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 08:41:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:56,916 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:41:56,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:41:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:41:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:41:56,916 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:56,917 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 08:41:56,917 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-07-25 08:41:56,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:57,465 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:57,465 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:41:57,465 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:41:57,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:41:57,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:41:57,466 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 08:42:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:01,002 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 08:42:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:42:01,002 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 08:42:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:01,002 INFO L225 Difference]: With dead ends: 76 [2018-07-25 08:42:01,003 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 08:42:01,004 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:42:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 08:42:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 08:42:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 08:42:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 08:42:01,008 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 08:42:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:01,008 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 08:42:01,008 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:42:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 08:42:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 08:42:01,008 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:01,008 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 08:42:01,008 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:01,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-07-25 08:42:01,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:01,594 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:01,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:42:01,594 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:42:01,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:42:01,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:42:01,595 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 08:42:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:05,290 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:42:05,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:42:05,290 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 08:42:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:05,291 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:42:05,291 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:42:05,292 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:42:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:42:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:42:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:42:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:42:05,296 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 08:42:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:05,296 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:42:05,296 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:42:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:42:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:42:05,296 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:05,297 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 08:42:05,297 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:05,297 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-07-25 08:42:05,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:06,087 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:06,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:42:06,087 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:42:06,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:42:06,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:42:06,088 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 08:42:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:09,932 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 08:42:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:42:09,932 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 08:42:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:09,933 INFO L225 Difference]: With dead ends: 78 [2018-07-25 08:42:09,933 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:42:09,934 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:42:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:42:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:42:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:42:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 08:42:09,937 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 08:42:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:09,938 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 08:42:09,938 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:42:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 08:42:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 08:42:09,938 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:09,938 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 08:42:09,938 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-07-25 08:42:09,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:10,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:10,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:42:10,498 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:42:10,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:42:10,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:42:10,499 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 08:42:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:14,443 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:42:14,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:42:14,443 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 08:42:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:14,444 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:42:14,444 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:42:14,445 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:42:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:42:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:42:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:42:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:42:14,451 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 08:42:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:14,451 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:42:14,451 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:42:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:42:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:42:14,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:14,452 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 08:42:14,452 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:14,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-07-25 08:42:14,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:15,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:15,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:42:15,247 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:42:15,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:42:15,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:42:15,248 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 08:42:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:19,326 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 08:42:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:42:19,326 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 08:42:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:19,327 INFO L225 Difference]: With dead ends: 80 [2018-07-25 08:42:19,327 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:42:19,329 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:42:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:42:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 08:42:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:42:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 08:42:19,335 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 08:42:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:19,335 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 08:42:19,336 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:42:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 08:42:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 08:42:19,336 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:19,336 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 08:42:19,337 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-07-25 08:42:19,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:20,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:20,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:42:20,318 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:42:20,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:42:20,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:42:20,318 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 08:42:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:24,282 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:42:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:42:24,283 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 08:42:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:24,283 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:42:24,284 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:42:24,285 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:42:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:42:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:42:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:42:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:42:24,291 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 08:42:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:24,291 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:42:24,291 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:42:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:42:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:42:24,291 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:24,291 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 08:42:24,292 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-07-25 08:42:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:24,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:24,928 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:42:24,928 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:42:24,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:42:24,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:42:24,929 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 08:42:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:29,375 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 08:42:29,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:42:29,375 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 08:42:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:29,376 INFO L225 Difference]: With dead ends: 82 [2018-07-25 08:42:29,376 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 08:42:29,377 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:42:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 08:42:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 08:42:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 08:42:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 08:42:29,384 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 08:42:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:29,384 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 08:42:29,384 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:42:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 08:42:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 08:42:29,385 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:29,385 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 08:42:29,385 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-07-25 08:42:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:30,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:30,362 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:42:30,363 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:42:30,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:42:30,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:42:30,364 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 08:42:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:34,985 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:42:34,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:42:34,985 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 08:42:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:34,986 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:42:34,986 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:42:34,987 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6083, Invalid=17787, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:42:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:42:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:42:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:42:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:42:34,992 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 08:42:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:34,992 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:42:34,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:42:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:42:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:42:34,992 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:34,992 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 08:42:34,993 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-07-25 08:42:34,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:35,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:35,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:42:35,653 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:42:35,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:42:35,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:42:35,653 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 08:42:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:40,258 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 08:42:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:42:40,258 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 08:42:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:40,259 INFO L225 Difference]: With dead ends: 84 [2018-07-25 08:42:40,259 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 08:42:40,260 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:42:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 08:42:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 08:42:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 08:42:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 08:42:40,264 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 08:42:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:40,264 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 08:42:40,264 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:42:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 08:42:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 08:42:40,265 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:40,265 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 08:42:40,265 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-07-25 08:42:40,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:40,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:40,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:42:40,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:42:40,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:42:40,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:42:40,969 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 08:42:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:45,945 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:42:45,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:42:45,945 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 08:42:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:45,945 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:42:45,946 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:42:45,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:42:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:42:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:42:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:42:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:42:45,953 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 08:42:45,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:45,953 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:42:45,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:42:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:42:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:42:45,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:45,954 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 08:42:45,954 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:45,955 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-07-25 08:42:45,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:46,671 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:46,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:42:46,671 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:42:46,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:42:46,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:42:46,672 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 08:42:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:51,745 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 08:42:51,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:42:51,745 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 08:42:51,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:51,745 INFO L225 Difference]: With dead ends: 86 [2018-07-25 08:42:51,745 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 08:42:51,746 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:42:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 08:42:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 08:42:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 08:42:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 08:42:51,751 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 08:42:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:51,752 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 08:42:51,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:42:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 08:42:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 08:42:51,753 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:51,753 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 08:42:51,753 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:51,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-07-25 08:42:51,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:52,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:52,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:42:52,506 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:42:52,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:42:52,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:42:52,506 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 08:42:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:57,613 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:42:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:42:57,613 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 08:42:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:57,614 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:42:57,614 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:42:57,616 INFO L574 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-25 08:42:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:42:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:42:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:42:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:42:57,623 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 08:42:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:57,623 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:42:57,623 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:42:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:42:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:42:57,624 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:57,624 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 08:42:57,624 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-07-25 08:42:57,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:58,432 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:58,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:42:58,433 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:42:58,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:42:58,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:42:58,434 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 08:43:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:04,441 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 08:43:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:43:04,442 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 08:43:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:04,442 INFO L225 Difference]: With dead ends: 88 [2018-07-25 08:43:04,442 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 08:43:04,443 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:43:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 08:43:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 08:43:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 08:43:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 08:43:04,449 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 08:43:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:04,449 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 08:43:04,450 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:43:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 08:43:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 08:43:04,450 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:04,450 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 08:43:04,451 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-07-25 08:43:04,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:05,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:05,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:43:05,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:43:05,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:43:05,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:43:05,304 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 08:43:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:11,360 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:43:11,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:43:11,360 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 08:43:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:11,361 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:43:11,361 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:43:11,362 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:43:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:43:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:43:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:43:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:43:11,368 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 08:43:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:11,368 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:43:11,368 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:43:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:43:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:43:11,369 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:11,369 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 08:43:11,369 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-07-25 08:43:11,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:12,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:12,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:43:12,208 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:43:12,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:43:12,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:43:12,209 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 08:43:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:17,927 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 08:43:17,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:43:17,928 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 08:43:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:17,928 INFO L225 Difference]: With dead ends: 90 [2018-07-25 08:43:17,928 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 08:43:17,929 INFO L574 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-25 08:43:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 08:43:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 08:43:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 08:43:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 08:43:17,933 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 08:43:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:17,933 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 08:43:17,933 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:43:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 08:43:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 08:43:17,934 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:17,934 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 08:43:17,934 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-07-25 08:43:17,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:18,839 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:18,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:43:18,839 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:43:18,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:43:18,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:43:18,840 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 08:43:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:24,610 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:43:24,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:43:24,610 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 08:43:24,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:24,610 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:43:24,610 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:43:24,611 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:43:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:43:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:43:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:43:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:43:24,618 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 08:43:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:24,618 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:43:24,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:43:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:43:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:43:24,619 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:24,619 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 08:43:24,619 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:24,620 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-07-25 08:43:24,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:25,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:25,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:43:25,566 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:43:25,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:43:25,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:43:25,567 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-25 08:43:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:31,653 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 08:43:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:43:31,654 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-25 08:43:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:31,654 INFO L225 Difference]: With dead ends: 92 [2018-07-25 08:43:31,654 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:43:31,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:43:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:43:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 08:43:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 08:43:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 08:43:31,660 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 08:43:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:31,660 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 08:43:31,660 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:43:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 08:43:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 08:43:31,661 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:31,661 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-25 08:43:31,661 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-07-25 08:43:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:32,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:32,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:43:32,495 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:43:32,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:43:32,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:43:32,496 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-25 08:43:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:38,738 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:43:38,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:43:38,738 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-25 08:43:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:38,739 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:43:38,739 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:43:38,740 INFO L574 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-25 08:43:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:43:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:43:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:43:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:43:38,747 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 08:43:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:38,748 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:43:38,748 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:43:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:43:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:43:38,749 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:38,749 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-25 08:43:38,749 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-07-25 08:43:38,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:39,709 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:39,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:43:39,710 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:43:39,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:43:39,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:43:39,711 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-25 08:43:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:46,301 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 08:43:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:43:46,301 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-25 08:43:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:46,302 INFO L225 Difference]: With dead ends: 94 [2018-07-25 08:43:46,302 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 08:43:46,303 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:43:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 08:43:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 08:43:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 08:43:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 08:43:46,308 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 08:43:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:46,309 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 08:43:46,309 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:43:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 08:43:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 08:43:46,309 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:46,309 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-25 08:43:46,309 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:46,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-07-25 08:43:46,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:47,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:47,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:43:47,336 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:43:47,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:43:47,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:43:47,336 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-25 08:43:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:54,503 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:43:54,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:43:54,503 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-25 08:43:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:54,504 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:43:54,504 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:43:54,505 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 08:43:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:43:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:43:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:43:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:43:54,511 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 08:43:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:54,511 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:43:54,511 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:43:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:43:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:43:54,512 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:54,512 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-25 08:43:54,512 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:54,512 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-07-25 08:43:54,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:55,484 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:55,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:43:55,484 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:43:55,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:43:55,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:43:55,485 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-25 08:44:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:02,738 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 08:44:02,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:44:02,738 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-25 08:44:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:02,739 INFO L225 Difference]: With dead ends: 96 [2018-07-25 08:44:02,739 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:44:02,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8280, Invalid=24300, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 08:44:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:44:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:44:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:44:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 08:44:02,745 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 08:44:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:02,746 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 08:44:02,746 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:44:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 08:44:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 08:44:02,746 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:02,746 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-25 08:44:02,747 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-07-25 08:44:02,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:03,842 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:03,842 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:44:03,843 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:44:03,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:44:03,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:44:03,843 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-25 08:44:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:11,733 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:44:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:44:11,733 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-25 08:44:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:11,734 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:44:11,734 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:44:11,735 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=8463, Invalid=24843, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 08:44:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:44:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:44:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:44:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:44:11,742 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 08:44:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:11,742 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:44:11,742 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:44:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:44:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:44:11,743 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:11,743 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-25 08:44:11,743 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:11,743 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-07-25 08:44:11,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:13,073 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:13,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:44:13,073 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:44:13,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:44:13,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:44:13,074 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-25 08:44:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:20,439 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 08:44:20,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:44:20,440 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-25 08:44:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:20,440 INFO L225 Difference]: With dead ends: 98 [2018-07-25 08:44:20,440 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:44:20,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8648, Invalid=25392, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 08:44:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:44:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 08:44:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:44:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 08:44:20,448 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 08:44:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:20,448 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 08:44:20,448 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:44:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 08:44:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 08:44:20,449 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:20,449 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-25 08:44:20,449 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-07-25 08:44:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:21,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:21,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:44:21,683 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:44:21,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:44:21,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:44:21,684 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-25 08:44:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:29,149 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:44:29,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:44:29,149 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-25 08:44:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:29,149 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:44:29,149 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:44:29,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=8835, Invalid=25947, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 08:44:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:44:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:44:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:44:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:44:29,155 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 08:44:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:29,156 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:44:29,156 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:44:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:44:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:44:29,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:29,156 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-25 08:44:29,156 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-07-25 08:44:29,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:30,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:30,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:44:30,199 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:44:30,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:44:30,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:44:30,200 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. Received shutdown request... [2018-07-25 08:44:37,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:44:37,861 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:44:37,865 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:44:37,866 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:44:37 BoogieIcfgContainer [2018-07-25 08:44:37,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:44:37,868 INFO L168 Benchmark]: Toolchain (without parser) took 255105.83 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 233.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-25 08:44:37,870 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-25 08:44:37,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.87 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-25 08:44:37,871 INFO L168 Benchmark]: Boogie Preprocessor took 22.91 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-25 08:44:37,876 INFO L168 Benchmark]: RCFGBuilder took 198.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:44:37,877 INFO L168 Benchmark]: TraceAbstraction took 254836.98 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 222.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-25 08:44:37,881 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.23 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 Procedure Inliner took 41.87 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 22.91 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 198.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254836.98 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 222.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 87 states, 96 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 181 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 254.7s OverallTime, 94 OverallIterations, 93 TraceHistogramMax, 215.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 280 SDtfs, 0 SDslu, 4371 SDs, 0 SdLazy, 9200 SolverSat, 4278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8922 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8827 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133421 ImplicationChecksByTransitivity, 228.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 93 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 16.4s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 4653 NumberOfCodeBlocks, 4653 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 4559 ConstructedInterpolants, 0 QuantifiedInterpolants, 1424255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 94 InterpolantComputations, 1 PerfectInterpolantSequences, 0/138415 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-44-37-896.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-44-37-896.csv Completed graceful shutdown